1. 8.44 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  2. 8.46 s Progress: 0 of 35 built (1 building), 47 of 73 downloaded from cache (15 downloading)
  3. 8.46 s Progress: 0 of 34 built (1 building), 48 of 73 downloaded from cache (14 downloading)
  4. 8.48 s [Cabal-syntax] [2 of 2] Linking Setup
  5. 8.50 s Progress: 0 of 33 built (1 building), 49 of 73 downloaded from cache (13 downloading)
  6. 8.54 s Progress: 0 of 33 built (1 building), 50 of 73 downloaded from cache (12 downloading)
  7. 8.55 s Progress: 0 of 32 built (1 building), 51 of 73 downloaded from cache (11 downloading)
  8. 8.55 s Downloading cached mockery from https://cache.nix-ci.com
  9. 8.57 s Progress: 0 of 32 built (1 building), 52 of 73 downloaded from cache (11 downloading)
  10. 8.57 s Downloading cached tf-random from https://cache.nix-ci.com
  11. 8.58 s Progress: 0 of 32 built (1 building), 53 of 73 downloaded from cache (11 downloading)
  12. 8.58 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  13. 8.58 s Progress: 0 of 32 built (1 building), 54 of 73 downloaded from cache (11 downloading)
  14. 8.58 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  15. 8.61 s Progress: 0 of 32 built (1 building), 55 of 73 downloaded from cache (11 downloading)
  16. 8.61 s Progress: 0 of 32 built (1 building), 56 of 73 downloaded from cache (10 downloading)
  17. 8.64 s Progress: 0 of 32 built (1 building), 57 of 73 downloaded from cache (9 downloading)
  18. 8.64 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  19. 8.64 s Progress: 0 of 32 built (1 building), 58 of 73 downloaded from cache (9 downloading)
  20. 8.65 s Downloading cached hspec-2.11.14-doc from https://cache.nix-ci.com
  21. 8.69 s Progress: 0 of 32 built (1 building), 59 of 73 downloaded from cache (9 downloading)
  22. 8.69 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  23. 8.71 s Progress: 0 of 32 built (1 building), 60 of 73 downloaded from cache (9 downloading)
  24. 8.72 s Progress: 0 of 31 built (1 building), 61 of 73 downloaded from cache (8 downloading)
  25. 8.73 s Progress: 0 of 30 built (1 building), 62 of 73 downloaded from cache (7 downloading)
  26. 8.73 s Downloading cached hedgehog from https://cache.nix-ci.com
  27. 8.84 s Progress: 0 of 29 built (1 building), 63 of 73 downloaded from cache (7 downloading)
  28. 8.87 s Progress: 0 of 28 built (1 building), 64 of 73 downloaded from cache (6 downloading)
  29. 8.89 s Progress: 0 of 27 built (1 building), 65 of 73 downloaded from cache (5 downloading)
  30. 8.89 s Downloading cached hspec-core from https://cache.nix-ci.com
  31. 8.95 s Progress: 0 of 27 built (1 building), 66 of 73 downloaded from cache (5 downloading)
  32. 8.95 s Progress: 0 of 27 built (1 building), 67 of 73 downloaded from cache (4 downloading)
  33. 8.99 s Progress: 0 of 26 built (1 building), 68 of 73 downloaded from cache (3 downloading)
  34. 9.09 s Progress: 0 of 25 built (1 building), 69 of 73 downloaded from cache (2 downloading)
  35. 9.36 s Progress: 0 of 25 built (1 building), 70 of 73 downloaded from cache (1 downloading)
  36. 9.36 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  37. 9.43 s Progress: 0 of 24 built (1 building), 71 of 73 downloaded from cache (1 downloading)
  38. 9.43 s Downloading cached hspec from https://cache.nix-ci.com
  39. 9.65 s [Cabal-syntax] Phase: updateAutotoolsGnuConfigScriptsPhase
  40. 9.66 s [Cabal-syntax] Phase: configurePhase
  41. 9.67 s [Cabal-syntax] configureFlags: --verbose --prefix=/nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.cj85LIS8Gy/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  42. 9.68 s Progress: 0 of 23 built (1 building), 72 of 73 downloaded from cache (1 downloading)
  43. 9.68 s [Cabal-syntax] Using Parsec parser
  44. 9.68 s [Cabal-syntax] Configuring Cabal-syntax-3.12.1.0...
  45. 9.94 s Progress: 0 of 22 built (1 building), 73 of 73 downloaded from cache
  46. 9.95 s [Cabal-syntax] Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
  47. 9.95 s [Cabal-syntax] Dependency base >=4.11 && <5: using base-4.18.3.0
  48. 9.95 s [Cabal-syntax] Dependency binary >=0.7 && <0.9: using binary-0.8.9.1
  49. 9.95 s [Cabal-syntax] Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.11.5.4
  50. 9.95 s [Cabal-syntax] Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.7
  51. 9.95 s [Cabal-syntax] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  52. 9.95 s [Cabal-syntax] Dependency directory >=1.2 && <1.4: using directory-1.3.8.5
  53. 9.95 s [Cabal-syntax] Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.301.0
  54. 9.95 s [Cabal-syntax] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  55. 9.95 s [Cabal-syntax] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.16.1
  56. 9.95 s [Cabal-syntax] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  57. 9.95 s [Cabal-syntax] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  58. 9.95 s [Cabal-syntax] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  59. 9.95 s [Cabal-syntax] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  60. 9.95 s [Cabal-syntax] transformers-0.6.1.0
  61. 10.23 s [Cabal-syntax] Source component graph: component lib
  62. 10.23 s [Cabal-syntax] Configured component graph:
  63. 10.23 s [Cabal-syntax] component Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  64. 10.23 s [Cabal-syntax] include array-0.5.8.0
  65. 10.23 s [Cabal-syntax] include base-4.18.3.0
  66. 10.23 s [Cabal-syntax] include binary-0.8.9.1
  67. 10.23 s [Cabal-syntax] include bytestring-0.11.5.4
  68. 10.23 s [Cabal-syntax] include containers-0.6.7
  69. 10.23 s [Cabal-syntax] include deepseq-1.4.8.1
  70. 10.23 s [Cabal-syntax] include directory-1.3.8.5
  71. 10.23 s [Cabal-syntax] include filepath-1.4.301.0
  72. 10.23 s [Cabal-syntax] include mtl-2.3.1
  73. 10.23 s [Cabal-syntax] include parsec-3.1.16.1
  74. 10.23 s [Cabal-syntax] include pretty-1.1.3.6
  75. 10.23 s [Cabal-syntax] include text-2.0.2
  76. 10.23 s [Cabal-syntax] include time-1.12.2
  77. 10.23 s [Cabal-syntax] include transformers-0.6.1.0
  78. 10.23 s [Cabal-syntax] Linked component graph:
  79. 10.23 s [Cabal-syntax] unit Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  80. 10.23 s [Cabal-syntax] include array-0.5.8.0
  81. 10.23 s [Cabal-syntax] include base-4.18.3.0
  82. 10.23 s [Cabal-syntax] include binary-0.8.9.1
  83. 10.23 s [Cabal-syntax] include bytestring-0.11.5.4
  84. 10.23 s [Cabal-syntax] include containers-0.6.7
  85. 10.23 s [Cabal-syntax] include deepseq-1.4.8.1
  86. 10.23 s [Cabal-syntax] include directory-1.3.8.5
  87. 10.23 s [Cabal-syntax] include filepath-1.4.301.0
  88. 10.23 s [Cabal-syntax] include mtl-2.3.1
  89. 10.23 s [Cabal-syntax] include parsec-3.1.16.1
  90. 10.23 s [Cabal-syntax] include pretty-1.1.3.6
  91. 10.23 s [Cabal-syntax] include text-2.0.2
  92. 10.23 s [Cabal-syntax] include time-1.12.2
  93. 10.23 s [Cabal-syntax] include transformers-0.6.1.0
  94. 10.23 s [Cabal-syntax] Distribution.Backpack=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Backpack,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.CharParsing,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.DList,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Exception,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Graph,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Prelude,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Semigroup,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.License,Distribution.ModuleName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Pretty,Distribution.SPDX=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseReference,Distribution.System=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.System,Distribution.Text=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.AbiHash,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentId,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.DependencyMap,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LibraryVisibility,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageName,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageVersionConstraint,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SourceRepo.Lens,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Generic,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.MD5,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Path,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Structured,Distribution.Version=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Language.Haskell.Extension
  95. 10.23 s [Cabal-syntax] Ready component graph:
  96. 10.23 s [Cabal-syntax] definite Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  97. 10.23 s [Cabal-syntax] depends array-0.5.8.0
  98. 10.23 s [Cabal-syntax] depends base-4.18.3.0
  99. 10.23 s [Cabal-syntax] depends binary-0.8.9.1
  100. 10.23 s [Cabal-syntax] depends bytestring-0.11.5.4
  101. 10.23 s [Cabal-syntax] depends containers-0.6.7
  102. 10.23 s [Cabal-syntax] depends deepseq-1.4.8.1
  103. 10.23 s [Cabal-syntax] depends directory-1.3.8.5
  104. 10.23 s [Cabal-syntax] depends filepath-1.4.301.0
  105. 10.23 s [Cabal-syntax] depends mtl-2.3.1
  106. 10.23 s [Cabal-syntax] depends parsec-3.1.16.1
  107. 10.23 s [Cabal-syntax] depends pretty-1.1.3.6
  108. 10.24 s [Cabal-syntax] depends text-2.0.2
  109. 10.24 s [Cabal-syntax] depends time-1.12.2
  110. 10.24 s [Cabal-syntax] depends transformers-0.6.1.0
  111. 10.24 s [Cabal-syntax] Using Cabal-3.10.3.0 compiled by ghc-9.6
  112. 10.24 s [Cabal-syntax] Using compiler: ghc-9.6.7
  113. 10.24 s [Cabal-syntax] Using install prefix:
  114. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0
  115. 10.24 s [Cabal-syntax] Executables installed in:
  116. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/bin
  117. 10.24 s [Cabal-syntax] Libraries installed in:
  118. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  119. 10.24 s [Cabal-syntax] Dynamic Libraries installed in:
  120. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  121. 10.24 s [Cabal-syntax] Private executables installed in:
  122. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/libexec/x86_64-linux-ghc-9.6.7/Cabal-syntax-3.12.1.0
  123. 10.24 s [Cabal-syntax] Data files installed in:
  124. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/share/x86_64-linux-ghc-9.6.7/Cabal-syntax-3.12.1.0
  125. 10.24 s [Cabal-syntax] Documentation installed in:
  126. 10.24 s [Cabal-syntax] /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0
  127. 10.24 s [Cabal-syntax] Configuration files installed in:
  128. 10.24 s [Cabal-syntax] /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/etc
  129. 10.24 s [Cabal-syntax] Using alex version 3.5.4.0 found on system at:
  130. 10.24 s [Cabal-syntax] /nix/store/nqlm55zyb2qvp4d7p2sykrra4jwrm9s9-alex-3.5.4.0/bin/alex
  131. 10.24 s [Cabal-syntax] Using ar found on system at:
  132. 10.24 s [Cabal-syntax] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  133. 10.24 s [Cabal-syntax] No c2hs found
  134. 10.24 s [Cabal-syntax] No cpphs found
  135. 10.24 s [Cabal-syntax] No doctest found
  136. 10.24 s [Cabal-syntax] Using gcc version 14.3.0 given by user at:
  137. 10.24 s [Cabal-syntax] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  138. 10.24 s [Cabal-syntax] Using ghc version 9.6.7 found on system at:
  139. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  140. 10.24 s [Cabal-syntax] Using ghc-pkg version 9.6.7 found on system at:
  141. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  142. 10.24 s [Cabal-syntax] No ghcjs found
  143. 10.24 s [Cabal-syntax] No ghcjs-pkg found
  144. 10.24 s [Cabal-syntax] No greencard found
  145. 10.24 s [Cabal-syntax] Using haddock version 2.29.2 found on system at:
  146. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  147. 10.24 s [Cabal-syntax] No happy found
  148. 10.24 s [Cabal-syntax] Using haskell-suite found on system at: haskell-suite-dummy-location
  149. 10.24 s [Cabal-syntax] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  150. 10.24 s [Cabal-syntax] No hmake found
  151. 10.24 s [Cabal-syntax] Using hpc version 0.68 found on system at:
  152. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  153. 10.24 s [Cabal-syntax] Using hsc2hs version 0.68.9 found on system at:
  154. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  155. 10.24 s [Cabal-syntax] Using hscolour version 1.25 found on system at:
  156. 10.24 s [Cabal-syntax] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  157. 10.24 s [Cabal-syntax] No jhc found
  158. 10.24 s [Cabal-syntax] Using ld found on system at:
  159. 10.24 s [Cabal-syntax] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  160. 10.24 s [Cabal-syntax] No pkg-config found
  161. 10.24 s [Cabal-syntax] Using runghc version 9.6.7 found on system at:
  162. 10.24 s [Cabal-syntax] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  163. 10.24 s [Cabal-syntax] Using strip version 2.44 found on system at:
  164. 10.24 s [Cabal-syntax] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  165. 10.24 s [Cabal-syntax] Using tar found on system at:
  166. 10.24 s [Cabal-syntax] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  167. 10.24 s [Cabal-syntax] No uhc found
  168. 10.38 s [Cabal-syntax] Phase: buildPhase
  169. 10.42 s [Cabal-syntax] Preprocessing library for Cabal-syntax-3.12.1.0..
  170. 10.46 s [Cabal-syntax] Building library for Cabal-syntax-3.12.1.0..
  171. 10.99 s [Cabal-syntax] [ 1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.o, dist/build/Distribution/Compat/Binary.dyn_o )
  172. 11.09 s [Cabal-syntax] [ 2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o, dist/build/Distribution/Compat/Exception.dyn_o )
  173. 11.09 s [Cabal-syntax] [ 3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.o, dist/build/Distribution/Compat/MonadFail.dyn_o )
  174. 11.09 s [Cabal-syntax] [ 4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.o, dist/build/Distribution/Compat/Newtype.dyn_o )
  175. 11.10 s [Cabal-syntax] [ 5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.o, dist/build/Distribution/Compat/Typeable.dyn_o )
  176. 11.10 s [Cabal-syntax] [ 6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.o, dist/build/Distribution/PackageDescription/Utils.dyn_o )
  177. 11.10 s [Cabal-syntax] [ 7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.o, dist/build/Distribution/Utils/Base62.dyn_o )
  178. 11.10 s [Cabal-syntax] [ 8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.o, dist/build/Distribution/Utils/MD5.dyn_o )
  179. 11.19 s [Cabal-syntax] [ 9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.o, dist/build/Distribution/Utils/String.dyn_o )
  180. 11.19 s [Cabal-syntax] [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.o, dist/build/Distribution/Utils/Structured.dyn_o )
  181. 12.77 s [Cabal-syntax] [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.o, dist/build/Distribution/Compat/Semigroup.dyn_o )
  182. 13.09 s [Cabal-syntax] [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.o, dist/build/Distribution/Compat/NonEmptySet.dyn_o )
  183. 13.14 s [Cabal-syntax] [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.o, dist/build/Distribution/Compat/Prelude.dyn_o )
  184. 13.21 s [Cabal-syntax] [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.o, dist/build/Distribution/Utils/ShortText.dyn_o )
  185. 13.70 s [Cabal-syntax] [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.o, dist/build/Distribution/Utils/Generic.dyn_o )
  186. 13.94 s [Cabal-syntax] [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.o, dist/build/Distribution/Types/Condition.dyn_o )
  187. 14.32 s [Cabal-syntax] [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.o, dist/build/Distribution/Parsec/Position.dyn_o )
  188. 14.32 s [Cabal-syntax] [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.o, dist/build/Distribution/Parsec/Warning.dyn_o )
  189. 14.86 s [Cabal-syntax] [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.o, dist/build/Distribution/Parsec/FieldLineStream.dyn_o )
  190. 14.86 s [Cabal-syntax] [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.o, dist/build/Distribution/Parsec/Error.dyn_o )
  191. 14.86 s [Cabal-syntax] [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.o, dist/build/Distribution/PackageDescription/Quirks.dyn_o )
  192. 14.86 s [Cabal-syntax] [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.o, dist/build/Distribution/Fields/LexerMonad.dyn_o )
  193. 15.12 s [Cabal-syntax] [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.o, dist/build/Distribution/Fields/Lexer.dyn_o )
  194. 15.57 s [Cabal-syntax] [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.o, dist/build/Distribution/Compat/Parsing.dyn_o )
  195. 15.57 s [Cabal-syntax] [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.o, dist/build/Distribution/Compat/DList.dyn_o )
  196. 15.57 s [Cabal-syntax] [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.o, dist/build/Distribution/Compat/Lens.dyn_o )
  197. 15.57 s [Cabal-syntax] [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.o, dist/build/Distribution/Types/CondTree.dyn_o )
  198. 15.61 s [Cabal-syntax] [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.o, dist/build/Distribution/Compat/CharParsing.dyn_o )
  199. 15.61 s [Cabal-syntax] [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.o, dist/build/Distribution/CabalSpecVersion.dyn_o )
  200. 15.61 s [Cabal-syntax] [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.o, dist/build/Distribution/SPDX/LicenseListVersion.dyn_o )
  201. 15.61 s [Cabal-syntax] [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.o, dist/build/Distribution/Pretty.dyn_o )
  202. 15.61 s [Cabal-syntax] [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.o, dist/build/Distribution/Fields/Field.dyn_o )
  203. 15.98 s [Cabal-syntax] [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.o, dist/build/Distribution/Fields/Parser.dyn_o )
  204. 16.75 s [Cabal-syntax] [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.o, dist/build/Distribution/Fields/Pretty.dyn_o )
  205. 19.12 s [Cabal-syntax] [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.o, dist/build/Distribution/Parsec.dyn_o )
  206. 19.17 s [Cabal-syntax] [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.o, dist/build/Distribution/Utils/Path.dyn_o )
  207. 19.17 s [Cabal-syntax] [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.o, dist/build/Distribution/Types/Version.dyn_o )
  208. 22.18 s [Cabal-syntax] [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.o, dist/build/Distribution/Types/VersionRange/Internal.dyn_o )
  209. 30.55 s [Cabal-syntax] [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.o, dist/build/Distribution/Types/VersionInterval/Legacy.dyn_o )
  210. 33.57 s [Cabal-syntax] [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.o, dist/build/Distribution/Types/VersionInterval.dyn_o )
  211. 33.57 s [Cabal-syntax] [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.o, dist/build/Distribution/Types/VersionRange.dyn_o )
  212. 33.72 s [Cabal-syntax] [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.o, dist/build/Distribution/Types/SourceRepo.dyn_o )
  213. 33.72 s [Cabal-syntax] [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.o, dist/build/Distribution/Types/SourceRepo/Lens.dyn_o )
  214. 33.72 s [Cabal-syntax] [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.o, dist/build/Distribution/Types/PkgconfigVersion.dyn_o )
  215. 33.72 s [Cabal-syntax] [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.o, dist/build/Distribution/Types/PkgconfigVersionRange.dyn_o )
  216. 41.28 s [Cabal-syntax] [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.o, dist/build/Distribution/Types/PkgconfigName.dyn_o )
  217. 41.31 s [Cabal-syntax] [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.o, dist/build/Distribution/Types/PkgconfigDependency.dyn_o )
  218. 41.99 s [Cabal-syntax] [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.o, dist/build/Distribution/Types/PackageName.dyn_o )
  219. 41.99 s [Cabal-syntax] [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.o, dist/build/Distribution/Types/UnqualComponentName.dyn_o )
  220. 41.99 s [Cabal-syntax] [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.o, dist/build/Distribution/Types/LibraryVisibility.dyn_o )
  221. 41.99 s [Cabal-syntax] [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.o, dist/build/Distribution/Types/LibraryName.dyn_o )
  222. 42.00 s [Cabal-syntax] [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.o, dist/build/Distribution/Types/MungedPackageName.dyn_o )
  223. 42.00 s [Cabal-syntax] [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.o, dist/build/Distribution/Types/ForeignLibType.dyn_o )
  224. 42.00 s [Cabal-syntax] [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.o, dist/build/Distribution/Types/ForeignLibOption.dyn_o )
  225. 42.00 s [Cabal-syntax] [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.o, dist/build/Distribution/Types/Flag.dyn_o )
  226. 42.00 s [Cabal-syntax] [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.o, dist/build/Distribution/Types/ExecutableScope.dyn_o )
  227. 42.00 s [Cabal-syntax] [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.o, dist/build/Distribution/Types/ComponentName.dyn_o )
  228. 42.00 s [Cabal-syntax] [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.o, dist/build/Distribution/Types/ComponentId.dyn_o )
  229. 42.00 s [Cabal-syntax] [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.o, dist/build/Distribution/Types/BuildType.dyn_o )
  230. 42.00 s [Cabal-syntax] [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.o, dist/build/Distribution/Types/AbiHash.dyn_o )
  231. 42.00 s [Cabal-syntax] [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.o, dist/build/Distribution/Text.dyn_o )
  232. 42.00 s [Cabal-syntax] [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.o, dist/build/Distribution/System.dyn_o )
  233. 42.00 s [Cabal-syntax] [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.o, dist/build/Distribution/SPDX/LicenseReference.dyn_o )
  234. 42.00 s [Cabal-syntax] [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.o, dist/build/Distribution/SPDX/LicenseId.dyn_o )
  235. 46.19 s [Cabal-syntax] [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.o, dist/build/Distribution/SPDX/LicenseExceptionId.dyn_o )
  236. 46.20 s [Cabal-syntax] [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.o, dist/build/Distribution/SPDX/LicenseExpression.dyn_o )
  237. 47.89 s [Cabal-syntax] [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.o, dist/build/Distribution/SPDX/License.dyn_o )
  238. 48.32 s [Cabal-syntax] [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.o, dist/build/Distribution/SPDX.dyn_o )
  239. 48.38 s [Cabal-syntax] [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.o, dist/build/Distribution/ModuleName.dyn_o )
  240. 48.38 s [Cabal-syntax] [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.o, dist/build/Distribution/Types/ModuleRenaming.dyn_o )
  241. 48.38 s [Cabal-syntax] [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.o, dist/build/Distribution/Types/IncludeRenaming.dyn_o )
  242. 48.38 s [Cabal-syntax] [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.o, dist/build/Distribution/Types/Mixin.dyn_o )
  243. 48.38 s [Cabal-syntax] [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.o, dist/build/Distribution/Types/ModuleReexport.dyn_o )
  244. 48.38 s [Cabal-syntax] [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.o, dist/build/Distribution/Compat/Graph.dyn_o )
  245. 48.38 s [Cabal-syntax] [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.o, dist/build/Distribution/Version.dyn_o )
  246. 48.38 s [Cabal-syntax] [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.o, dist/build/Distribution/Types/TestType.dyn_o )
  247. 48.38 s [Cabal-syntax] [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.o, dist/build/Distribution/Types/TestSuiteInterface.dyn_o )
  248. 48.38 s [Cabal-syntax] [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.o, dist/build/Distribution/Types/PackageId.dyn_o )
  249. 48.38 s [Cabal-syntax] [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.o, dist/build/Distribution/Types/UnitId.dyn_o )
  250. 48.38 s [Cabal-syntax] [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.o, dist/build/Distribution/Types/Module.dyn_o )
  251. 48.38 s [Cabal-syntax] [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.o, dist/build/Distribution/Backpack.dyn_o )
  252. 48.38 s [Cabal-syntax] [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.o, dist/build/Distribution/Types/ExposedModule.dyn_o )
  253. 48.38 s [Cabal-syntax] [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.o, dist/build/Distribution/Types/PackageVersionConstraint.dyn_o )
  254. 48.38 s [Cabal-syntax] [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.o, dist/build/Distribution/Types/PackageId/Lens.dyn_o )
  255. 48.38 s [Cabal-syntax] [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.o, dist/build/Distribution/Types/MungedPackageId.dyn_o )
  256. 48.38 s [Cabal-syntax] [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.o, dist/build/Distribution/Types/LegacyExeDependency.dyn_o )
  257. 48.38 s [Cabal-syntax] [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.o, dist/build/Distribution/Types/ExeDependency.dyn_o )
  258. 48.38 s [Cabal-syntax] [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.o, dist/build/Distribution/Types/Dependency.dyn_o )
  259. 48.38 s [Cabal-syntax] [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.o, dist/build/Distribution/Types/SetupBuildInfo.dyn_o )
  260. 48.38 s [Cabal-syntax] [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.o, dist/build/Distribution/Types/SetupBuildInfo/Lens.dyn_o )
  261. 48.38 s [Cabal-syntax] [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.o, dist/build/Distribution/Types/DependencyMap.dyn_o )
  262. 48.38 s [Cabal-syntax] [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.o, dist/build/Distribution/Types/BenchmarkType.dyn_o )
  263. 48.38 s [Cabal-syntax] [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.o, dist/build/Distribution/Types/BenchmarkInterface.dyn_o )
  264. 48.38 s [Cabal-syntax] [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.o, dist/build/Distribution/Package.dyn_o )
  265. 48.38 s [Cabal-syntax] [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.o, dist/build/Distribution/Types/AbiDependency.dyn_o )
  266. 48.38 s [Cabal-syntax] [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.o, dist/build/Distribution/License.dyn_o )
  267. 50.82 s [Cabal-syntax] [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.o, dist/build/Distribution/Types/InstalledPackageInfo.dyn_o )
  268. 53.62 s [Cabal-syntax] [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.o, dist/build/Distribution/Types/InstalledPackageInfo/Lens.dyn_o )
  269. 54.62 s [Cabal-syntax] [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.o, dist/build/Distribution/Fields/ParseResult.dyn_o )
  270. 54.62 s [Cabal-syntax] [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.o, dist/build/Distribution/Fields.dyn_o )
  271. 54.62 s [Cabal-syntax] [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.o, dist/build/Language/Haskell/Extension.dyn_o )
  272. 54.62 s [Cabal-syntax] [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.o, dist/build/Distribution/Compiler.dyn_o )
  273. 54.62 s [Cabal-syntax] [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.o, dist/build/Distribution/Types/ConfVar.dyn_o )
  274. 54.62 s [Cabal-syntax] [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.o, dist/build/Distribution/Fields/ConfVar.dyn_o )
  275. 54.62 s [Cabal-syntax] [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.o, dist/build/Distribution/Types/BuildInfo.dyn_o )
  276. 54.62 s [Cabal-syntax] [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.o, dist/build/Distribution/Types/HookedBuildInfo.dyn_o )
  277. 54.62 s [Cabal-syntax] [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.o, dist/build/Distribution/Types/BuildInfo/Lens.dyn_o )
  278. 54.67 s [Cabal-syntax] [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.o, dist/build/Distribution/Types/TestSuite.dyn_o )
  279. 58.50 s [Cabal-syntax] [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.o, dist/build/Distribution/Types/TestSuite/Lens.dyn_o )
  280. 58.55 s [Cabal-syntax] [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.o, dist/build/Distribution/Types/Library.dyn_o )
  281. 58.64 s [Cabal-syntax] [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.o, dist/build/Distribution/Types/Library/Lens.dyn_o )
  282. 58.70 s [Cabal-syntax] [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.o, dist/build/Distribution/Types/ForeignLib.dyn_o )
  283. 59.03 s [Cabal-syntax] [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.o, dist/build/Distribution/Types/ForeignLib/Lens.dyn_o )
  284. 59.08 s [Cabal-syntax] [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.o, dist/build/Distribution/Types/Executable.dyn_o )
  285. 59.08 s [Cabal-syntax] [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.o, dist/build/Distribution/Types/Executable/Lens.dyn_o )
  286. 59.08 s [Cabal-syntax] [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.o, dist/build/Distribution/Types/Benchmark.dyn_o )
  287. 59.08 s [Cabal-syntax] [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.o, dist/build/Distribution/Types/Component.dyn_o )
  288. 60.22 s [Cabal-syntax] [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.o, dist/build/Distribution/Types/ComponentRequestedSpec.dyn_o )
  289. 60.50 s [Cabal-syntax] [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.o, dist/build/Distribution/Types/PackageDescription.dyn_o )
  290. 63.05 s [Cabal-syntax] [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.o, dist/build/Distribution/Types/GenericPackageDescription.dyn_o )
  291. 64.14 s [Cabal-syntax] [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.o, dist/build/Distribution/Types/GenericPackageDescription/Lens.dyn_o )
  292. 64.39 s [Cabal-syntax] [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.o, dist/build/Distribution/Types/Benchmark/Lens.dyn_o )
  293. 64.39 s [Cabal-syntax] [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.o, dist/build/Distribution/Types/PackageDescription/Lens.dyn_o )
  294. 64.39 s [Cabal-syntax] [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.o, dist/build/Distribution/Types/Lens.dyn_o )
  295. 64.64 s [Cabal-syntax] [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.o, dist/build/Distribution/PackageDescription.dyn_o )
  296. 64.65 s [Cabal-syntax] [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.o, dist/build/Distribution/PackageDescription/Configuration.dyn_o )
  297. 65.56 s [Cabal-syntax] [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.o, dist/build/Distribution/FieldGrammar/Newtypes.dyn_o )
  298. 65.57 s [Cabal-syntax] [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.o, dist/build/Distribution/FieldGrammar/Class.dyn_o )
  299. 65.57 s [Cabal-syntax] [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.o, dist/build/Distribution/FieldGrammar/Pretty.dyn_o )
  300. 65.57 s [Cabal-syntax] [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.o, dist/build/Distribution/FieldGrammar/Parsec.dyn_o )
  301. 65.57 s [Cabal-syntax] [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.o, dist/build/Distribution/FieldGrammar.dyn_o )
  302. 65.57 s [Cabal-syntax] [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.o, dist/build/Distribution/PackageDescription/FieldGrammar.dyn_o )
  303. 71.91 s [Cabal-syntax] [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.o, dist/build/Distribution/PackageDescription/PrettyPrint.dyn_o )
  304. 72.37 s [Cabal-syntax] [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.o, dist/build/Distribution/PackageDescription/Parsec.dyn_o )
  305. 75.70 s [Cabal-syntax] [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.o, dist/build/Distribution/FieldGrammar/FieldDescrs.dyn_o )
  306. 75.70 s [Cabal-syntax] [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.o, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.dyn_o )
  307. 75.70 s [Cabal-syntax] [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.o, dist/build/Distribution/InstalledPackageInfo.dyn_o )
  308. 76.65 s [Cabal-syntax] [ 1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.p_o )
  309. 76.96 s [Cabal-syntax] [ 2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.p_o )
  310. 77.00 s [Cabal-syntax] [ 3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.p_o )
  311. 77.00 s [Cabal-syntax] [ 4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.p_o )
  312. 77.00 s [Cabal-syntax] [ 5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.p_o )
  313. 77.00 s [Cabal-syntax] [ 6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.p_o )
  314. 77.00 s [Cabal-syntax] [ 7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.p_o )
  315. 77.00 s [Cabal-syntax] [ 8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.p_o )
  316. 77.06 s [Cabal-syntax] [ 9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.p_o )
  317. 77.06 s [Cabal-syntax] [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.p_o )
  318. 79.04 s [Cabal-syntax] [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.p_o )
  319. 79.54 s [Cabal-syntax] [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.p_o )
  320. 79.54 s [Cabal-syntax] [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.p_o )
  321. 79.75 s [Cabal-syntax] [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.p_o )
  322. 80.57 s [Cabal-syntax] [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.p_o )
  323. 81.47 s [Cabal-syntax] [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.p_o )
  324. 81.83 s [Cabal-syntax] [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.p_o )
  325. 81.83 s [Cabal-syntax] [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.p_o )
  326. 82.34 s [Cabal-syntax] [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.p_o )
  327. 82.39 s [Cabal-syntax] [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.p_o )
  328. 82.39 s [Cabal-syntax] [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.p_o )
  329. 82.39 s [Cabal-syntax] [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.p_o )
  330. 82.78 s [Cabal-syntax] [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.p_o )
  331. 83.42 s [Cabal-syntax] [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.p_o )
  332. 83.42 s [Cabal-syntax] [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.p_o )
  333. 83.42 s [Cabal-syntax] [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.p_o )
  334. 83.42 s [Cabal-syntax] [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.p_o )
  335. 83.42 s [Cabal-syntax] [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.p_o )
  336. 83.42 s [Cabal-syntax] [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.p_o )
  337. 83.42 s [Cabal-syntax] [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.p_o )
  338. 83.42 s [Cabal-syntax] [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.p_o )
  339. 83.42 s [Cabal-syntax] [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.p_o )
  340. 83.92 s [Cabal-syntax] [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.p_o )
  341. 85.61 s [Cabal-syntax] [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.p_o )
  342. 87.47 s [Cabal-syntax] [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.p_o )
  343. 87.47 s [Cabal-syntax] [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.p_o )
  344. 87.51 s [Cabal-syntax] [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.p_o )
  345. 87.51 s [Cabal-syntax] [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.p_o )
  346. 90.17 s [Cabal-syntax] [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.p_o )
  347. 90.93 s [Cabal-syntax] [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.p_o )
  348. 90.93 s [Cabal-syntax] [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.p_o )
  349. 91.23 s [Cabal-syntax] [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.p_o )
  350. 91.23 s [Cabal-syntax] [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.p_o )
  351. 91.23 s [Cabal-syntax] [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.p_o )
  352. 91.23 s [Cabal-syntax] [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.p_o )
  353. 93.32 s [Cabal-syntax] [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.p_o )
  354. 93.36 s [Cabal-syntax] [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.p_o )
  355. 94.56 s [Cabal-syntax] [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.p_o )
  356. 94.56 s [Cabal-syntax] [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.p_o )
  357. 94.56 s [Cabal-syntax] [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.p_o )
  358. 94.56 s [Cabal-syntax] [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.p_o )
  359. 94.56 s [Cabal-syntax] [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.p_o )
  360. 94.56 s [Cabal-syntax] [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.p_o )
  361. 94.56 s [Cabal-syntax] [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.p_o )
  362. 94.56 s [Cabal-syntax] [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.p_o )
  363. 94.56 s [Cabal-syntax] [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.p_o )
  364. 94.56 s [Cabal-syntax] [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.p_o )
  365. 94.56 s [Cabal-syntax] [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.p_o )
  366. 94.56 s [Cabal-syntax] [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.p_o )
  367. 94.56 s [Cabal-syntax] [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.p_o )
  368. 94.56 s [Cabal-syntax] [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.p_o )
  369. 94.56 s [Cabal-syntax] [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.p_o )
  370. 94.56 s [Cabal-syntax] [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.p_o )
  371. 94.56 s [Cabal-syntax] [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.p_o )
  372. 98.07 s [Cabal-syntax] [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.p_o )
  373. 98.07 s [Cabal-syntax] [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.p_o )
  374. 99.62 s [Cabal-syntax] [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.p_o )
  375. 100.05 s [Cabal-syntax] [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.p_o )
  376. 100.22 s [Cabal-syntax] [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.p_o )
  377. 100.22 s [Cabal-syntax] [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.p_o )
  378. 100.22 s [Cabal-syntax] [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.p_o )
  379. 100.22 s [Cabal-syntax] [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.p_o )
  380. 100.22 s [Cabal-syntax] [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.p_o )
  381. 100.22 s [Cabal-syntax] [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.p_o )
  382. 100.22 s [Cabal-syntax] [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.p_o )
  383. 100.22 s [Cabal-syntax] [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.p_o )
  384. 100.22 s [Cabal-syntax] [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.p_o )
  385. 100.22 s [Cabal-syntax] [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.p_o )
  386. 100.22 s [Cabal-syntax] [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.p_o )
  387. 100.22 s [Cabal-syntax] [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.p_o )
  388. 100.22 s [Cabal-syntax] [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.p_o )
  389. 100.22 s [Cabal-syntax] [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.p_o )
  390. 100.22 s [Cabal-syntax] [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.p_o )
  391. 100.22 s [Cabal-syntax] [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.p_o )
  392. 100.22 s [Cabal-syntax] [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.p_o )
  393. 100.22 s [Cabal-syntax] [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.p_o )
  394. 100.22 s [Cabal-syntax] [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.p_o )
  395. 100.22 s [Cabal-syntax] [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.p_o )
  396. 100.22 s [Cabal-syntax] [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.p_o )
  397. 100.22 s [Cabal-syntax] [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.p_o )
  398. 100.22 s [Cabal-syntax] [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.p_o )
  399. 100.22 s [Cabal-syntax] [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.p_o )
  400. 100.22 s [Cabal-syntax] [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.p_o )
  401. 100.22 s [Cabal-syntax] [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.p_o )
  402. 100.22 s [Cabal-syntax] [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.p_o )
  403. 100.22 s [Cabal-syntax] [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.p_o )
  404. 102.17 s [Cabal-syntax] [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.p_o )
  405. 104.55 s [Cabal-syntax] [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.p_o )
  406. 105.31 s [Cabal-syntax] [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.p_o )
  407. 105.35 s [Cabal-syntax] [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.p_o )
  408. 105.35 s [Cabal-syntax] [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.p_o )
  409. 105.35 s [Cabal-syntax] [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.p_o )
  410. 105.35 s [Cabal-syntax] [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.p_o )
  411. 105.35 s [Cabal-syntax] [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.p_o )
  412. 105.35 s [Cabal-syntax] [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.p_o )
  413. 105.35 s [Cabal-syntax] [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.p_o )
  414. 105.35 s [Cabal-syntax] [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.p_o )
  415. 105.80 s [Cabal-syntax] [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.p_o )
  416. 109.01 s [Cabal-syntax] [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.p_o )
  417. 109.24 s [Cabal-syntax] [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.p_o )
  418. 109.66 s [Cabal-syntax] [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.p_o )
  419. 109.85 s [Cabal-syntax] [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.p_o )
  420. 109.85 s [Cabal-syntax] [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.p_o )
  421. 109.95 s [Cabal-syntax] [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.p_o )
  422. 109.95 s [Cabal-syntax] [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.p_o )
  423. 109.95 s [Cabal-syntax] [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.p_o )
  424. 109.95 s [Cabal-syntax] [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.p_o )
  425. 111.16 s [Cabal-syntax] [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.p_o )
  426. 111.51 s [Cabal-syntax] [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.p_o )
  427. 113.81 s [Cabal-syntax] [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.p_o )
  428. 115.04 s [Cabal-syntax] [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.p_o )
  429. 115.47 s [Cabal-syntax] [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.p_o )
  430. 115.47 s [Cabal-syntax] [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.p_o )
  431. 115.47 s [Cabal-syntax] [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.p_o )
  432. 115.66 s [Cabal-syntax] [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.p_o )
  433. 115.66 s [Cabal-syntax] [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.p_o )
  434. 117.10 s [Cabal-syntax] [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.p_o )
  435. 117.14 s [Cabal-syntax] [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.p_o )
  436. 117.14 s [Cabal-syntax] [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.p_o )
  437. 117.14 s [Cabal-syntax] [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.p_o )
  438. 117.14 s [Cabal-syntax] [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.p_o )
  439. 117.14 s [Cabal-syntax] [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.p_o )
  440. 124.34 s [Cabal-syntax] [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.p_o )
  441. 125.05 s [Cabal-syntax] [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.p_o )
  442. 129.52 s [Cabal-syntax] [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.p_o )
  443. 129.56 s [Cabal-syntax] [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.p_o )
  444. 129.56 s [Cabal-syntax] [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.p_o )
  445. 133.01 s [Cabal-syntax] buildPhase completed in 2 minutes 3 seconds
  446. 133.01 s [Cabal-syntax] Phase: checkPhase
  447. 133.07 s [Cabal-syntax] Package has no test suites.
  448. 133.09 s [Cabal-syntax] Phase: haddockPhase
  449. 133.35 s [Cabal-syntax] Preprocessing library for Cabal-syntax-3.12.1.0..
  450. 133.40 s [Cabal-syntax] Running Haddock on library for Cabal-syntax-3.12.1.0..
  451. 133.52 s [Cabal-syntax] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  452. 134.69 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.Compat.Binary'
  453. 134.73 s [Cabal-syntax] Missing documentation for:
  454. 134.73 s [Cabal-syntax] Module header
  455. 134.73 s [Cabal-syntax] decodeOrFailIO (src/Distribution/Compat/Binary.hs:19)
  456. 134.73 s [Cabal-syntax] Warning: 'IOException' is out of scope.
  457. 134.73 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  458. 134.73 s [Cabal-syntax] 80% ( 4 / 5) in 'Distribution.Compat.Exception'
  459. 134.73 s [Cabal-syntax] Missing documentation for:
  460. 134.73 s [Cabal-syntax] Module header
  461. 134.74 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.Compat.MonadFail'
  462. 134.77 s [Cabal-syntax] 100% ( 6 / 6) in 'Distribution.Compat.Newtype'
  463. 134.79 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Compat.Typeable'
  464. 134.79 s [Cabal-syntax] Missing documentation for:
  465. 134.79 s [Cabal-syntax] Module header
  466. 134.82 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.PackageDescription.Utils'
  467. 134.82 s [Cabal-syntax] Missing documentation for:
  468. 134.82 s [Cabal-syntax] cabalBug (src/Distribution/PackageDescription/Utils.hs:21)
  469. 134.82 s [Cabal-syntax] userBug (src/Distribution/PackageDescription/Utils.hs:18)
  470. 134.85 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.Utils.Base62'
  471. 134.92 s [Cabal-syntax] 77% ( 7 / 9) in 'Distribution.Utils.MD5'
  472. 134.92 s [Cabal-syntax] Missing documentation for:
  473. 134.92 s [Cabal-syntax] Module header
  474. 134.92 s [Cabal-syntax] MD5 (src/Distribution/Utils/MD5.hs:26)
  475. 134.96 s [Cabal-syntax] Warning: 'decodeUtf8' is out of scope.
  476. 134.96 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  477. 134.96 s [Cabal-syntax] 60% ( 3 / 5) in 'Distribution.Utils.String'
  478. 134.96 s [Cabal-syntax] Missing documentation for:
  479. 134.96 s [Cabal-syntax] Module header
  480. 134.96 s [Cabal-syntax] trim (src/Distribution/Utils/String.hs:109)
  481. 135.45 s [Cabal-syntax] Warning: 'Binary' is out of scope.
  482. 135.45 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  483. 135.47 s [Cabal-syntax] 74% ( 20 / 27) in 'Distribution.Utils.Structured'
  484. 135.47 s [Cabal-syntax] Missing documentation for:
  485. 135.47 s [Cabal-syntax] structuredDecodeOrFailIO (src/Distribution/Utils/Structured.hs:275)
  486. 135.47 s [Cabal-syntax] MD5 (src/Distribution/Utils/MD5.hs:26)
  487. 135.47 s [Cabal-syntax] containerStructure (src/Distribution/Utils/Structured.hs:321)
  488. 135.47 s [Cabal-syntax] Tag (src/Distribution/Utils/Structured.hs:289)
  489. 135.47 s [Cabal-syntax] TypeName (src/Distribution/Utils/Structured.hs:122)
  490. 135.47 s [Cabal-syntax] ConstructorName (src/Distribution/Utils/Structured.hs:123)
  491. 135.47 s [Cabal-syntax] SopStructure (src/Distribution/Utils/Structured.hs:141)
  492. 135.82 s [Cabal-syntax] 100% ( 10 / 10) in 'Distribution.Compat.Semigroup'
  493. 135.91 s [Cabal-syntax] 41% ( 7 / 17) in 'Distribution.Compat.NonEmptySet'
  494. 135.91 s [Cabal-syntax] Missing documentation for:
  495. 135.91 s [Cabal-syntax] Module header
  496. 135.91 s [Cabal-syntax] singleton (src/Distribution/Compat/NonEmptySet.hs:101)
  497. 135.91 s [Cabal-syntax] insert (src/Distribution/Compat/NonEmptySet.hs:108)
  498. 135.91 s [Cabal-syntax] delete (src/Distribution/Compat/NonEmptySet.hs:115)
  499. 135.91 s [Cabal-syntax] toNonEmpty (src/Distribution/Compat/NonEmptySet.hs:129)
  500. 135.91 s [Cabal-syntax] fromNonEmpty (src/Distribution/Compat/NonEmptySet.hs:126)
  501. 135.91 s [Cabal-syntax] toList (src/Distribution/Compat/NonEmptySet.hs:134)
  502. 135.91 s [Cabal-syntax] toSet (src/Distribution/Compat/NonEmptySet.hs:137)
  503. 135.91 s [Cabal-syntax] member (src/Distribution/Compat/NonEmptySet.hs:144)
  504. 135.91 s [Cabal-syntax] map (src/Distribution/Compat/NonEmptySet.hs:152)
  505. 136.03 s [Cabal-syntax] 96% (266 /277) in 'Distribution.Compat.Prelude'
  506. 136.03 s [Cabal-syntax] Missing documentation for:
  507. 136.03 s [Cabal-syntax] Bool
  508. 136.03 s [Cabal-syntax] Ordering
  509. 136.03 s [Cabal-syntax] even
  510. 136.03 s [Cabal-syntax] odd
  511. 136.03 s [Cabal-syntax] foldl1 (src/Distribution/Compat/Prelude.hs:329)
  512. 136.03 s [Cabal-syntax] foldr1 (src/Distribution/Compat/Prelude.hs:325)
  513. 136.03 s [Cabal-syntax] trace (src/Distribution/Compat/Prelude.hs:339)
  514. 136.03 s [Cabal-syntax] traceShow (src/Distribution/Compat/Prelude.hs:347)
  515. 136.03 s [Cabal-syntax] traceShowId (src/Distribution/Compat/Prelude.hs:343)
  516. 136.03 s [Cabal-syntax] traceM (src/Distribution/Compat/Prelude.hs:351)
  517. 136.03 s [Cabal-syntax] traceShowM (src/Distribution/Compat/Prelude.hs:355)
  518. 136.07 s [Cabal-syntax] Warning: 'Strings' is out of scope.
  519. 136.07 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  520. 136.07 s [Cabal-syntax] Warning: 'ByteString' is out of scope.
  521. 136.07 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  522. 136.07 s [Cabal-syntax] Warning: 'PackageName' is out of scope.
  523. 136.07 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  524. 136.07 s [Cabal-syntax] 100% ( 12 / 12) in 'Distribution.Utils.ShortText'
  525. 136.16 s [Cabal-syntax] Warning: 'ByteString' is out of scope.
  526. 136.16 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  527. 136.16 s [Cabal-syntax] Warning: 'snoc' is out of scope.
  528. 136.16 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  529. 136.16 s [Cabal-syntax] Warning: 'cons' is out of scope.
  530. 136.16 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  531. 136.17 s [Cabal-syntax] 96% ( 52 / 54) in 'Distribution.Utils.Generic'
  532. 136.17 s [Cabal-syntax] Missing documentation for:
  533. 136.17 s [Cabal-syntax] equating (src/Distribution/Utils/Generic.hs:413)
  534. 136.17 s [Cabal-syntax] unintersperse (src/Distribution/Utils/Generic.hs:443)
  535. 136.47 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.Types.Condition'
  536. 136.47 s [Cabal-syntax] Missing documentation for:
  537. 136.47 s [Cabal-syntax] Module header
  538. 136.55 s [Cabal-syntax] 62% ( 5 / 8) in 'Distribution.Parsec.Position'
  539. 136.55 s [Cabal-syntax] Missing documentation for:
  540. 136.55 s [Cabal-syntax] Module header
  541. 136.55 s [Cabal-syntax] showPos (src/Distribution/Parsec/Position.hs:34)
  542. 136.55 s [Cabal-syntax] zeroPos (src/Distribution/Parsec/Position.hs:37)
  543. 136.63 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.Parsec.Warning'
  544. 136.63 s [Cabal-syntax] Missing documentation for:
  545. 136.63 s [Cabal-syntax] Module header
  546. 136.63 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  547. 136.71 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Parsec.FieldLineStream'
  548. 136.71 s [Cabal-syntax] Missing documentation for:
  549. 136.71 s [Cabal-syntax] Module header
  550. 136.71 s [Cabal-syntax] fieldLineStreamFromBS (src/Distribution/Parsec/FieldLineStream.hs:38)
  551. 136.71 s [Cabal-syntax] fieldLineStreamEnd (src/Distribution/Parsec/FieldLineStream.hs:29)
  552. 136.74 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Parsec.Error'
  553. 136.75 s [Cabal-syntax] Missing documentation for:
  554. 136.75 s [Cabal-syntax] Module header
  555. 136.75 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  556. 136.79 s [Cabal-syntax] 100% ( 2 / 2) in 'Distribution.PackageDescription.Quirks'
  557. 136.87 s [Cabal-syntax] 22% ( 4 / 18) in 'Distribution.Fields.LexerMonad'
  558. 136.87 s [Cabal-syntax] Missing documentation for:
  559. 136.87 s [Cabal-syntax] InputStream (src/Distribution/Fields/LexerMonad.hs:124)
  560. 136.87 s [Cabal-syntax] LexState (src/Distribution/Fields/LexerMonad.hs:102)
  561. 136.87 s [Cabal-syntax] LexResult (src/Distribution/Fields/LexerMonad.hs:61)
  562. 136.87 s [Cabal-syntax] Lex (src/Distribution/Fields/LexerMonad.hs:48)
  563. 136.87 s [Cabal-syntax] getPos (src/Distribution/Fields/LexerMonad.hs:157)
  564. 136.87 s [Cabal-syntax] setPos (src/Distribution/Fields/LexerMonad.hs:154)
  565. 136.87 s [Cabal-syntax] adjustPos (src/Distribution/Fields/LexerMonad.hs:160)
  566. 136.87 s [Cabal-syntax] getInput (src/Distribution/Fields/LexerMonad.hs:163)
  567. 136.87 s [Cabal-syntax] setInput (src/Distribution/Fields/LexerMonad.hs:166)
  568. 136.87 s [Cabal-syntax] getStartCode (src/Distribution/Fields/LexerMonad.hs:169)
  569. 136.87 s [Cabal-syntax] setStartCode (src/Distribution/Fields/LexerMonad.hs:172)
  570. 136.87 s [Cabal-syntax] LexWarning (src/Distribution/Fields/LexerMonad.hs:76)
  571. 136.87 s [Cabal-syntax] LexWarningType (src/Distribution/Fields/LexerMonad.hs:63)
  572. 136.87 s [Cabal-syntax] toPWarnings (src/Distribution/Fields/LexerMonad.hs:82)
  573. 136.95 s [Cabal-syntax] 20% ( 2 / 10) in 'Distribution.Fields.Lexer'
  574. 136.95 s [Cabal-syntax] Missing documentation for:
  575. 136.95 s [Cabal-syntax] ltest (dist/build/Distribution/Fields/Lexer.hs:550)
  576. 136.96 s [Cabal-syntax] lexToken (src/Distribution/Fields/Lexer.x:208)
  577. 136.96 s [Cabal-syntax] LToken (src/Distribution/Fields/Lexer.x:166)
  578. 136.96 s [Cabal-syntax] bol_section (dist/build/Distribution/Fields/Lexer.hs:157)
  579. 136.96 s [Cabal-syntax] in_section (dist/build/Distribution/Fields/Lexer.hs:157)
  580. 136.96 s [Cabal-syntax] in_field_layout (dist/build/Distribution/Fields/Lexer.hs:157)
  581. 136.96 s [Cabal-syntax] in_field_braces (dist/build/Distribution/Fields/Lexer.hs:157)
  582. 136.96 s [Cabal-syntax] mkLexState (dist/build/Distribution/Fields/Lexer.hs:556)
  583. 137.12 s [Cabal-syntax] 100% ( 23 / 23) in 'Distribution.Compat.Parsing'
  584. 137.25 s [Cabal-syntax] 50% ( 4 / 8) in 'Distribution.Compat.DList'
  585. 137.25 s [Cabal-syntax] Missing documentation for:
  586. 137.25 s [Cabal-syntax] runDList (src/Distribution/Compat/DList.hs:29)
  587. 137.25 s [Cabal-syntax] fromList (src/Distribution/Compat/DList.hs:40)
  588. 137.25 s [Cabal-syntax] toList (src/Distribution/Compat/DList.hs:43)
  589. 137.25 s [Cabal-syntax] snoc (src/Distribution/Compat/DList.hs:46)
  590. 137.29 s [Cabal-syntax] 33% ( 16 / 48) in 'Distribution.Compat.Lens'
  591. 137.29 s [Cabal-syntax] Missing documentation for:
  592. 137.29 s [Cabal-syntax] Lens (src/Distribution/Compat/Lens.hs:82)
  593. 137.29 s [Cabal-syntax] Lens' (src/Distribution/Compat/Lens.hs:85)
  594. 137.29 s [Cabal-syntax] Traversal (src/Distribution/Compat/Lens.hs:83)
  595. 137.29 s [Cabal-syntax] Traversal' (src/Distribution/Compat/Lens.hs:86)
  596. 137.29 s [Cabal-syntax] LensLike (src/Distribution/Compat/Lens.hs:79)
  597. 137.29 s [Cabal-syntax] LensLike' (src/Distribution/Compat/Lens.hs:80)
  598. 137.29 s [Cabal-syntax] Getting (src/Distribution/Compat/Lens.hs:88)
  599. 137.29 s [Cabal-syntax] AGetter (src/Distribution/Compat/Lens.hs:90)
  600. 137.29 s [Cabal-syntax] ASetter (src/Distribution/Compat/Lens.hs:91)
  601. 137.29 s [Cabal-syntax] ALens (src/Distribution/Compat/Lens.hs:92)
  602. 137.29 s [Cabal-syntax] ALens' (src/Distribution/Compat/Lens.hs:94)
  603. 137.29 s [Cabal-syntax] view (src/Distribution/Compat/Lens.hs:100)
  604. 137.30 s [Cabal-syntax] use (src/Distribution/Compat/Lens.hs:104)
  605. 137.30 s [Cabal-syntax] set (src/Distribution/Compat/Lens.hs:120)
  606. 137.30 s [Cabal-syntax] over (src/Distribution/Compat/Lens.hs:123)
  607. 137.30 s [Cabal-syntax] toDListOf (src/Distribution/Compat/Lens.hs:130)
  608. 137.30 s [Cabal-syntax] toListOf (src/Distribution/Compat/Lens.hs:133)
  609. 137.30 s [Cabal-syntax] toSetOf (src/Distribution/Compat/Lens.hs:136)
  610. 137.30 s [Cabal-syntax] cloneLens (src/Distribution/Compat/Lens.hs:233)
  611. 137.30 s [Cabal-syntax] aview (src/Distribution/Compat/Lens.hs:143)
  612. 137.30 s [Cabal-syntax] _1 (src/Distribution/Compat/Lens.hs:156)
  613. 137.30 s [Cabal-syntax] _2 (src/Distribution/Compat/Lens.hs:159)
  614. 137.30 s [Cabal-syntax] ^. (src/Distribution/Compat/Lens.hs:178)
  615. 137.30 s [Cabal-syntax] .~ (src/Distribution/Compat/Lens.hs:182)
  616. 137.30 s [Cabal-syntax] ?~ (src/Distribution/Compat/Lens.hs:186)
  617. 137.30 s [Cabal-syntax] %~ (src/Distribution/Compat/Lens.hs:190)
  618. 137.30 s [Cabal-syntax] .= (src/Distribution/Compat/Lens.hs:194)
  619. 137.30 s [Cabal-syntax] ?= (src/Distribution/Compat/Lens.hs:198)
  620. 137.30 s [Cabal-syntax] %= (src/Distribution/Compat/Lens.hs:202)
  621. 137.30 s [Cabal-syntax] ^# (src/Distribution/Compat/Lens.hs:206)
  622. 137.30 s [Cabal-syntax] #~ (src/Distribution/Compat/Lens.hs:209)
  623. 137.30 s [Cabal-syntax] #%~ (src/Distribution/Compat/Lens.hs:213)
  624. 137.58 s [Cabal-syntax] Warning: 'ConfVar' is out of scope.
  625. 137.58 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  626. 137.58 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  627. 137.58 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  628. 137.58 s [Cabal-syntax] Warning: 'BuildInfo' is out of scope.
  629. 137.58 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  630. 137.58 s [Cabal-syntax] Warning: 'targetBuildInfo' is out of scope.
  631. 137.58 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  632. 137.59 s [Cabal-syntax] 61% ( 11 / 18) in 'Distribution.Types.CondTree'
  633. 137.59 s [Cabal-syntax] Missing documentation for:
  634. 137.59 s [Cabal-syntax] Module header
  635. 137.59 s [Cabal-syntax] condIfThen (src/Distribution/Types/CondTree.hs:98)
  636. 137.59 s [Cabal-syntax] condIfThenElse (src/Distribution/Types/CondTree.hs:101)
  637. 137.59 s [Cabal-syntax] mapCondTree (src/Distribution/Types/CondTree.hs:104)
  638. 137.59 s [Cabal-syntax] mapTreeConstrs (src/Distribution/Types/CondTree.hs:119)
  639. 137.59 s [Cabal-syntax] mapTreeConds (src/Distribution/Types/CondTree.hs:122)
  640. 137.59 s [Cabal-syntax] mapTreeData (src/Distribution/Types/CondTree.hs:125)
  641. 137.72 s [Cabal-syntax] 88% ( 22 / 25) in 'Distribution.Compat.CharParsing'
  642. 137.72 s [Cabal-syntax] Missing documentation for:
  643. 137.72 s [Cabal-syntax] satisfyRange (src/Distribution/Compat/CharParsing.hs:147)
  644. 137.72 s [Cabal-syntax] integral (src/Distribution/Compat/CharParsing.hs:320)
  645. 137.72 s [Cabal-syntax] skipSpaces1 (src/Distribution/Compat/CharParsing.hs:358)
  646. 137.81 s [Cabal-syntax] 41% ( 5 / 12) in 'Distribution.CabalSpecVersion'
  647. 137.81 s [Cabal-syntax] Missing documentation for:
  648. 137.81 s [Cabal-syntax] Module header
  649. 137.81 s [Cabal-syntax] cabalSpecLatest (src/Distribution/CabalSpecVersion.hs:67)
  650. 137.81 s [Cabal-syntax] specHasCommonStanzas (src/Distribution/CabalSpecVersion.hs:137)
  651. 137.81 s [Cabal-syntax] specHasElif (src/Distribution/CabalSpecVersion.hs:143)
  652. 137.81 s [Cabal-syntax] HasElif (src/Distribution/CabalSpecVersion.hs:154)
  653. 137.81 s [Cabal-syntax] HasCommonStanzas (src/Distribution/CabalSpecVersion.hs:157)
  654. 137.81 s [Cabal-syntax] HasGlobstar (src/Distribution/CabalSpecVersion.hs:160)
  655. 137.85 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.SPDX.LicenseListVersion'
  656. 137.85 s [Cabal-syntax] Missing documentation for:
  657. 137.85 s [Cabal-syntax] Module header
  658. 137.85 s [Cabal-syntax] cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:19)
  659. 137.86 s [Cabal-syntax] 46% ( 6 / 13) in 'Distribution.Pretty'
  660. 137.86 s [Cabal-syntax] Missing documentation for:
  661. 137.86 s [Cabal-syntax] Module header
  662. 137.86 s [Cabal-syntax] Pretty (src/Distribution/Pretty.hs:24)
  663. 137.86 s [Cabal-syntax] prettyShow (src/Distribution/Pretty.hs:43)
  664. 137.86 s [Cabal-syntax] showFilePath (src/Distribution/Pretty.hs:81)
  665. 137.86 s [Cabal-syntax] showToken (src/Distribution/Pretty.hs:84)
  666. 137.86 s [Cabal-syntax] showTokenStr (src/Distribution/Pretty.hs:87)
  667. 137.86 s [Cabal-syntax] Separator (src/Distribution/Pretty.hs:79)
  668. 137.93 s [Cabal-syntax] 75% ( 15 / 20) in 'Distribution.Fields.Field'
  669. 137.93 s [Cabal-syntax] Missing documentation for:
  670. 137.93 s [Cabal-syntax] fieldAnn (src/Distribution/Fields/Field.hs:63)
  671. 137.93 s [Cabal-syntax] FieldName (src/Distribution/Fields/Field.hs:114)
  672. 137.93 s [Cabal-syntax] mkName (src/Distribution/Fields/Field.hs:125)
  673. 137.93 s [Cabal-syntax] getName (src/Distribution/Fields/Field.hs:128)
  674. 137.93 s [Cabal-syntax] nameAnn (src/Distribution/Fields/Field.hs:131)
  675. 138.06 s [Cabal-syntax] Warning: ':' is out of scope.
  676. 138.06 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  677. 138.06 s [Cabal-syntax] 100% ( 10 / 10) in 'Distribution.Fields.Parser'
  678. 138.13 s [Cabal-syntax] Warning: 'Field' is out of scope.
  679. 138.13 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  680. 138.13 s [Cabal-syntax] Warning: 'Section' is out of scope.
  681. 138.13 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  682. 138.13 s [Cabal-syntax] Warning: 'genericFromParsecField' is out of scope.
  683. 138.13 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  684. 138.13 s [Cabal-syntax] 81% ( 9 / 11) in 'Distribution.Fields.Pretty'
  685. 138.13 s [Cabal-syntax] Missing documentation for:
  686. 138.13 s [Cabal-syntax] PrettyField (src/Distribution/Fields/Pretty.hs:44)
  687. 138.13 s [Cabal-syntax] genericFromParsecFields (src/Distribution/Fields/Pretty.hs:176)
  688. 138.23 s [Cabal-syntax] Warning: 'sepBy' is out of scope.
  689. 138.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  690. 138.23 s [Cabal-syntax] 73% ( 31 / 42) in 'Distribution.Parsec'
  691. 138.23 s [Cabal-syntax] Missing documentation for:
  692. 138.23 s [Cabal-syntax] Module header
  693. 138.23 s [Cabal-syntax] ParsecParser (src/Distribution/Parsec.hs:101)
  694. 138.23 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  695. 138.23 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  696. 138.23 s [Cabal-syntax] showPos (src/Distribution/Parsec/Position.hs:34)
  697. 138.23 s [Cabal-syntax] zeroPos (src/Distribution/Parsec/Position.hs:37)
  698. 138.23 s [Cabal-syntax] parsecFilePath (src/Distribution/Parsec.hs:283)
  699. 138.23 s [Cabal-syntax] parsecCommaList (src/Distribution/Parsec.hs:301)
  700. 138.23 s [Cabal-syntax] parsecCommaNonEmpty (src/Distribution/Parsec.hs:304)
  701. 138.23 s [Cabal-syntax] parsecOptCommaList (src/Distribution/Parsec.hs:337)
  702. 138.23 s [Cabal-syntax] parsecUnqualComponentName (src/Distribution/Parsec.hs:380)
  703. 138.52 s [Cabal-syntax] 54% ( 6 / 11) in 'Distribution.Utils.Path'
  704. 138.52 s [Cabal-syntax] Missing documentation for:
  705. 138.52 s [Cabal-syntax] Module header
  706. 138.52 s [Cabal-syntax] sameDirectory (src/Distribution/Utils/Path.hs:54)
  707. 138.52 s [Cabal-syntax] PackageDir (src/Distribution/Utils/Path.hs:104)
  708. 138.52 s [Cabal-syntax] SourceDir (src/Distribution/Utils/Path.hs:105)
  709. 138.53 s [Cabal-syntax] LicenseFile (src/Distribution/Utils/Path.hs:107)
  710. 138.60 s [Cabal-syntax] 83% ( 10 / 12) in 'Distribution.Types.Version'
  711. 138.60 s [Cabal-syntax] Missing documentation for:
  712. 138.60 s [Cabal-syntax] Module header
  713. 138.60 s [Cabal-syntax] validVersion (src/Distribution/Types/Version.hs:260)
  714. 138.74 s [Cabal-syntax] Warning: 'PkgConfigVersionRange' is out of scope.
  715. 138.74 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  716. 138.75 s [Cabal-syntax] 95% ( 22 / 23) in 'Distribution.Types.VersionRange.Internal'
  717. 138.75 s [Cabal-syntax] Missing documentation for:
  718. 138.75 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  719. 138.91 s [Cabal-syntax] Warning: 'foldVersionRange' is out of scope.
  720. 138.91 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  721. 138.92 s [Cabal-syntax] 84% ( 16 / 19) in 'Distribution.Types.VersionInterval.Legacy'
  722. 138.92 s [Cabal-syntax] Missing documentation for:
  723. 138.92 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval/Legacy.hs:115)
  724. 138.92 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval/Legacy.hs:120)
  725. 138.92 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval/Legacy.hs:127)
  726. 139.02 s [Cabal-syntax] Warning: 'foldVersionRange' is out of scope.
  727. 139.02 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  728. 139.03 s [Cabal-syntax] 71% ( 15 / 21) in 'Distribution.Types.VersionInterval'
  729. 139.03 s [Cabal-syntax] Missing documentation for:
  730. 139.03 s [Cabal-syntax] relaxLastInterval (src/Distribution/Types/VersionInterval.hs:333)
  731. 139.03 s [Cabal-syntax] relaxHeadInterval (src/Distribution/Types/VersionInterval.hs:340)
  732. 139.03 s [Cabal-syntax] VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
  733. 139.03 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval.hs:81)
  734. 139.03 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval.hs:82)
  735. 139.03 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval.hs:83)
  736. 139.08 s [Cabal-syntax] Warning: 'VersionRangeParens' is out of scope.
  737. 139.08 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  738. 139.08 s [Cabal-syntax] Warning: 'AnyVersion' is out of scope.
  739. 139.08 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  740. 139.08 s [Cabal-syntax] 89% ( 33 / 37) in 'Distribution.Types.VersionRange'
  741. 139.08 s [Cabal-syntax] Missing documentation for:
  742. 139.08 s [Cabal-syntax] Module header
  743. 139.08 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  744. 139.08 s [Cabal-syntax] isAnyVersionLight (src/Distribution/Types/VersionRange.hs:157)
  745. 139.08 s [Cabal-syntax] isWildcardRange (src/Distribution/Types/VersionRange.hs:165)
  746. 139.19 s [Cabal-syntax] Warning: 'ReopKind' is out of scope.
  747. 139.19 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  748. 139.20 s [Cabal-syntax] 33% ( 3 / 9) in 'Distribution.Types.SourceRepo'
  749. 139.20 s [Cabal-syntax] Missing documentation for:
  750. 139.20 s [Cabal-syntax] Module header
  751. 139.20 s [Cabal-syntax] RepoType (src/Distribution/Types/SourceRepo.hs:146)
  752. 139.20 s [Cabal-syntax] knownRepoTypes (src/Distribution/Types/SourceRepo.hs:155)
  753. 139.20 s [Cabal-syntax] emptySourceRepo (src/Distribution/Types/SourceRepo.hs:82)
  754. 139.20 s [Cabal-syntax] classifyRepoType (src/Distribution/Types/SourceRepo.hs:185)
  755. 139.20 s [Cabal-syntax] classifyRepoKind (src/Distribution/Types/SourceRepo.hs:172)
  756. 139.31 s [Cabal-syntax] 11% ( 1 / 9) in 'Distribution.Types.SourceRepo.Lens'
  757. 139.31 s [Cabal-syntax] Missing documentation for:
  758. 139.31 s [Cabal-syntax] Module header
  759. 139.31 s [Cabal-syntax] repoKind (src/Distribution/Types/SourceRepo/Lens.hs:13)
  760. 139.32 s [Cabal-syntax] repoType (src/Distribution/Types/SourceRepo/Lens.hs:17)
  761. 139.32 s [Cabal-syntax] repoLocation (src/Distribution/Types/SourceRepo/Lens.hs:21)
  762. 139.32 s [Cabal-syntax] repoModule (src/Distribution/Types/SourceRepo/Lens.hs:25)
  763. 139.32 s [Cabal-syntax] repoBranch (src/Distribution/Types/SourceRepo/Lens.hs:29)
  764. 139.32 s [Cabal-syntax] repoTag (src/Distribution/Types/SourceRepo/Lens.hs:33)
  765. 139.32 s [Cabal-syntax] repoSubdir (src/Distribution/Types/SourceRepo/Lens.hs:37)
  766. 139.35 s [Cabal-syntax] 66% ( 2 / 3) in 'Distribution.Types.PkgconfigVersion'
  767. 139.35 s [Cabal-syntax] Missing documentation for:
  768. 139.35 s [Cabal-syntax] Module header
  769. 139.59 s [Cabal-syntax] 37% ( 3 / 8) in 'Distribution.Types.PkgconfigVersionRange'
  770. 139.59 s [Cabal-syntax] Missing documentation for:
  771. 139.59 s [Cabal-syntax] Module header
  772. 139.59 s [Cabal-syntax] anyPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:124)
  773. 139.59 s [Cabal-syntax] withinPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:131)
  774. 139.59 s [Cabal-syntax] versionToPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:147)
  775. 139.59 s [Cabal-syntax] versionRangeToPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:150)
  776. 139.64 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.PkgconfigName'
  777. 139.64 s [Cabal-syntax] Missing documentation for:
  778. 139.64 s [Cabal-syntax] Module header
  779. 139.67 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.PkgconfigDependency'
  780. 139.67 s [Cabal-syntax] Missing documentation for:
  781. 139.67 s [Cabal-syntax] Module header
  782. 139.70 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.Types.PackageName'
  783. 139.70 s [Cabal-syntax] Missing documentation for:
  784. 139.70 s [Cabal-syntax] Module header
  785. 139.81 s [Cabal-syntax] Warning: 'ComponentName' is out of scope.
  786. 139.81 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  787. 139.81 s [Cabal-syntax] Warning: 'ComponentId' is out of scope.
  788. 139.81 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  789. 139.81 s [Cabal-syntax] 87% ( 7 / 8) in 'Distribution.Types.UnqualComponentName'
  790. 139.81 s [Cabal-syntax] Missing documentation for:
  791. 139.81 s [Cabal-syntax] Module header
  792. 139.81 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.LibraryVisibility'
  793. 139.81 s [Cabal-syntax] Missing documentation for:
  794. 139.81 s [Cabal-syntax] Module header
  795. 139.82 s [Cabal-syntax] 30% ( 3 / 10) in 'Distribution.Types.LibraryName'
  796. 139.82 s [Cabal-syntax] Missing documentation for:
  797. 139.82 s [Cabal-syntax] Module header
  798. 139.82 s [Cabal-syntax] LibraryName (src/Distribution/Types/LibraryName.hs:27)
  799. 139.82 s [Cabal-syntax] defaultLibName (src/Distribution/Types/LibraryName.hs:55)
  800. 139.82 s [Cabal-syntax] showLibraryName (src/Distribution/Types/LibraryName.hs:58)
  801. 139.82 s [Cabal-syntax] libraryNameStanza (src/Distribution/Types/LibraryName.hs:62)
  802. 139.82 s [Cabal-syntax] libraryNameString (src/Distribution/Types/LibraryName.hs:66)
  803. 139.82 s [Cabal-syntax] parsecLibraryNameComponent (src/Distribution/Types/LibraryName.hs:45)
  804. 139.87 s [Cabal-syntax] Warning: 'MungedPackageId' is out of scope.
  805. 139.87 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  806. 139.87 s [Cabal-syntax] Warning: 'UnitId' is out of scope.
  807. 139.87 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  808. 139.87 s [Cabal-syntax] Warning: 'mkMungedPackageName' is out of scope.
  809. 139.87 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  810. 139.87 s [Cabal-syntax] Warning: 'unMungedPackageName' is out of scope.
  811. 139.87 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  812. 139.87 s [Cabal-syntax] Warning: 'foo' is out of scope.
  813. 139.87 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  814. 139.87 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.MungedPackageName'
  815. 139.87 s [Cabal-syntax] Missing documentation for:
  816. 139.87 s [Cabal-syntax] Module header
  817. 139.92 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.ForeignLibType'
  818. 139.92 s [Cabal-syntax] Missing documentation for:
  819. 139.92 s [Cabal-syntax] Module header
  820. 139.92 s [Cabal-syntax] knownForeignLibTypes (src/Distribution/Types/ForeignLibType.hs:58)
  821. 139.92 s [Cabal-syntax] foreignLibTypeIsShared (src/Distribution/Types/ForeignLibType.hs:64)
  822. 139.95 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ForeignLibOption'
  823. 139.95 s [Cabal-syntax] Missing documentation for:
  824. 139.95 s [Cabal-syntax] Module header
  825. 139.95 s [Cabal-syntax] ForeignLibOption (src/Distribution/Types/ForeignLibOption.hs:18)
  826. 140.03 s [Cabal-syntax] Warning: 'null' is ambiguous. It is defined
  827. 140.03 s [Cabal-syntax] * in ‘Data.Foldable’
  828. 140.03 s [Cabal-syntax] * at src/Distribution/Utils/ShortText.hs:115:1
  829. 140.03 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  830. 140.03 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  831. 140.03 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Utils/ShortText.hs:115:1
  832. 140.04 s [Cabal-syntax] 96% ( 25 / 26) in 'Distribution.Types.Flag'
  833. 140.04 s [Cabal-syntax] Missing documentation for:
  834. 140.04 s [Cabal-syntax] Module header
  835. 140.12 s [Cabal-syntax] Warning: 'Any' is out of scope.
  836. 140.12 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  837. 140.12 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ExecutableScope'
  838. 140.12 s [Cabal-syntax] Missing documentation for:
  839. 140.12 s [Cabal-syntax] Module header
  840. 140.12 s [Cabal-syntax] ExecutableScope (src/Distribution/Types/ExecutableScope.hs:18)
  841. 140.17 s [Cabal-syntax] 16% ( 1 / 6) in 'Distribution.Types.ComponentName'
  842. 140.17 s [Cabal-syntax] Missing documentation for:
  843. 140.17 s [Cabal-syntax] Module header
  844. 140.17 s [Cabal-syntax] ComponentName (src/Distribution/Types/ComponentName.hs:25)
  845. 140.17 s [Cabal-syntax] showComponentName (src/Distribution/Types/ComponentName.hs:79)
  846. 140.17 s [Cabal-syntax] componentNameRaw (src/Distribution/Types/ComponentName.hs:86)
  847. 140.17 s [Cabal-syntax] componentNameStanza (src/Distribution/Types/ComponentName.hs:90)
  848. 140.21 s [Cabal-syntax] Warning: 'UnitId' is out of scope.
  849. 140.21 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  850. 140.21 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.ComponentId'
  851. 140.21 s [Cabal-syntax] Missing documentation for:
  852. 140.21 s [Cabal-syntax] Module header
  853. 140.23 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.BuildType'
  854. 140.23 s [Cabal-syntax] Missing documentation for:
  855. 140.23 s [Cabal-syntax] Module header
  856. 140.23 s [Cabal-syntax] knownBuildTypes (src/Distribution/Types/BuildType.hs:38)
  857. 140.25 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.AbiHash'
  858. 140.25 s [Cabal-syntax] Missing documentation for:
  859. 140.25 s [Cabal-syntax] Module header
  860. 140.26 s [Cabal-syntax] 0% ( 0 / 3) in 'Distribution.Text'
  861. 140.26 s [Cabal-syntax] Missing documentation for:
  862. 140.26 s [Cabal-syntax] Module header
  863. 140.26 s [Cabal-syntax] display (src/Distribution/Text.hs:9)
  864. 140.26 s [Cabal-syntax] simpleParse (src/Distribution/Text.hs:12)
  865. 140.38 s [Cabal-syntax] 55% ( 10 / 18) in 'Distribution.System'
  866. 140.38 s [Cabal-syntax] Missing documentation for:
  867. 140.38 s [Cabal-syntax] buildOS (src/Distribution/System.hs:175)
  868. 140.38 s [Cabal-syntax] buildArch (src/Distribution/System.hs:281)
  869. 140.38 s [Cabal-syntax] Platform (src/Distribution/System.hs:290)
  870. 140.38 s [Cabal-syntax] platformFromTriple (src/Distribution/System.hs:335)
  871. 140.38 s [Cabal-syntax] knownOSs (src/Distribution/System.hs:123)
  872. 140.38 s [Cabal-syntax] knownArches (src/Distribution/System.hs:226)
  873. 140.38 s [Cabal-syntax] classifyOS (src/Distribution/System.hs:165)
  874. 140.38 s [Cabal-syntax] classifyArch (src/Distribution/System.hs:271)
  875. 140.63 s [Cabal-syntax] 83% ( 5 / 6) in 'Distribution.SPDX.LicenseReference'
  876. 140.63 s [Cabal-syntax] Missing documentation for:
  877. 140.63 s [Cabal-syntax] Module header
  878. 140.88 s [Cabal-syntax] Warning: 'License' is out of scope.
  879. 140.88 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  880. 140.88 s [Cabal-syntax] Warning: 'BSD2' is out of scope.
  881. 140.88 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  882. 140.88 s [Cabal-syntax] Warning: 'BSD3' is out of scope.
  883. 140.88 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  884. 140.88 s [Cabal-syntax] Warning: 'OtherLicense' is out of scope.
  885. 140.88 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  886. 140.88 s [Cabal-syntax] Warning: 'AllRightsReserved' is out of scope.
  887. 140.89 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  888. 140.89 s [Cabal-syntax] Warning: 'PublicDomain' is out of scope.
  889. 140.89 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  890. 140.89 s [Cabal-syntax] 80% ( 8 / 10) in 'Distribution.SPDX.LicenseId'
  891. 140.89 s [Cabal-syntax] Missing documentation for:
  892. 140.89 s [Cabal-syntax] Module header
  893. 140.89 s [Cabal-syntax] licenseIdList (src/Distribution/SPDX/LicenseId.hs:2215)
  894. 141.60 s [Cabal-syntax] 66% ( 4 / 6) in 'Distribution.SPDX.LicenseExceptionId'
  895. 141.60 s [Cabal-syntax] Missing documentation for:
  896. 141.60 s [Cabal-syntax] Module header
  897. 141.60 s [Cabal-syntax] licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:277)
  898. 141.68 s [Cabal-syntax] 50% ( 2 / 4) in 'Distribution.SPDX.LicenseExpression'
  899. 141.68 s [Cabal-syntax] Missing documentation for:
  900. 141.68 s [Cabal-syntax] Module header
  901. 141.68 s [Cabal-syntax] simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:58)
  902. 141.72 s [Cabal-syntax] Warning: 'LicenseRef' is out of scope.
  903. 141.72 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  904. 141.72 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.SPDX.License'
  905. 141.72 s [Cabal-syntax] Missing documentation for:
  906. 141.72 s [Cabal-syntax] Module header
  907. 141.73 s [Cabal-syntax] 86% ( 25 / 29) in 'Distribution.SPDX'
  908. 141.73 s [Cabal-syntax] Missing documentation for:
  909. 141.73 s [Cabal-syntax] simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:58)
  910. 141.73 s [Cabal-syntax] licenseIdList (src/Distribution/SPDX/LicenseId.hs:2215)
  911. 141.73 s [Cabal-syntax] licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:277)
  912. 141.73 s [Cabal-syntax] cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:19)
  913. 141.75 s [Cabal-syntax] 77% ( 7 / 9) in 'Distribution.ModuleName'
  914. 141.75 s [Cabal-syntax] Missing documentation for:
  915. 141.75 s [Cabal-syntax] fromString
  916. 141.75 s [Cabal-syntax] validModuleComponent (src/Distribution/ModuleName.hs:90)
  917. 141.78 s [Cabal-syntax] 80% ( 4 / 5) in 'Distribution.Types.ModuleRenaming'
  918. 141.78 s [Cabal-syntax] Missing documentation for:
  919. 141.78 s [Cabal-syntax] Module header
  920. 141.81 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.IncludeRenaming'
  921. 141.81 s [Cabal-syntax] Missing documentation for:
  922. 141.81 s [Cabal-syntax] Module header
  923. 141.83 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  924. 141.83 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  925. 141.83 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.Mixin'
  926. 141.83 s [Cabal-syntax] Missing documentation for:
  927. 141.83 s [Cabal-syntax] Module header
  928. 141.85 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ModuleReexport'
  929. 141.85 s [Cabal-syntax] Missing documentation for:
  930. 141.85 s [Cabal-syntax] Module header
  931. 141.85 s [Cabal-syntax] ModuleReexport (src/Distribution/Types/ModuleReexport.hs:22)
  932. 141.90 s [Cabal-syntax] Warning: 'fromList' is out of scope.
  933. 141.90 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  934. 141.90 s [Cabal-syntax] 100% ( 42 / 42) in 'Distribution.Compat.Graph'
  935. 141.95 s [Cabal-syntax] 92% ( 58 / 63) in 'Distribution.Version'
  936. 141.95 s [Cabal-syntax] Missing documentation for:
  937. 141.95 s [Cabal-syntax] VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
  938. 141.95 s [Cabal-syntax] VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
  939. 141.95 s [Cabal-syntax] LowerBound (src/Distribution/Types/VersionInterval.hs:81)
  940. 141.95 s [Cabal-syntax] UpperBound (src/Distribution/Types/VersionInterval.hs:82)
  941. 141.95 s [Cabal-syntax] Bound (src/Distribution/Types/VersionInterval.hs:83)
  942. 141.96 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.TestType'
  943. 141.97 s [Cabal-syntax] Missing documentation for:
  944. 141.97 s [Cabal-syntax] Module header
  945. 141.97 s [Cabal-syntax] knownTestTypes (src/Distribution/Types/TestType.hs:35)
  946. 141.97 s [Cabal-syntax] testTypeExe (src/Distribution/Types/TestType.hs:41)
  947. 141.97 s [Cabal-syntax] testTypeLib (src/Distribution/Types/TestType.hs:44)
  948. 142.15 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.TestSuiteInterface'
  949. 142.15 s [Cabal-syntax] Missing documentation for:
  950. 142.15 s [Cabal-syntax] Module header
  951. 142.17 s [Cabal-syntax] Warning: 'Text' is out of scope.
  952. 142.17 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  953. 142.17 s [Cabal-syntax] 66% ( 2 / 3) in 'Distribution.Types.PackageId'
  954. 142.17 s [Cabal-syntax] Missing documentation for:
  955. 142.17 s [Cabal-syntax] Module header
  956. 142.20 s [Cabal-syntax] Warning: 'unitIdHash' is out of scope.
  957. 142.20 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  958. 142.20 s [Cabal-syntax] Warning: 'OpenUnitId' is out of scope.
  959. 142.20 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  960. 142.20 s [Cabal-syntax] Warning: 'display' is out of scope.
  961. 142.21 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  962. 142.21 s [Cabal-syntax] 70% ( 7 / 10) in 'Distribution.Types.UnitId'
  963. 142.21 s [Cabal-syntax] Missing documentation for:
  964. 142.21 s [Cabal-syntax] Module header
  965. 142.21 s [Cabal-syntax] mkUnitId (src/Distribution/Types/UnitId.hs:94)
  966. 142.21 s [Cabal-syntax] unDefUnitId (src/Distribution/Types/UnitId.hs:120)
  967. 142.23 s [Cabal-syntax] Warning: 'InstalledPackageInfo' is out of scope.
  968. 142.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  969. 142.23 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.Module'
  970. 142.23 s [Cabal-syntax] Missing documentation for:
  971. 142.23 s [Cabal-syntax] Module header
  972. 142.26 s [Cabal-syntax] Warning: 'ModuleSubst' is out of scope.
  973. 142.26 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  974. 142.26 s [Cabal-syntax] Warning: 'ModuleVar' is out of scope.
  975. 142.26 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  976. 142.26 s [Cabal-syntax] Warning: 'dispModSubst' is out of scope.
  977. 142.26 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  978. 142.26 s [Cabal-syntax] Warning: 'dispModSubstEntry' is out of scope.
  979. 142.26 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  980. 142.26 s [Cabal-syntax] 95% ( 21 / 22) in 'Distribution.Backpack'
  981. 142.26 s [Cabal-syntax] Missing documentation for:
  982. 142.26 s [Cabal-syntax] unDefUnitId (src/Distribution/Types/UnitId.hs:120)
  983. 142.31 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.ExposedModule'
  984. 142.31 s [Cabal-syntax] Missing documentation for:
  985. 142.31 s [Cabal-syntax] Module header
  986. 142.31 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  987. 142.34 s [Cabal-syntax] Warning: 'ExeDependency' is out of scope.
  988. 142.34 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  989. 142.34 s [Cabal-syntax] Warning: 'Dependency' is out of scope.
  990. 142.34 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  991. 142.34 s [Cabal-syntax] 75% ( 3 / 4) in 'Distribution.Types.PackageVersionConstraint'
  992. 142.34 s [Cabal-syntax] Missing documentation for:
  993. 142.34 s [Cabal-syntax] Module header
  994. 142.37 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.PackageId.Lens'
  995. 142.37 s [Cabal-syntax] Missing documentation for:
  996. 142.37 s [Cabal-syntax] Module header
  997. 142.37 s [Cabal-syntax] pkgName (src/Distribution/Types/PackageId/Lens.hs:16)
  998. 142.37 s [Cabal-syntax] pkgVersion (src/Distribution/Types/PackageId/Lens.hs:20)
  999. 142.38 s [Cabal-syntax] Warning: 'PackageName' is out of scope.
  1000. 142.38 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1001. 142.39 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.MungedPackageId'
  1002. 142.39 s [Cabal-syntax] Missing documentation for:
  1003. 142.39 s [Cabal-syntax] Module header
  1004. 142.39 s [Cabal-syntax] computeCompatPackageId (src/Distribution/Types/MungedPackageId.hs:75)
  1005. 142.43 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.LegacyExeDependency'
  1006. 142.43 s [Cabal-syntax] Missing documentation for:
  1007. 142.43 s [Cabal-syntax] Module header
  1008. 142.46 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.ExeDependency'
  1009. 142.46 s [Cabal-syntax] Missing documentation for:
  1010. 142.46 s [Cabal-syntax] Module header
  1011. 142.46 s [Cabal-syntax] qualifiedExeName (src/Distribution/Types/ExeDependency.hs:71)
  1012. 142.50 s [Cabal-syntax] Warning: 'DependencyMap' is out of scope.
  1013. 142.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1014. 142.51 s [Cabal-syntax] 50% ( 4 / 8) in 'Distribution.Types.Dependency'
  1015. 142.51 s [Cabal-syntax] Missing documentation for:
  1016. 142.51 s [Cabal-syntax] Module header
  1017. 142.51 s [Cabal-syntax] depPkgName (src/Distribution/Types/Dependency.hs:50)
  1018. 142.51 s [Cabal-syntax] depVerRange (src/Distribution/Types/Dependency.hs:53)
  1019. 142.51 s [Cabal-syntax] depLibraries (src/Distribution/Types/Dependency.hs:56)
  1020. 142.53 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.SetupBuildInfo'
  1021. 142.53 s [Cabal-syntax] Missing documentation for:
  1022. 142.53 s [Cabal-syntax] Module header
  1023. 142.53 s [Cabal-syntax] SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
  1024. 142.54 s [Cabal-syntax] 0% ( 0 / 4) in 'Distribution.Types.SetupBuildInfo.Lens'
  1025. 142.54 s [Cabal-syntax] Missing documentation for:
  1026. 142.54 s [Cabal-syntax] Module header
  1027. 142.54 s [Cabal-syntax] SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
  1028. 142.54 s [Cabal-syntax] setupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:15)
  1029. 142.54 s [Cabal-syntax] defaultSetupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:19)
  1030. 142.55 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.DependencyMap'
  1031. 142.55 s [Cabal-syntax] Missing documentation for:
  1032. 142.55 s [Cabal-syntax] Module header
  1033. 142.55 s [Cabal-syntax] toDepMap (src/Distribution/Types/DependencyMap.hs:39)
  1034. 142.55 s [Cabal-syntax] fromDepMap (src/Distribution/Types/DependencyMap.hs:43)
  1035. 142.55 s [Cabal-syntax] constrainBy (src/Distribution/Types/DependencyMap.hs:50)
  1036. 142.56 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.BenchmarkType'
  1037. 142.56 s [Cabal-syntax] Missing documentation for:
  1038. 142.56 s [Cabal-syntax] Module header
  1039. 142.56 s [Cabal-syntax] knownBenchmarkTypes (src/Distribution/Types/BenchmarkType.hs:31)
  1040. 142.56 s [Cabal-syntax] benchmarkTypeExe (src/Distribution/Types/BenchmarkType.hs:34)
  1041. 142.58 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.BenchmarkInterface'
  1042. 142.58 s [Cabal-syntax] Missing documentation for:
  1043. 142.58 s [Cabal-syntax] Module header
  1044. 142.59 s [Cabal-syntax] Warning: 'InstalledPackageInfo' is out of scope.
  1045. 142.59 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1046. 142.59 s [Cabal-syntax] 70% ( 12 / 17) in 'Distribution.Package'
  1047. 142.59 s [Cabal-syntax] Missing documentation for:
  1048. 142.59 s [Cabal-syntax] packageName (src/Distribution/Package.hs:80)
  1049. 142.59 s [Cabal-syntax] packageVersion (src/Distribution/Package.hs:83)
  1050. 142.59 s [Cabal-syntax] HasMungedPackageId (src/Distribution/Package.hs:74)
  1051. 142.59 s [Cabal-syntax] mungedName' (src/Distribution/Package.hs:68)
  1052. 142.59 s [Cabal-syntax] mungedVersion' (src/Distribution/Package.hs:71)
  1053. 142.60 s [Cabal-syntax] Warning: 'abiHash' is out of scope.
  1054. 142.60 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1055. 142.60 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.AbiDependency'
  1056. 142.60 s [Cabal-syntax] Missing documentation for:
  1057. 142.60 s [Cabal-syntax] Module header
  1058. 142.64 s [Cabal-syntax] 100% ( 5 / 5) in 'Distribution.License'
  1059. 142.73 s [Cabal-syntax] 28% ( 2 / 7) in 'Distribution.Types.InstalledPackageInfo'
  1060. 142.73 s [Cabal-syntax] Missing documentation for:
  1061. 142.73 s [Cabal-syntax] Module header
  1062. 142.73 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  1063. 142.73 s [Cabal-syntax] emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:131)
  1064. 142.73 s [Cabal-syntax] mungedPackageId (src/Distribution/Types/InstalledPackageInfo.hs:122)
  1065. 142.73 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  1066. 142.84 s [Cabal-syntax] 0% ( 0 / 46) in 'Distribution.Types.InstalledPackageInfo.Lens'
  1067. 142.84 s [Cabal-syntax] Missing documentation for:
  1068. 142.84 s [Cabal-syntax] Module header
  1069. 142.84 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  1070. 142.84 s [Cabal-syntax] installedUnitId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:26)
  1071. 142.84 s [Cabal-syntax] sourcePackageId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:22)
  1072. 142.84 s [Cabal-syntax] license (src/Distribution/Types/InstalledPackageInfo/Lens.hs:46)
  1073. 142.84 s [Cabal-syntax] abiHash (src/Distribution/Types/InstalledPackageInfo/Lens.hs:86)
  1074. 142.84 s [Cabal-syntax] sourceLibName (src/Distribution/Types/InstalledPackageInfo/Lens.hs:38)
  1075. 142.84 s [Cabal-syntax] installedComponentId_ (src/Distribution/Types/InstalledPackageInfo/Lens.hs:30)
  1076. 142.84 s [Cabal-syntax] libVisibility (src/Distribution/Types/InstalledPackageInfo/Lens.hs:194)
  1077. 142.84 s [Cabal-syntax] instantiatedWith (src/Distribution/Types/InstalledPackageInfo/Lens.hs:34)
  1078. 142.84 s [Cabal-syntax] compatPackageKey (src/Distribution/Types/InstalledPackageInfo/Lens.hs:42)
  1079. 142.84 s [Cabal-syntax] copyright (src/Distribution/Types/InstalledPackageInfo/Lens.hs:50)
  1080. 142.84 s [Cabal-syntax] maintainer (src/Distribution/Types/InstalledPackageInfo/Lens.hs:54)
  1081. 142.84 s [Cabal-syntax] author (src/Distribution/Types/InstalledPackageInfo/Lens.hs:58)
  1082. 142.84 s [Cabal-syntax] stability (src/Distribution/Types/InstalledPackageInfo/Lens.hs:62)
  1083. 142.84 s [Cabal-syntax] homepage (src/Distribution/Types/InstalledPackageInfo/Lens.hs:66)
  1084. 142.84 s [Cabal-syntax] pkgUrl (src/Distribution/Types/InstalledPackageInfo/Lens.hs:70)
  1085. 142.84 s [Cabal-syntax] synopsis (src/Distribution/Types/InstalledPackageInfo/Lens.hs:74)
  1086. 142.84 s [Cabal-syntax] description (src/Distribution/Types/InstalledPackageInfo/Lens.hs:78)
  1087. 142.84 s [Cabal-syntax] category (src/Distribution/Types/InstalledPackageInfo/Lens.hs:82)
  1088. 142.84 s [Cabal-syntax] indefinite (src/Distribution/Types/InstalledPackageInfo/Lens.hs:90)
  1089. 142.84 s [Cabal-syntax] exposed (src/Distribution/Types/InstalledPackageInfo/Lens.hs:94)
  1090. 142.84 s [Cabal-syntax] exposedModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:98)
  1091. 142.84 s [Cabal-syntax] hiddenModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:102)
  1092. 142.84 s [Cabal-syntax] trusted (src/Distribution/Types/InstalledPackageInfo/Lens.hs:106)
  1093. 142.84 s [Cabal-syntax] importDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:110)
  1094. 142.84 s [Cabal-syntax] libraryDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:114)
  1095. 142.84 s [Cabal-syntax] libraryDirsStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:118)
  1096. 142.84 s [Cabal-syntax] libraryDynDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:122)
  1097. 142.84 s [Cabal-syntax] dataDir (src/Distribution/Types/InstalledPackageInfo/Lens.hs:126)
  1098. 142.84 s [Cabal-syntax] hsLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:130)
  1099. 142.84 s [Cabal-syntax] extraLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:134)
  1100. 142.84 s [Cabal-syntax] extraLibrariesStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:138)
  1101. 142.84 s [Cabal-syntax] extraGHCiLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:142)
  1102. 142.84 s [Cabal-syntax] includeDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:146)
  1103. 142.84 s [Cabal-syntax] includes (src/Distribution/Types/InstalledPackageInfo/Lens.hs:150)
  1104. 142.84 s [Cabal-syntax] depends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:154)
  1105. 142.84 s [Cabal-syntax] abiDepends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:158)
  1106. 142.85 s [Cabal-syntax] ccOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:162)
  1107. 142.85 s [Cabal-syntax] cxxOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:166)
  1108. 142.85 s [Cabal-syntax] ldOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:170)
  1109. 142.85 s [Cabal-syntax] frameworkDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:174)
  1110. 142.85 s [Cabal-syntax] frameworks (src/Distribution/Types/InstalledPackageInfo/Lens.hs:178)
  1111. 142.85 s [Cabal-syntax] haddockInterfaces (src/Distribution/Types/InstalledPackageInfo/Lens.hs:182)
  1112. 142.85 s [Cabal-syntax] haddockHTMLs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:186)
  1113. 142.85 s [Cabal-syntax] pkgRoot (src/Distribution/Types/InstalledPackageInfo/Lens.hs:190)
  1114. 143.06 s [Cabal-syntax] 100% ( 12 / 12) in 'Distribution.Fields.ParseResult'
  1115. 143.08 s [Cabal-syntax] 83% ( 26 / 31) in 'Distribution.Fields'
  1116. 143.08 s [Cabal-syntax] Missing documentation for:
  1117. 143.08 s [Cabal-syntax] FieldName (src/Distribution/Fields/Field.hs:114)
  1118. 143.08 s [Cabal-syntax] showPWarning (src/Distribution/Parsec/Warning.hs:76)
  1119. 143.08 s [Cabal-syntax] showPError (src/Distribution/Parsec/Error.hs:20)
  1120. 143.08 s [Cabal-syntax] PrettyField (src/Distribution/Fields/Pretty.hs:44)
  1121. 143.08 s [Cabal-syntax] genericFromParsecFields (src/Distribution/Fields/Pretty.hs:176)
  1122. 143.50 s [Cabal-syntax] Warning: 'IsList' is out of scope.
  1123. 143.50 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1124. 143.51 s [Cabal-syntax] Warning: 'A' is out of scope.
  1125. 143.51 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1126. 143.51 s [Cabal-syntax] Warning: 'Z' is out of scope.
  1127. 143.51 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1128. 143.51 s [Cabal-syntax] 66% ( 6 / 9) in 'Language.Haskell.Extension'
  1129. 143.51 s [Cabal-syntax] Missing documentation for:
  1130. 143.51 s [Cabal-syntax] classifyLanguage (src/Language/Haskell/Extension.hs:80)
  1131. 143.51 s [Cabal-syntax] classifyExtension (src/Language/Haskell/Extension.hs:584)
  1132. 143.51 s [Cabal-syntax] knownExtensions (src/Language/Haskell/Extension.hs:622)
  1133. 143.78 s [Cabal-syntax] Warning: 'Compiler' is out of scope.
  1134. 143.78 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1135. 143.78 s [Cabal-syntax] Warning: 'UserHooks' is out of scope.
  1136. 143.78 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1137. 143.78 s [Cabal-syntax] 50% ( 9 / 18) in 'Distribution.Compiler'
  1138. 143.78 s [Cabal-syntax] Missing documentation for:
  1139. 143.78 s [Cabal-syntax] CompilerFlavor (src/Distribution/Compiler.hs:66)
  1140. 143.78 s [Cabal-syntax] buildCompilerId (src/Distribution/Compiler.hs:119)
  1141. 143.78 s [Cabal-syntax] buildCompilerFlavor (src/Distribution/Compiler.hs:113)
  1142. 143.78 s [Cabal-syntax] classifyCompilerFlavor (src/Distribution/Compiler.hs:104)
  1143. 143.78 s [Cabal-syntax] knownCompilerFlavors (src/Distribution/Compiler.hs:87)
  1144. 143.78 s [Cabal-syntax] perCompilerFlavorToList (src/Distribution/Compiler.hs:157)
  1145. 143.78 s [Cabal-syntax] CompilerId (src/Distribution/Compiler.hs:176)
  1146. 143.78 s [Cabal-syntax] AbiTag (src/Distribution/Compiler.hs:224)
  1147. 143.78 s [Cabal-syntax] abiTagString (src/Distribution/Compiler.hs:241)
  1148. 144.00 s [Cabal-syntax] 50% ( 1 / 2) in 'Distribution.Types.ConfVar'
  1149. 144.00 s [Cabal-syntax] Missing documentation for:
  1150. 144.00 s [Cabal-syntax] Module header
  1151. 144.03 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Fields.ConfVar'
  1152. 144.03 s [Cabal-syntax] Missing documentation for:
  1153. 144.03 s [Cabal-syntax] Module header
  1154. 144.03 s [Cabal-syntax] parseConditionConfVarFromClause (src/Distribution/Fields/ConfVar.hs:35)
  1155. 144.18 s [Cabal-syntax] Warning: 'rts' is out of scope.
  1156. 144.18 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1157. 144.18 s [Cabal-syntax] Warning: 'Extensions' is out of scope.
  1158. 144.18 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1159. 144.18 s [Cabal-syntax] 45% ( 5 / 11) in 'Distribution.Types.BuildInfo'
  1160. 144.18 s [Cabal-syntax] Missing documentation for:
  1161. 144.18 s [Cabal-syntax] Module header
  1162. 144.18 s [Cabal-syntax] BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
  1163. 144.18 s [Cabal-syntax] emptyBuildInfo (src/Distribution/Types/BuildInfo.hs:255)
  1164. 144.18 s [Cabal-syntax] hcProfOptions (src/Distribution/Types/BuildInfo.hs:289)
  1165. 144.18 s [Cabal-syntax] hcSharedOptions (src/Distribution/Types/BuildInfo.hs:292)
  1166. 144.18 s [Cabal-syntax] hcStaticOptions (src/Distribution/Types/BuildInfo.hs:295)
  1167. 144.28 s [Cabal-syntax] Warning: 'PackageDescription' is out of scope.
  1168. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1169. 144.29 s [Cabal-syntax] Warning: 'sanityCheckHookedBuildInfo' is out of scope.
  1170. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1171. 144.29 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1172. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1173. 144.29 s [Cabal-syntax] Warning: 'updatePackageDescription' is out of scope.
  1174. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1175. 144.29 s [Cabal-syntax] Warning: 'localPkgDescr' is out of scope.
  1176. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1177. 144.29 s [Cabal-syntax] Warning: 'confHook' is out of scope.
  1178. 144.29 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1179. 144.29 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.Types.HookedBuildInfo'
  1180. 144.29 s [Cabal-syntax] Missing documentation for:
  1181. 144.29 s [Cabal-syntax] Module header
  1182. 144.29 s [Cabal-syntax] emptyHookedBuildInfo (src/Distribution/Types/HookedBuildInfo.hs:65)
  1183. 144.35 s [Cabal-syntax] 25% ( 1 / 4) in 'Distribution.Types.BuildInfo.Lens'
  1184. 144.35 s [Cabal-syntax] Missing documentation for:
  1185. 144.35 s [Cabal-syntax] Module header
  1186. 144.35 s [Cabal-syntax] BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
  1187. 144.35 s [Cabal-syntax] HasBuildInfos (src/Distribution/Types/BuildInfo/Lens.hs:354)
  1188. 144.52 s [Cabal-syntax] 50% ( 3 / 6) in 'Distribution.Types.TestSuite'
  1189. 144.52 s [Cabal-syntax] Missing documentation for:
  1190. 144.52 s [Cabal-syntax] Module header
  1191. 144.52 s [Cabal-syntax] emptyTestSuite (src/Distribution/Types/TestSuite.hs:62)
  1192. 144.52 s [Cabal-syntax] testType (src/Distribution/Types/TestSuite.hs:65)
  1193. 144.58 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.TestSuite.Lens'
  1194. 144.58 s [Cabal-syntax] Missing documentation for:
  1195. 144.59 s [Cabal-syntax] Module header
  1196. 144.59 s [Cabal-syntax] testBuildInfo (src/Distribution/Types/TestSuite/Lens.hs:25)
  1197. 144.59 s [Cabal-syntax] testName (src/Distribution/Types/TestSuite/Lens.hs:17)
  1198. 144.59 s [Cabal-syntax] testInterface (src/Distribution/Types/TestSuite/Lens.hs:21)
  1199. 144.64 s [Cabal-syntax] Warning: 'addBuildableCondition' is out of scope.
  1200. 144.64 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1201. 144.64 s [Cabal-syntax] Warning: 'libModules' is out of scope.
  1202. 144.64 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1203. 144.65 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Types.Library'
  1204. 144.65 s [Cabal-syntax] Missing documentation for:
  1205. 144.65 s [Cabal-syntax] Module header
  1206. 144.65 s [Cabal-syntax] Library (src/Distribution/Types/Library.hs:22)
  1207. 144.65 s [Cabal-syntax] emptyLibrary (src/Distribution/Types/Library.hs:43)
  1208. 144.70 s [Cabal-syntax] 0% ( 0 / 9) in 'Distribution.Types.Library.Lens'
  1209. 144.70 s [Cabal-syntax] Missing documentation for:
  1210. 144.70 s [Cabal-syntax] Module header
  1211. 144.70 s [Cabal-syntax] Library (src/Distribution/Types/Library.hs:22)
  1212. 144.70 s [Cabal-syntax] libName (src/Distribution/Types/Library/Lens.hs:19)
  1213. 144.70 s [Cabal-syntax] libBuildInfo (src/Distribution/Types/Library/Lens.hs:43)
  1214. 144.70 s [Cabal-syntax] libVisibility (src/Distribution/Types/Library/Lens.hs:39)
  1215. 144.70 s [Cabal-syntax] exposedModules (src/Distribution/Types/Library/Lens.hs:23)
  1216. 144.70 s [Cabal-syntax] reexportedModules (src/Distribution/Types/Library/Lens.hs:27)
  1217. 144.70 s [Cabal-syntax] signatures (src/Distribution/Types/Library/Lens.hs:31)
  1218. 144.70 s [Cabal-syntax] libExposed (src/Distribution/Types/Library/Lens.hs:35)
  1219. 144.77 s [Cabal-syntax] 83% ( 10 / 12) in 'Distribution.Types.ForeignLib'
  1220. 144.77 s [Cabal-syntax] Missing documentation for:
  1221. 144.77 s [Cabal-syntax] Module header
  1222. 144.91 s [Cabal-syntax] LibVersionInfo (src/Distribution/Types/ForeignLib.hs:64)
  1223. 144.91 s [Cabal-syntax] 11% ( 1 / 9) in 'Distribution.Types.ForeignLib.Lens'
  1224. 144.91 s [Cabal-syntax] Missing documentation for:
  1225. 144.91 s [Cabal-syntax] Module header
  1226. 144.91 s [Cabal-syntax] foreignLibName (src/Distribution/Types/ForeignLib/Lens.hs:19)
  1227. 144.91 s [Cabal-syntax] foreignLibBuildInfo (src/Distribution/Types/ForeignLib/Lens.hs:31)
  1228. 144.91 s [Cabal-syntax] foreignLibType (src/Distribution/Types/ForeignLib/Lens.hs:23)
  1229. 144.91 s [Cabal-syntax] foreignLibOptions (src/Distribution/Types/ForeignLib/Lens.hs:27)
  1230. 144.91 s [Cabal-syntax] foreignLibVersionInfo (src/Distribution/Types/ForeignLib/Lens.hs:35)
  1231. 144.91 s [Cabal-syntax] foreignLibVersionLinux (src/Distribution/Types/ForeignLib/Lens.hs:39)
  1232. 144.91 s [Cabal-syntax] foreignLibModDefFile (src/Distribution/Types/ForeignLib/Lens.hs:43)
  1233. 144.91 s [Cabal-syntax] 40% ( 2 / 5) in 'Distribution.Types.Executable'
  1234. 144.91 s [Cabal-syntax] Missing documentation for:
  1235. 144.91 s [Cabal-syntax] Module header
  1236. 144.91 s [Cabal-syntax] Executable (src/Distribution/Types/Executable.hs:21)
  1237. 144.91 s [Cabal-syntax] emptyExecutable (src/Distribution/Types/Executable.hs:51)
  1238. 144.94 s [Cabal-syntax] 0% ( 0 / 6) in 'Distribution.Types.Executable.Lens'
  1239. 144.94 s [Cabal-syntax] Missing documentation for:
  1240. 144.94 s [Cabal-syntax] Module header
  1241. 144.94 s [Cabal-syntax] Executable (src/Distribution/Types/Executable.hs:21)
  1242. 144.94 s [Cabal-syntax] exeName (src/Distribution/Types/Executable/Lens.hs:17)
  1243. 144.94 s [Cabal-syntax] exeBuildInfo (src/Distribution/Types/Executable/Lens.hs:29)
  1244. 144.94 s [Cabal-syntax] modulePath (src/Distribution/Types/Executable/Lens.hs:21)
  1245. 144.94 s [Cabal-syntax] exeScope (src/Distribution/Types/Executable/Lens.hs:25)
  1246. 144.99 s [Cabal-syntax] 50% ( 3 / 6) in 'Distribution.Types.Benchmark'
  1247. 144.99 s [Cabal-syntax] Missing documentation for:
  1248. 144.99 s [Cabal-syntax] Module header
  1249. 144.99 s [Cabal-syntax] emptyBenchmark (src/Distribution/Types/Benchmark.hs:58)
  1250. 144.99 s [Cabal-syntax] benchmarkType (src/Distribution/Types/Benchmark.hs:61)
  1251. 145.06 s [Cabal-syntax] 14% ( 1 / 7) in 'Distribution.Types.Component'
  1252. 145.06 s [Cabal-syntax] Missing documentation for:
  1253. 145.06 s [Cabal-syntax] Module header
  1254. 145.06 s [Cabal-syntax] Component (src/Distribution/Types/Component.hs:26)
  1255. 145.06 s [Cabal-syntax] foldComponent (src/Distribution/Types/Component.hs:52)
  1256. 145.06 s [Cabal-syntax] componentBuildInfo (src/Distribution/Types/Component.hs:66)
  1257. 145.06 s [Cabal-syntax] componentName (src/Distribution/Types/Component.hs:78)
  1258. 145.06 s [Cabal-syntax] partitionComponents (src/Distribution/Types/Component.hs:87)
  1259. 145.12 s [Cabal-syntax] Warning: 'PackageDescription' is out of scope.
  1260. 145.12 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1261. 145.12 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1262. 145.12 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1263. 145.12 s [Cabal-syntax] Warning: 'flattenPD' is out of scope.
  1264. 145.12 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1265. 145.12 s [Cabal-syntax] 87% ( 7 / 8) in 'Distribution.Types.ComponentRequestedSpec'
  1266. 145.12 s [Cabal-syntax] Missing documentation for:
  1267. 145.12 s [Cabal-syntax] Module header
  1268. 145.22 s [Cabal-syntax] Warning: 'GenericPackageDescription' is out of scope.
  1269. 145.22 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1270. 145.23 s [Cabal-syntax] Warning: 'LicenseExpression' is out of scope.
  1271. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1272. 145.23 s [Cabal-syntax] Warning: 'withLibLBI' is out of scope.
  1273. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1274. 145.23 s [Cabal-syntax] Warning: 'LocalBuildInfo' is out of scope.
  1275. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1276. 145.23 s [Cabal-syntax] Warning: 'withExeLBI' is out of scope.
  1277. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1278. 145.23 s [Cabal-syntax] Warning: 'withTestLBI' is out of scope.
  1279. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1280. 145.23 s [Cabal-syntax] Warning: 'withBenchLBI' is out of scope.
  1281. 145.23 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1282. 145.23 s [Cabal-syntax] 82% ( 23 / 28) in 'Distribution.Types.PackageDescription'
  1283. 145.23 s [Cabal-syntax] Missing documentation for:
  1284. 145.23 s [Cabal-syntax] emptyPackageDescription (src/Distribution/Types/PackageDescription.hs:199)
  1285. 145.23 s [Cabal-syntax] allLibraries (src/Distribution/Types/PackageDescription.hs:251)
  1286. 145.23 s [Cabal-syntax] updatePackageDescription (src/Distribution/Types/PackageDescription.hs:370)
  1287. 145.23 s [Cabal-syntax] lookupComponent (src/Distribution/Types/PackageDescription.hs:430)
  1288. 145.23 s [Cabal-syntax] getComponent (src/Distribution/Types/PackageDescription.hs:442)
  1289. 145.55 s [Cabal-syntax] 0% ( 0 / 3) in 'Distribution.Types.GenericPackageDescription'
  1290. 145.55 s [Cabal-syntax] Missing documentation for:
  1291. 145.55 s [Cabal-syntax] Module header
  1292. 145.55 s [Cabal-syntax] GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
  1293. 145.55 s [Cabal-syntax] emptyGenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:83)
  1294. 145.61 s [Cabal-syntax] 13% ( 3 / 23) in 'Distribution.Types.GenericPackageDescription.Lens'
  1295. 145.61 s [Cabal-syntax] Missing documentation for:
  1296. 145.61 s [Cabal-syntax] Module header
  1297. 145.61 s [Cabal-syntax] GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
  1298. 145.61 s [Cabal-syntax] packageDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:40)
  1299. 145.61 s [Cabal-syntax] flagName (src/Distribution/Types/GenericPackageDescription/Lens.hs:100)
  1300. 145.61 s [Cabal-syntax] flagDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:104)
  1301. 145.61 s [Cabal-syntax] flagDefault (src/Distribution/Types/GenericPackageDescription/Lens.hs:108)
  1302. 145.61 s [Cabal-syntax] flagManual (src/Distribution/Types/GenericPackageDescription/Lens.hs:112)
  1303. 145.61 s [Cabal-syntax] gpdScannedVersion (src/Distribution/Types/GenericPackageDescription/Lens.hs:44)
  1304. 145.61 s [Cabal-syntax] genPackageFlags (src/Distribution/Types/GenericPackageDescription/Lens.hs:48)
  1305. 145.61 s [Cabal-syntax] condLibrary (src/Distribution/Types/GenericPackageDescription/Lens.hs:52)
  1306. 145.61 s [Cabal-syntax] condSubLibraries (src/Distribution/Types/GenericPackageDescription/Lens.hs:56)
  1307. 145.61 s [Cabal-syntax] condForeignLibs (src/Distribution/Types/GenericPackageDescription/Lens.hs:60)
  1308. 145.61 s [Cabal-syntax] condExecutables (src/Distribution/Types/GenericPackageDescription/Lens.hs:64)
  1309. 145.61 s [Cabal-syntax] condTestSuites (src/Distribution/Types/GenericPackageDescription/Lens.hs:68)
  1310. 145.61 s [Cabal-syntax] condBenchmarks (src/Distribution/Types/GenericPackageDescription/Lens.hs:72)
  1311. 145.62 s [Cabal-syntax] allCondTrees (src/Distribution/Types/GenericPackageDescription/Lens.hs:76)
  1312. 145.62 s [Cabal-syntax] _OS (src/Distribution/Types/GenericPackageDescription/Lens.hs:120)
  1313. 145.62 s [Cabal-syntax] _Arch (src/Distribution/Types/GenericPackageDescription/Lens.hs:124)
  1314. 145.62 s [Cabal-syntax] _PackageFlag (src/Distribution/Types/GenericPackageDescription/Lens.hs:128)
  1315. 145.62 s [Cabal-syntax] _Impl (src/Distribution/Types/GenericPackageDescription/Lens.hs:132)
  1316. 145.65 s [Cabal-syntax] 20% ( 1 / 5) in 'Distribution.Types.Benchmark.Lens'
  1317. 145.65 s [Cabal-syntax] Missing documentation for:
  1318. 145.65 s [Cabal-syntax] Module header
  1319. 145.65 s [Cabal-syntax] benchmarkName (src/Distribution/Types/Benchmark/Lens.hs:17)
  1320. 145.65 s [Cabal-syntax] benchmarkBuildInfo (src/Distribution/Types/Benchmark/Lens.hs:25)
  1321. 145.65 s [Cabal-syntax] benchmarkInterface (src/Distribution/Types/Benchmark/Lens.hs:21)
  1322. 145.69 s [Cabal-syntax] 11% ( 4 / 35) in 'Distribution.Types.PackageDescription.Lens'
  1323. 145.69 s [Cabal-syntax] Missing documentation for:
  1324. 145.69 s [Cabal-syntax] Module header
  1325. 145.69 s [Cabal-syntax] package (src/Distribution/Types/PackageDescription/Lens.hs:41)
  1326. 145.69 s [Cabal-syntax] copyright (src/Distribution/Types/PackageDescription/Lens.hs:53)
  1327. 145.69 s [Cabal-syntax] maintainer (src/Distribution/Types/PackageDescription/Lens.hs:57)
  1328. 145.69 s [Cabal-syntax] author (src/Distribution/Types/PackageDescription/Lens.hs:61)
  1329. 145.69 s [Cabal-syntax] stability (src/Distribution/Types/PackageDescription/Lens.hs:65)
  1330. 145.69 s [Cabal-syntax] homepage (src/Distribution/Types/PackageDescription/Lens.hs:73)
  1331. 145.69 s [Cabal-syntax] pkgUrl (src/Distribution/Types/PackageDescription/Lens.hs:77)
  1332. 145.69 s [Cabal-syntax] synopsis (src/Distribution/Types/PackageDescription/Lens.hs:89)
  1333. 145.69 s [Cabal-syntax] description (src/Distribution/Types/PackageDescription/Lens.hs:93)
  1334. 145.69 s [Cabal-syntax] category (src/Distribution/Types/PackageDescription/Lens.hs:97)
  1335. 145.69 s [Cabal-syntax] dataDir (src/Distribution/Types/PackageDescription/Lens.hs:145)
  1336. 145.69 s [Cabal-syntax] specVersion (src/Distribution/Types/PackageDescription/Lens.hs:105)
  1337. 145.69 s [Cabal-syntax] licenseRaw (src/Distribution/Types/PackageDescription/Lens.hs:45)
  1338. 145.70 s [Cabal-syntax] licenseFiles (src/Distribution/Types/PackageDescription/Lens.hs:49)
  1339. 145.70 s [Cabal-syntax] testedWith (src/Distribution/Types/PackageDescription/Lens.hs:69)
  1340. 145.70 s [Cabal-syntax] bugReports (src/Distribution/Types/PackageDescription/Lens.hs:81)
  1341. 145.70 s [Cabal-syntax] sourceRepos (src/Distribution/Types/PackageDescription/Lens.hs:85)
  1342. 145.70 s [Cabal-syntax] customFieldsPD (src/Distribution/Types/PackageDescription/Lens.hs:101)
  1343. 145.70 s [Cabal-syntax] buildTypeRaw (src/Distribution/Types/PackageDescription/Lens.hs:109)
  1344. 145.70 s [Cabal-syntax] setupBuildInfo (src/Distribution/Types/PackageDescription/Lens.hs:113)
  1345. 145.70 s [Cabal-syntax] library (src/Distribution/Types/PackageDescription/Lens.hs:117)
  1346. 145.70 s [Cabal-syntax] subLibraries (src/Distribution/Types/PackageDescription/Lens.hs:121)
  1347. 145.70 s [Cabal-syntax] executables (src/Distribution/Types/PackageDescription/Lens.hs:125)
  1348. 145.70 s [Cabal-syntax] foreignLibs (src/Distribution/Types/PackageDescription/Lens.hs:129)
  1349. 145.70 s [Cabal-syntax] testSuites (src/Distribution/Types/PackageDescription/Lens.hs:133)
  1350. 145.70 s [Cabal-syntax] benchmarks (src/Distribution/Types/PackageDescription/Lens.hs:137)
  1351. 145.70 s [Cabal-syntax] dataFiles (src/Distribution/Types/PackageDescription/Lens.hs:141)
  1352. 145.70 s [Cabal-syntax] extraSrcFiles (src/Distribution/Types/PackageDescription/Lens.hs:149)
  1353. 145.70 s [Cabal-syntax] extraTmpFiles (src/Distribution/Types/PackageDescription/Lens.hs:153)
  1354. 145.70 s [Cabal-syntax] extraDocFiles (src/Distribution/Types/PackageDescription/Lens.hs:157)
  1355. 145.75 s [Cabal-syntax] 91% ( 11 / 12) in 'Distribution.Types.Lens'
  1356. 145.75 s [Cabal-syntax] Missing documentation for:
  1357. 145.75 s [Cabal-syntax] Module header
  1358. 145.76 s [Cabal-syntax] 100% ( 56 / 56) in 'Distribution.PackageDescription'
  1359. 145.83 s [Cabal-syntax] Warning: 'Arch' is ambiguous. It is defined
  1360. 145.83 s [Cabal-syntax] * at src/Distribution/Types/ConfVar.hs:19:5
  1361. 145.83 s [Cabal-syntax] * at src/Distribution/System.hs:195:1
  1362. 145.83 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1363. 145.84 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1364. 145.84 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Types/ConfVar.hs:17:1
  1365. 145.84 s [Cabal-syntax] Warning: 'OS' is ambiguous. It is defined
  1366. 145.84 s [Cabal-syntax] * at src/Distribution/Types/ConfVar.hs:18:5
  1367. 145.84 s [Cabal-syntax] * at src/Distribution/System.hs:97:1
  1368. 145.84 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1369. 145.84 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1370. 145.84 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/Types/ConfVar.hs:17:1
  1371. 145.84 s [Cabal-syntax] 62% ( 10 / 16) in 'Distribution.PackageDescription.Configuration'
  1372. 145.84 s [Cabal-syntax] Missing documentation for:
  1373. 145.84 s [Cabal-syntax] freeVars (src/Distribution/PackageDescription/Configuration.hs:347)
  1374. 145.84 s [Cabal-syntax] mapCondTree (src/Distribution/Types/CondTree.hs:104)
  1375. 145.84 s [Cabal-syntax] mapTreeData (src/Distribution/Types/CondTree.hs:125)
  1376. 145.84 s [Cabal-syntax] mapTreeConds (src/Distribution/Types/CondTree.hs:122)
  1377. 145.84 s [Cabal-syntax] mapTreeConstrs (src/Distribution/Types/CondTree.hs:119)
  1378. 145.84 s [Cabal-syntax] transformAllBuildInfos (src/Distribution/PackageDescription/Configuration.hs:639)
  1379. 146.03 s [Cabal-syntax] 96% ( 29 / 30) in 'Distribution.FieldGrammar.Newtypes'
  1380. 146.03 s [Cabal-syntax] Missing documentation for:
  1381. 146.03 s [Cabal-syntax] Sep (src/Distribution/FieldGrammar/Newtypes.hs:91)
  1382. 146.13 s [Cabal-syntax] Warning: 'pack' is out of scope.
  1383. 146.13 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1384. 146.13 s [Cabal-syntax] Warning: 'Last' is out of scope.
  1385. 146.13 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1386. 146.14 s [Cabal-syntax] 85% ( 6 / 7) in 'Distribution.FieldGrammar.Class'
  1387. 146.14 s [Cabal-syntax] Missing documentation for:
  1388. 146.14 s [Cabal-syntax] Module header
  1389. 146.17 s [Cabal-syntax] 33% ( 1 / 3) in 'Distribution.FieldGrammar.Pretty'
  1390. 146.17 s [Cabal-syntax] Missing documentation for:
  1391. 146.17 s [Cabal-syntax] Module header
  1392. 146.17 s [Cabal-syntax] PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
  1393. 146.28 s [Cabal-syntax] Warning: 'FieldGrammarParser' is out of scope.
  1394. 146.28 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1395. 146.28 s [Cabal-syntax] Warning: 'GeneralPackageDescription' is out of scope.
  1396. 146.28 s [Cabal-syntax] If you qualify the identifier, haddock can try to link it anyway.
  1397. 146.28 s [Cabal-syntax] Warning: 'Section' is ambiguous. It is defined
  1398. 146.28 s [Cabal-syntax] * at src/Distribution/Fields/Field.hs:52:5
  1399. 146.28 s [Cabal-syntax] * at src/Distribution/FieldGrammar/Parsec.hs:105:1
  1400. 146.28 s [Cabal-syntax] You may be able to disambiguate the identifier by qualifying it or
  1401. 146.28 s [Cabal-syntax] by specifying the type/value namespace explicitly.
  1402. 146.28 s [Cabal-syntax] Defaulting to the one defined at src/Distribution/FieldGrammar/Parsec.hs:105:1
  1403. 146.28 s [Cabal-syntax] 33% ( 4 / 12) in 'Distribution.FieldGrammar.Parsec'
  1404. 146.28 s [Cabal-syntax] Missing documentation for:
  1405. 146.28 s [Cabal-syntax] ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
  1406. 146.28 s [Cabal-syntax] parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:119)
  1407. 146.28 s [Cabal-syntax] fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:134)
  1408. 146.28 s [Cabal-syntax] Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
  1409. 146.28 s [Cabal-syntax] namelessFieldAnn (src/Distribution/FieldGrammar/Parsec.hs:101)
  1410. 146.28 s [Cabal-syntax] runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:381)
  1411. 146.28 s [Cabal-syntax] runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:352)
  1412. 146.28 s [Cabal-syntax] fieldLinesToStream (src/Distribution/FieldGrammar/Parsec.hs:441)
  1413. 146.44 s [Cabal-syntax] 65% ( 17 / 26) in 'Distribution.FieldGrammar'
  1414. 146.44 s [Cabal-syntax] Missing documentation for:
  1415. 146.44 s [Cabal-syntax] ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
  1416. 146.44 s [Cabal-syntax] ParsecFieldGrammar' (src/Distribution/FieldGrammar.hs:49)
  1417. 146.44 s [Cabal-syntax] parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:119)
  1418. 146.44 s [Cabal-syntax] fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:134)
  1419. 146.44 s [Cabal-syntax] PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
  1420. 146.44 s [Cabal-syntax] PrettyFieldGrammar' (src/Distribution/FieldGrammar.hs:50)
  1421. 146.44 s [Cabal-syntax] Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
  1422. 146.44 s [Cabal-syntax] runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:381)
  1423. 146.44 s [Cabal-syntax] runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:352)
  1424. 146.61 s [Cabal-syntax] 36% ( 17 / 47) in 'Distribution.PackageDescription.FieldGrammar'
  1425. 146.61 s [Cabal-syntax] Missing documentation for:
  1426. 146.61 s [Cabal-syntax] packageDescriptionFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:95)
  1427. 146.61 s [Cabal-syntax] CompatLicenseFile (src/Distribution/PackageDescription/FieldGrammar.hs:852)
  1428. 146.61 s [Cabal-syntax] libraryFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:168)
  1429. 146.61 s [Cabal-syntax] foreignLibFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:216)
  1430. 146.61 s [Cabal-syntax] executableFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:257)
  1431. 146.61 s [Cabal-syntax] testSuiteFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:327)
  1432. 146.61 s [Cabal-syntax] validateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:360)
  1433. 146.61 s [Cabal-syntax] unvalidateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:424)
  1434. 146.61 s [Cabal-syntax] testStanzaTestType (src/Distribution/PackageDescription/FieldGrammar.hs:307)
  1435. 146.61 s [Cabal-syntax] testStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:311)
  1436. 146.61 s [Cabal-syntax] testStanzaTestModule (src/Distribution/PackageDescription/FieldGrammar.hs:315)
  1437. 146.61 s [Cabal-syntax] testStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:319)
  1438. 146.61 s [Cabal-syntax] benchmarkFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:471)
  1439. 146.61 s [Cabal-syntax] validateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:501)
  1440. 146.61 s [Cabal-syntax] unvalidateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:554)
  1441. 146.61 s [Cabal-syntax] formatDependencyList (src/Distribution/PackageDescription/FieldGrammar.hs:794)
  1442. 146.61 s [Cabal-syntax] formatExposedModules (src/Distribution/PackageDescription/FieldGrammar.hs:803)
  1443. 146.61 s [Cabal-syntax] formatExtraSourceFiles (src/Distribution/PackageDescription/FieldGrammar.hs:800)
  1444. 146.61 s [Cabal-syntax] formatHsSourceDirs (src/Distribution/PackageDescription/FieldGrammar.hs:806)
  1445. 146.61 s [Cabal-syntax] formatMixinList (src/Distribution/PackageDescription/FieldGrammar.hs:797)
  1446. 146.61 s [Cabal-syntax] formatOtherExtensions (src/Distribution/PackageDescription/FieldGrammar.hs:809)
  1447. 146.61 s [Cabal-syntax] formatOtherModules (src/Distribution/PackageDescription/FieldGrammar.hs:812)
  1448. 146.61 s [Cabal-syntax] benchmarkStanzaBenchmarkType (src/Distribution/PackageDescription/FieldGrammar.hs:455)
  1449. 146.61 s [Cabal-syntax] benchmarkStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:459)
  1450. 146.61 s [Cabal-syntax] benchmarkStanzaBenchmarkModule (src/Distribution/PackageDescription/FieldGrammar.hs:463)
  1451. 146.61 s [Cabal-syntax] benchmarkStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:467)
  1452. 146.62 s [Cabal-syntax] flagFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:745)
  1453. 146.62 s [Cabal-syntax] sourceRepoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:761)
  1454. 146.62 s [Cabal-syntax] setupBInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:780)
  1455. 146.62 s [Cabal-syntax] buildInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:572)
  1456. 147.18 s [Cabal-syntax] 100% ( 11 / 11) in 'Distribution.PackageDescription.PrettyPrint'
  1457. 147.32 s [Cabal-syntax] 90% ( 10 / 11) in 'Distribution.PackageDescription.Parsec'
  1458. 147.32 s [Cabal-syntax] Missing documentation for:
  1459. 147.32 s [Cabal-syntax] parseHookedBuildInfo (src/Distribution/PackageDescription/Parsec.hs:925)
  1460. 147.50 s [Cabal-syntax] 60% ( 3 / 5) in 'Distribution.FieldGrammar.FieldDescrs'
  1461. 147.50 s [Cabal-syntax] Missing documentation for:
  1462. 147.50 s [Cabal-syntax] Module header
  1463. 147.50 s [Cabal-syntax] fieldDescrsToList (src/Distribution/FieldGrammar/FieldDescrs.hs:54)
  1464. 147.58 s [Cabal-syntax] 0% ( 0 / 2) in 'Distribution.Types.InstalledPackageInfo.FieldGrammar'
  1465. 147.58 s [Cabal-syntax] Missing documentation for:
  1466. 147.58 s [Cabal-syntax] Module header
  1467. 147.58 s [Cabal-syntax] ipiFieldGrammar (src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs:56)
  1468. 147.67 s [Cabal-syntax] 57% ( 8 / 14) in 'Distribution.InstalledPackageInfo'
  1469. 147.67 s [Cabal-syntax] Missing documentation for:
  1470. 147.67 s [Cabal-syntax] InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
  1471. 147.67 s [Cabal-syntax] installedComponentId (src/Distribution/InstalledPackageInfo.hs:65)
  1472. 147.67 s [Cabal-syntax] sourceComponentName (src/Distribution/InstalledPackageInfo.hs:88)
  1473. 147.67 s [Cabal-syntax] ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
  1474. 147.67 s [Cabal-syntax] emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:131)
  1475. 147.67 s [Cabal-syntax] showSimpleInstalledPackageInfoField (src/Distribution/InstalledPackageInfo.hs:137)
  1476. 147.89 s [Cabal-syntax] Warning: Distribution.Compat.MonadFail: could not find link destinations for:
  1477. 147.89 s [Cabal-syntax] - Text.ParserCombinators.ReadP.P
  1478. 147.91 s [Cabal-syntax] Warning: Distribution.Utils.Structured: could not find link destinations for:
  1479. 147.91 s [Cabal-syntax] - Distribution.Utils.Structured.GStructuredSum
  1480. 147.91 s [Cabal-syntax] - Distribution.Utils.Structured.gstructured
  1481. 147.91 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1482. 147.91 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1483. 147.94 s [Cabal-syntax] Warning: Distribution.Compat.Semigroup: could not find link destinations for:
  1484. 147.94 s [Cabal-syntax] - Data.Foldable1.JoinWith
  1485. 147.94 s [Cabal-syntax] - Data.Foldable1.FromMaybe
  1486. 147.94 s [Cabal-syntax] - Data.Foldable1.NonEmptyDList
  1487. 147.94 s [Cabal-syntax] - Data.Set.Internal.MergeSet
  1488. 147.94 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1489. 147.94 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1490. 147.94 s [Cabal-syntax] - Distribution.Compat.Semigroup.GMonoid
  1491. 147.94 s [Cabal-syntax] - Distribution.Compat.Semigroup.GSemigroup
  1492. 147.94 s [Cabal-syntax] Warning: Distribution.Compat.NonEmptySet: could not find link destinations for:
  1493. 147.94 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1494. 147.94 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1495. 149.23 s [Cabal-syntax] Warning: Distribution.Compat.Prelude: could not find link destinations for:
  1496. 149.23 s [Cabal-syntax] - GHC.Prim.~#
  1497. 149.23 s [Cabal-syntax] - GHC.Generics.SingKind
  1498. 149.23 s [Cabal-syntax] - GHC.Generics.DemoteRep
  1499. 149.23 s [Cabal-syntax] - GHC.Generics.fromSing
  1500. 149.23 s [Cabal-syntax] - GHC.Generics.SingI
  1501. 149.23 s [Cabal-syntax] - GHC.Generics.sing
  1502. 149.23 s [Cabal-syntax] - GHC.Generics.Sing
  1503. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:UReckWordp0
  1504. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:UReckIntp0
  1505. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:UReckFloatp0
  1506. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:UReckDoublep0
  1507. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:UReckCharp0
  1508. 149.24 s [Cabal-syntax] - Data.Foldable1.JoinWith
  1509. 149.24 s [Cabal-syntax] - Data.Foldable1.FromMaybe
  1510. 149.24 s [Cabal-syntax] - Data.Foldable1.NonEmptyDList
  1511. 149.24 s [Cabal-syntax] - Text.ParserCombinators.ReadP.P
  1512. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:SingBoola0
  1513. 149.24 s [Cabal-syntax] - GHC.Generics.STrue
  1514. 149.24 s [Cabal-syntax] - GHC.Generics.SFalse
  1515. 149.24 s [Cabal-syntax] - GHC.Generics.D:R:SingMaybeb0
  1516. 149.24 s [Cabal-syntax] - GHC.Generics.SNothing
  1517. 149.24 s [Cabal-syntax] - GHC.Generics.SJust
  1518. 149.24 s [Cabal-syntax] - Data.Set.Internal.MergeSet
  1519. 149.24 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1520. 149.24 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1521. 149.24 s [Cabal-syntax] - Distribution.Compat.Semigroup.GMonoid
  1522. 149.24 s [Cabal-syntax] - Distribution.Compat.Semigroup.GSemigroup
  1523. 149.24 s [Cabal-syntax] - Distribution.Compat.Prelude.GNFData
  1524. 149.24 s [Cabal-syntax] - Data.Graph.SetM
  1525. 149.24 s [Cabal-syntax] Warning: Distribution.Utils.ShortText: could not find link destinations for:
  1526. 149.24 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1527. 149.24 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1528. 149.25 s [Cabal-syntax] Warning: Distribution.Types.Condition: could not find link destinations for:
  1529. 149.25 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1530. 149.25 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1531. 149.26 s [Cabal-syntax] Warning: Distribution.Fields.LexerMonad: could not find link destinations for:
  1532. 149.26 s [Cabal-syntax] - Distribution.Fields.LexerMonad.StartCode
  1533. 149.28 s [Cabal-syntax] Warning: Distribution.Types.CondTree: could not find link destinations for:
  1534. 149.28 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1535. 149.28 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1536. 149.29 s [Cabal-syntax] Warning: Distribution.CabalSpecVersion: could not find link destinations for:
  1537. 149.29 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1538. 149.29 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1539. 149.36 s [Cabal-syntax] Warning: Distribution.Utils.Path: could not find link destinations for:
  1540. 149.36 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1541. 149.36 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1542. 149.36 s [Cabal-syntax] Warning: Distribution.Types.Version: could not find link destinations for:
  1543. 149.36 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1544. 149.36 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1545. 149.37 s [Cabal-syntax] Warning: Distribution.Types.VersionRange.Internal: could not find link destinations for:
  1546. 149.37 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1547. 149.37 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1548. 149.39 s [Cabal-syntax] Warning: Distribution.Types.VersionRange: could not find link destinations for:
  1549. 149.40 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1550. 149.40 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1551. 149.41 s [Cabal-syntax] Warning: Distribution.Types.SourceRepo: could not find link destinations for:
  1552. 149.41 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1553. 149.41 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1554. 149.42 s [Cabal-syntax] Warning: Distribution.Types.SourceRepo.Lens: could not find link destinations for:
  1555. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1556. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1557. 149.42 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigVersion: could not find link destinations for:
  1558. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1559. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1560. 149.42 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigVersionRange: could not find link destinations for:
  1561. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1562. 149.42 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1563. 149.43 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigName: could not find link destinations for:
  1564. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1565. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1566. 149.43 s [Cabal-syntax] Warning: Distribution.Types.PkgconfigDependency: could not find link destinations for:
  1567. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1568. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1569. 149.43 s [Cabal-syntax] Warning: Distribution.Types.PackageName: could not find link destinations for:
  1570. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1571. 149.43 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1572. 149.44 s [Cabal-syntax] Warning: Distribution.Types.UnqualComponentName: could not find link destinations for:
  1573. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1574. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1575. 149.44 s [Cabal-syntax] Warning: Distribution.Types.LibraryVisibility: could not find link destinations for:
  1576. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1577. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1578. 149.44 s [Cabal-syntax] Warning: Distribution.Types.LibraryName: could not find link destinations for:
  1579. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1580. 149.44 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1581. 149.45 s [Cabal-syntax] Warning: Distribution.Types.MungedPackageName: could not find link destinations for:
  1582. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1583. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1584. 149.45 s [Cabal-syntax] Warning: Distribution.Types.ForeignLibType: could not find link destinations for:
  1585. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1586. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1587. 149.45 s [Cabal-syntax] Warning: Distribution.Types.ForeignLibOption: could not find link destinations for:
  1588. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1589. 149.45 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1590. 149.47 s [Cabal-syntax] Warning: Distribution.Types.Flag: could not find link destinations for:
  1591. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1592. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1593. 149.47 s [Cabal-syntax] Warning: Distribution.Types.ExecutableScope: could not find link destinations for:
  1594. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1595. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1596. 149.47 s [Cabal-syntax] Warning: Distribution.Types.ComponentName: could not find link destinations for:
  1597. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1598. 149.47 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1599. 149.47 s [Cabal-syntax] - Distribution.Types.ComponentName.NotLibComponentName
  1600. 149.48 s [Cabal-syntax] Warning: Distribution.Types.ComponentId: could not find link destinations for:
  1601. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1602. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1603. 149.48 s [Cabal-syntax] Warning: Distribution.Types.BuildType: could not find link destinations for:
  1604. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1605. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1606. 149.48 s [Cabal-syntax] Warning: Distribution.Types.AbiHash: could not find link destinations for:
  1607. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1608. 149.48 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1609. 149.50 s [Cabal-syntax] Warning: Distribution.System: could not find link destinations for:
  1610. 149.50 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1611. 149.50 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1612. 149.50 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseReference: could not find link destinations for:
  1613. 149.50 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1614. 149.50 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1615. 149.54 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseId: could not find link destinations for:
  1616. 149.54 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1617. 149.54 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1618. 149.55 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseExceptionId: could not find link destinations for:
  1619. 149.55 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1620. 149.55 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1621. 149.56 s [Cabal-syntax] Warning: Distribution.SPDX.LicenseExpression: could not find link destinations for:
  1622. 149.56 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1623. 149.56 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1624. 149.56 s [Cabal-syntax] Warning: Distribution.SPDX.License: could not find link destinations for:
  1625. 149.56 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1626. 149.56 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1627. 149.62 s [Cabal-syntax] Warning: Distribution.SPDX: could not find link destinations for:
  1628. 149.62 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1629. 149.62 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1630. 149.63 s [Cabal-syntax] Warning: Distribution.ModuleName: could not find link destinations for:
  1631. 149.63 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1632. 149.63 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1633. 149.63 s [Cabal-syntax] Warning: Distribution.Types.ModuleRenaming: could not find link destinations for:
  1634. 149.63 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1635. 149.63 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1636. 149.64 s [Cabal-syntax] Warning: Distribution.Types.IncludeRenaming: could not find link destinations for:
  1637. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1638. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1639. 149.64 s [Cabal-syntax] Warning: Distribution.Types.Mixin: could not find link destinations for:
  1640. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1641. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1642. 149.64 s [Cabal-syntax] Warning: Distribution.Types.ModuleReexport: could not find link destinations for:
  1643. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1644. 149.64 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1645. 149.65 s [Cabal-syntax] Warning: Distribution.Compat.Graph: could not find link destinations for:
  1646. 149.65 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1647. 149.65 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1648. 149.67 s [Cabal-syntax] Warning: Distribution.Version: could not find link destinations for:
  1649. 149.67 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1650. 149.67 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1651. 149.68 s [Cabal-syntax] Warning: Distribution.Types.TestType: could not find link destinations for:
  1652. 149.68 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1653. 149.68 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1654. 149.68 s [Cabal-syntax] Warning: Distribution.Types.TestSuiteInterface: could not find link destinations for:
  1655. 149.68 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1656. 149.68 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1657. 149.69 s [Cabal-syntax] Warning: Distribution.Types.PackageId: could not find link destinations for:
  1658. 149.69 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1659. 149.69 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1660. 149.69 s [Cabal-syntax] Warning: Distribution.Types.UnitId: could not find link destinations for:
  1661. 149.69 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1662. 149.69 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1663. 149.70 s [Cabal-syntax] Warning: Distribution.Types.Module: could not find link destinations for:
  1664. 149.70 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1665. 149.70 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1666. 149.71 s [Cabal-syntax] Warning: Distribution.Backpack: could not find link destinations for:
  1667. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1668. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1669. 149.71 s [Cabal-syntax] Warning: Distribution.Types.ExposedModule: could not find link destinations for:
  1670. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1671. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1672. 149.71 s [Cabal-syntax] Warning: Distribution.Types.PackageVersionConstraint: could not find link destinations for:
  1673. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1674. 149.71 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1675. 149.72 s [Cabal-syntax] Warning: Distribution.Types.PackageId.Lens: could not find link destinations for:
  1676. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1677. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1678. 149.72 s [Cabal-syntax] Warning: Distribution.Types.MungedPackageId: could not find link destinations for:
  1679. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1680. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1681. 149.72 s [Cabal-syntax] Warning: Distribution.Types.LegacyExeDependency: could not find link destinations for:
  1682. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1683. 149.72 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1684. 149.73 s [Cabal-syntax] Warning: Distribution.Types.ExeDependency: could not find link destinations for:
  1685. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1686. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1687. 149.73 s [Cabal-syntax] Warning: Distribution.Types.Dependency: could not find link destinations for:
  1688. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1689. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1690. 149.73 s [Cabal-syntax] Warning: Distribution.Types.SetupBuildInfo: could not find link destinations for:
  1691. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1692. 149.73 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1693. 149.74 s [Cabal-syntax] Warning: Distribution.Types.SetupBuildInfo.Lens: could not find link destinations for:
  1694. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1695. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1696. 149.74 s [Cabal-syntax] Warning: Distribution.Types.BenchmarkType: could not find link destinations for:
  1697. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1698. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1699. 149.74 s [Cabal-syntax] Warning: Distribution.Types.BenchmarkInterface: could not find link destinations for:
  1700. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1701. 149.74 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1702. 149.75 s [Cabal-syntax] Warning: Distribution.Types.AbiDependency: could not find link destinations for:
  1703. 149.75 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1704. 149.75 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1705. 149.75 s [Cabal-syntax] Warning: Distribution.License: could not find link destinations for:
  1706. 149.75 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1707. 149.75 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1708. 149.76 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo: could not find link destinations for:
  1709. 149.76 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1710. 149.76 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1711. 149.76 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.Lens: could not find link destinations for:
  1712. 149.76 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1713. 149.76 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1714. 149.80 s [Cabal-syntax] Warning: Language.Haskell.Extension: could not find link destinations for:
  1715. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1716. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1717. 149.97 s [Cabal-syntax] Warning: Distribution.Compiler: could not find link destinations for:
  1718. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1719. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1720. 149.97 s [Cabal-syntax] Warning: Distribution.Types.ConfVar: could not find link destinations for:
  1721. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1722. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1723. 149.97 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo: could not find link destinations for:
  1724. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1725. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1726. 149.97 s [Cabal-syntax] Warning: Distribution.Types.BuildInfo.Lens: could not find link destinations for:
  1727. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1728. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1729. 149.97 s [Cabal-syntax] Warning: Distribution.Types.TestSuite: could not find link destinations for:
  1730. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1731. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1732. 149.97 s [Cabal-syntax] Warning: Distribution.Types.TestSuite.Lens: could not find link destinations for:
  1733. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1734. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1735. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Library: could not find link destinations for:
  1736. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1737. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1738. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Library.Lens: could not find link destinations for:
  1739. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1740. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1741. 149.97 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib: could not find link destinations for:
  1742. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1743. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1744. 149.97 s [Cabal-syntax] Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
  1745. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1746. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1747. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Executable: could not find link destinations for:
  1748. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1749. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1750. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
  1751. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1752. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1753. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Benchmark: could not find link destinations for:
  1754. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1755. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1756. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Component: could not find link destinations for:
  1757. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1758. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1759. 149.97 s [Cabal-syntax] Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
  1760. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1761. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1762. 149.97 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription: could not find link destinations for:
  1763. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1764. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1765. 149.97 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
  1766. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1767. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1768. 149.97 s [Cabal-syntax] Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
  1769. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1770. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1771. 149.97 s [Cabal-syntax] Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
  1772. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1773. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1774. 149.97 s [Cabal-syntax] Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
  1775. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1776. 149.97 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1777. 150.00 s [Cabal-syntax] Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
  1778. 150.00 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
  1779. 150.00 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
  1780. 150.00 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
  1781. 150.00 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
  1782. 150.00 s [Cabal-syntax] - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
  1783. 150.01 s [Cabal-syntax] Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
  1784. 150.01 s [Cabal-syntax] - Distribution.Utils.Structured.Tagged
  1785. 150.01 s [Cabal-syntax] - Distribution.Utils.Structured.structureHash'
  1786. 162.12 s [Cabal-syntax] Documentation created: dist/doc/html/Cabal-syntax/,
  1787. 162.16 s [Cabal-syntax] dist/doc/html/Cabal-syntax/Cabal-syntax.txt
  1788. 162.20 s [Cabal-syntax] Phase: installPhase
  1789. 162.35 s [Cabal-syntax] Installing library in /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  1790. 166.44 s [Cabal-syntax] Phase: fixupPhase
  1791. 166.47 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0
  1792. 166.47 s [Cabal-syntax] shrinking /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSCabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4-ghc9.6.7.so
  1793. 166.59 s [Cabal-syntax] checking for references to /build/ in /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0...
  1794. 166.73 s [Cabal-syntax] patching script interpreter paths in /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0
  1795. 166.74 s [Cabal-syntax] stripping (with command strip and flags -S -p) in /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0/lib
  1796. 168.60 s [Cabal-syntax] shrinking RPATHs of ELF executables and libraries in /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc
  1797. 168.66 s [Cabal-syntax] checking for references to /build/ in /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc...
  1798. 168.75 s [Cabal-syntax] patching script interpreter paths in /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc
  1799. 169.37 s [Cabal-syntax:post-build] Uploading to cachix cache "sellout": /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0 /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc
  1800. 170.24 s [Cabal-syntax:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  1801. 170.24 s [Cabal-syntax:post-build]
  1802. 170.62 s [Cabal-syntax:post-build] Pushing /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc (40.87 MiB)
  1803. 170.69 s [Cabal-syntax:post-build] Pushing /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0 (179.52 MiB)
  1804. 174.95 s [Cabal-syntax:post-build]
  1805. 174.95 s [Cabal-syntax:post-build] All done.
  1806. 174.98 s [Cabal-syntax:post-build] Uploading to the NixCI cache: /nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0 /nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc
  1807. 175.03 s [Cabal-syntax:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1808. 175.28 s [Cabal-syntax:post-build] copying 2 paths...
  1809. 175.28 s [Cabal-syntax:post-build] copying path '/nix/store/7lbh7rrpwv167flzplcgix36ld89h4gy-Cabal-syntax-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
  1810. 180.13 s [Cabal-syntax:post-build] copying path '/nix/store/30s9998mayqzpcc78fxddml3f031dznc-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
  1811. 217.36 s [Cabal-syntax:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1812. 217.77 s [Cabal-syntax:post-build] copying 1 paths...
  1813. 217.81 s [Cabal-syntax:post-build] copying path '/nix/store/k4nabnxx5r7xy8xxhmd6s32qqkda4ra1-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1814. 218.02 s Progress: 1 of 22 built, 73 of 73 downloaded from cache
  1815. 218.05 s Building /nix/store/wr6wf00sww8639shsils9q6jvhj7amd5-Cabal-3.12.1.0.drv
  1816. 218.12 s [Cabal] Phase: setupCompilerEnvironmentPhase
  1817. 218.12 s [Cabal] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  1818. 218.23 s [Cabal] Phase: unpackPhase
  1819. 218.23 s [Cabal] unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
  1820. 218.24 s [Cabal] source root is Cabal-3.12.1.0
  1821. 218.25 s [Cabal] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
  1822. 218.26 s [Cabal] Phase: patchPhase
  1823. 218.26 s [Cabal] Phase: compileBuildDriverPhase
  1824. 218.27 s [Cabal] setupCompileFlags: -package-db=/build/tmp.scwzfcy4jf/setup-package.conf.d -threaded
  1825. 218.31 s [Cabal] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.scwzfcy4jf/Main.o )
  1826. 218.36 s [Cabal] [2 of 2] Linking Setup
  1827. 219.57 s [Cabal] Phase: updateAutotoolsGnuConfigScriptsPhase
  1828. 219.58 s [Cabal] Phase: configurePhase
  1829. 219.59 s [Cabal] configureFlags: --verbose --prefix=/nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.scwzfcy4jf/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 --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  1830. 219.60 s [Cabal] Using Parsec parser
  1831. 219.60 s [Cabal] Configuring Cabal-3.12.1.0...
  1832. 219.87 s [Cabal] Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
  1833. 219.87 s [Cabal] Dependency array >=0.4.0.1 && <0.6: using array-0.5.8.0
  1834. 219.87 s [Cabal] Dependency base >=4.11 && <5: using base-4.18.3.0
  1835. 219.87 s [Cabal] Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.11.5.4
  1836. 219.87 s [Cabal] Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.7
  1837. 219.87 s [Cabal] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  1838. 219.87 s [Cabal] Dependency directory >=1.2 && <1.4: using directory-1.3.8.5
  1839. 219.87 s [Cabal] Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.301.0
  1840. 219.87 s [Cabal] Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
  1841. 219.87 s [Cabal] Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.16.1
  1842. 219.87 s [Cabal] Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
  1843. 219.87 s [Cabal] Dependency process >=1.2.1.0 && <1.7: using process-1.6.19.0
  1844. 219.87 s [Cabal] Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
  1845. 219.87 s [Cabal] Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
  1846. 219.87 s [Cabal] transformers-0.6.1.0
  1847. 219.87 s [Cabal] Dependency unix >=2.6.0.0 && <2.9: using unix-2.8.6.0
  1848. 220.16 s [Cabal] Source component graph: component lib
  1849. 220.16 s [Cabal] Configured component graph:
  1850. 220.16 s [Cabal] component Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  1851. 220.16 s [Cabal] include Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  1852. 220.16 s [Cabal] include array-0.5.8.0
  1853. 220.16 s [Cabal] include base-4.18.3.0
  1854. 220.16 s [Cabal] include bytestring-0.11.5.4
  1855. 220.16 s [Cabal] include containers-0.6.7
  1856. 220.16 s [Cabal] include deepseq-1.4.8.1
  1857. 220.16 s [Cabal] include directory-1.3.8.5
  1858. 220.16 s [Cabal] include filepath-1.4.301.0
  1859. 220.16 s [Cabal] include mtl-2.3.1
  1860. 220.16 s [Cabal] include parsec-3.1.16.1
  1861. 220.16 s [Cabal] include pretty-1.1.3.6
  1862. 220.16 s [Cabal] include process-1.6.19.0
  1863. 220.16 s [Cabal] include time-1.12.2
  1864. 220.16 s [Cabal] include transformers-0.6.1.0
  1865. 220.16 s [Cabal] include unix-2.8.6.0
  1866. 220.16 s [Cabal] Linked component graph:
  1867. 220.16 s [Cabal] unit Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  1868. 220.16 s [Cabal] include Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  1869. 220.16 s [Cabal] include array-0.5.8.0
  1870. 220.16 s [Cabal] include base-4.18.3.0
  1871. 220.16 s [Cabal] include bytestring-0.11.5.4
  1872. 220.16 s [Cabal] include containers-0.6.7
  1873. 220.16 s [Cabal] include deepseq-1.4.8.1
  1874. 220.16 s [Cabal] include directory-1.3.8.5
  1875. 220.16 s [Cabal] include filepath-1.4.301.0
  1876. 220.16 s [Cabal] include mtl-2.3.1
  1877. 220.16 s [Cabal] include parsec-3.1.16.1
  1878. 220.16 s [Cabal] include pretty-1.1.3.6
  1879. 220.16 s [Cabal] include process-1.6.19.0
  1880. 220.16 s [Cabal] include time-1.12.2
  1881. 220.16 s [Cabal] include transformers-0.6.1.0
  1882. 220.16 s [Cabal] include unix-2.8.6.0
  1883. 220.17 s [Cabal] Distribution.Backpack=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.License,Distribution.Make=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4:Language.Haskell.Extension
  1884. 220.17 s [Cabal] Ready component graph:
  1885. 220.17 s [Cabal] definite Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  1886. 220.17 s [Cabal] depends Cabal-syntax-3.12.1.0-AEdxRnBwqyZ4WFEtK3hoa4
  1887. 220.17 s [Cabal] depends array-0.5.8.0
  1888. 220.17 s [Cabal] depends base-4.18.3.0
  1889. 220.17 s [Cabal] depends bytestring-0.11.5.4
  1890. 220.17 s [Cabal] depends containers-0.6.7
  1891. 220.17 s [Cabal] depends deepseq-1.4.8.1
  1892. 220.17 s [Cabal] depends directory-1.3.8.5
  1893. 220.17 s [Cabal] depends filepath-1.4.301.0
  1894. 220.17 s [Cabal] depends mtl-2.3.1
  1895. 220.17 s [Cabal] depends parsec-3.1.16.1
  1896. 220.17 s [Cabal] depends pretty-1.1.3.6
  1897. 220.17 s [Cabal] depends process-1.6.19.0
  1898. 220.17 s [Cabal] depends time-1.12.2
  1899. 220.17 s [Cabal] depends transformers-0.6.1.0
  1900. 220.17 s [Cabal] depends unix-2.8.6.0
  1901. 220.17 s [Cabal] Using Cabal-3.10.3.0 compiled by ghc-9.6
  1902. 220.17 s [Cabal] Using compiler: ghc-9.6.7
  1903. 220.17 s [Cabal] Using install prefix:
  1904. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0
  1905. 220.17 s [Cabal] Executables installed in:
  1906. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/bin
  1907. 220.17 s [Cabal] Libraries installed in:
  1908. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  1909. 220.17 s [Cabal] Dynamic Libraries installed in:
  1910. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  1911. 220.17 s [Cabal] Private executables installed in:
  1912. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.6.7/Cabal-3.12.1.0
  1913. 220.17 s [Cabal] Data files installed in:
  1914. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.6.7/Cabal-3.12.1.0
  1915. 220.17 s [Cabal] Documentation installed in:
  1916. 220.17 s [Cabal] /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
  1917. 220.17 s [Cabal] Configuration files installed in:
  1918. 220.17 s [Cabal] /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/etc
  1919. 220.17 s [Cabal] No alex found
  1920. 220.17 s [Cabal] Using ar found on system at:
  1921. 220.17 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1922. 220.17 s [Cabal] No c2hs found
  1923. 220.17 s [Cabal] No cpphs found
  1924. 220.17 s [Cabal] No doctest found
  1925. 220.17 s [Cabal] Using gcc version 14.3.0 given by user at:
  1926. 220.17 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1927. 220.17 s [Cabal] Using ghc version 9.6.7 found on system at:
  1928. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  1929. 220.17 s [Cabal] Using ghc-pkg version 9.6.7 found on system at:
  1930. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  1931. 220.17 s [Cabal] No ghcjs found
  1932. 220.17 s [Cabal] No ghcjs-pkg found
  1933. 220.17 s [Cabal] No greencard found
  1934. 220.17 s [Cabal] Using haddock version 2.29.2 found on system at:
  1935. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  1936. 220.17 s [Cabal] No happy found
  1937. 220.17 s [Cabal] Using haskell-suite found on system at: haskell-suite-dummy-location
  1938. 220.17 s [Cabal] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1939. 220.17 s [Cabal] No hmake found
  1940. 220.17 s [Cabal] Using hpc version 0.68 found on system at:
  1941. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  1942. 220.17 s [Cabal] Using hsc2hs version 0.68.9 found on system at:
  1943. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  1944. 220.17 s [Cabal] Using hscolour version 1.25 found on system at:
  1945. 220.17 s [Cabal] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  1946. 220.17 s [Cabal] No jhc found
  1947. 220.17 s [Cabal] Using ld found on system at:
  1948. 220.17 s [Cabal] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  1949. 220.17 s [Cabal] No pkg-config found
  1950. 220.17 s [Cabal] Using runghc version 9.6.7 found on system at:
  1951. 220.17 s [Cabal] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  1952. 220.17 s [Cabal] Using strip version 2.44 found on system at:
  1953. 220.17 s [Cabal] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1954. 220.17 s [Cabal] Using tar found on system at:
  1955. 220.17 s [Cabal] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1956. 220.17 s [Cabal] No uhc found
  1957. 220.32 s [Cabal] Phase: buildPhase
  1958. 220.36 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  1959. 220.38 s [Cabal] Building library for Cabal-3.12.1.0..
  1960. 221.26 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.o, dist/build/Distribution/Backpack/FullUnitId.dyn_o )
  1961. 221.93 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.o, dist/build/Distribution/Backpack/ModSubst.dyn_o )
  1962. 221.94 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.o, dist/build/Distribution/Backpack/ModuleScope.dyn_o )
  1963. 222.17 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.o, dist/build/Distribution/Backpack/ModuleShape.dyn_o )
  1964. 222.34 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.o, dist/build/Distribution/Backpack/PreModuleShape.dyn_o )
  1965. 222.55 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.o, dist/build/Distribution/Compat/Async.dyn_o )
  1966. 222.55 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.o, dist/build/Distribution/Compat/CreatePipe.dyn_o )
  1967. 222.55 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.o, dist/build/Distribution/Compat/Directory.dyn_o )
  1968. 222.55 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.o, dist/build/Distribution/Compat/FilePath.dyn_o )
  1969. 222.55 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.o, dist/build/Distribution/Compat/GetShortPathName.dyn_o )
  1970. 222.55 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.o, dist/build/Distribution/Compat/Internal/TempFile.dyn_o )
  1971. 222.55 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o, dist/build/Distribution/Compat/CopyFile.dyn_o )
  1972. 222.55 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.o, dist/build/Distribution/Compat/Prelude/Internal.dyn_o )
  1973. 222.55 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.o, dist/build/Distribution/Compat/Process.dyn_o )
  1974. 222.55 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.o, dist/build/Distribution/Compat/ResponseFile.dyn_o )
  1975. 222.55 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.o, dist/build/Distribution/Compat/SnocList.dyn_o )
  1976. 222.55 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.o, dist/build/Distribution/Compat/Stack.dyn_o )
  1977. 222.55 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.o, dist/build/Distribution/Compat/Environment.dyn_o )
  1978. 222.55 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
  1979. 222.55 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
  1980. 222.55 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.o, dist/build/Distribution/PackageDescription/Check/Warning.dyn_o )
  1981. 224.84 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
  1982. 224.95 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.o, dist/build/Distribution/Simple/BuildToolDepends.dyn_o )
  1983. 224.95 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.o, dist/build/Distribution/Simple/CCompiler.dyn_o )
  1984. 224.95 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.o, dist/build/Distribution/Simple/Flag.dyn_o )
  1985. 224.95 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.o, dist/build/Distribution/Simple/InstallDirs/Internal.dyn_o )
  1986. 224.95 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o, dist/build/Distribution/Simple/InstallDirs.dyn_o )
  1987. 224.95 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.o, dist/build/Distribution/Simple/Program/Internal.dyn_o )
  1988. 224.95 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
  1989. 224.95 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.o, dist/build/Distribution/Types/AnnotatedId.dyn_o )
  1990. 224.95 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.o, dist/build/Distribution/Backpack/PreExistingComponent.dyn_o )
  1991. 224.95 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.o, dist/build/Distribution/Types/ComponentInclude.dyn_o )
  1992. 224.95 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.o, dist/build/Distribution/Types/ComponentLocalBuildInfo.dyn_o )
  1993. 224.95 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.o, dist/build/Distribution/Types/DumpBuildInfo.dyn_o )
  1994. 224.95 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.o, dist/build/Distribution/Types/GivenComponent.dyn_o )
  1995. 224.95 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.o, dist/build/Distribution/Types/PackageName/Magic.dyn_o )
  1996. 224.95 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.o, dist/build/Distribution/Types/ParStrat.dyn_o )
  1997. 224.95 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.o, dist/build/Distribution/Types/TargetInfo.dyn_o )
  1998. 224.95 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.o, dist/build/Distribution/Utils/IOData.dyn_o )
  1999. 224.95 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.o, dist/build/Distribution/Utils/Json.dyn_o )
  2000. 224.95 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.o, dist/build/Distribution/Utils/MapAccum.dyn_o )
  2001. 224.95 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.o, dist/build/Distribution/Utils/Progress.dyn_o )
  2002. 224.95 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.o, dist/build/Distribution/Utils/UnionFind.dyn_o )
  2003. 224.95 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.o, dist/build/Distribution/Verbosity/Internal.dyn_o )
  2004. 224.95 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
  2005. 224.95 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o, dist/build/Distribution/Simple/Program/Types.dyn_o )
  2006. 224.95 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.o, dist/build/Distribution/Simple/PreProcess/Types.dyn_o )
  2007. 224.95 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.o, dist/build/Distribution/Simple/Errors.dyn_o )
  2008. 225.33 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o, dist/build/Distribution/Simple/PreProcess/Unlit.dyn_o )
  2009. 225.46 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.o, dist/build/Distribution/Backpack/UnifyM.dyn_o )
  2010. 225.46 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.o, dist/build/Distribution/Backpack/MixLink.dyn_o )
  2011. 225.46 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
  2012. 225.46 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.o, dist/build/Distribution/Simple/Build/PathsModule/Z.dyn_o )
  2013. 225.46 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.o, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.dyn_o )
  2014. 225.46 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.o, dist/build/Distribution/Simple/Build/Macros/Z.dyn_o )
  2015. 225.46 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o, dist/build/Paths_Cabal.dyn_o )
  2016. 225.46 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o, dist/build/Distribution/Simple/Utils.dyn_o )
  2017. 226.51 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.o, dist/build/Distribution/Utils/NubList.dyn_o )
  2018. 226.81 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.o, dist/build/Distribution/Utils/LogProgress.dyn_o )
  2019. 226.81 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o, dist/build/Distribution/Simple/Program/Run.dyn_o )
  2020. 226.85 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o, dist/build/Distribution/Simple/Program/Script.dyn_o )
  2021. 226.97 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.o, dist/build/Distribution/Simple/Program/ResponseFile.dyn_o )
  2022. 226.97 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o, dist/build/Distribution/Simple/Program/Hpc.dyn_o )
  2023. 226.97 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.o, dist/build/Distribution/Simple/Program/Find.dyn_o )
  2024. 226.97 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o, dist/build/Distribution/Simple/PackageIndex.dyn_o )
  2025. 228.51 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.o, dist/build/Distribution/Simple/PackageDescription.dyn_o )
  2026. 228.51 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.o, dist/build/Distribution/Simple/Glob/Internal.dyn_o )
  2027. 228.51 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.o, dist/build/Distribution/Simple/Glob.dyn_o )
  2028. 228.51 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.o, dist/build/Distribution/PackageDescription/Check/Monad.dyn_o )
  2029. 228.51 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.o, dist/build/Distribution/PackageDescription/Check/Conditional.dyn_o )
  2030. 228.51 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.o, dist/build/Distribution/PackageDescription/Check/Common.dyn_o )
  2031. 228.51 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o, dist/build/Distribution/Simple/Compiler.dyn_o )
  2032. 228.51 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o, dist/build/Distribution/Simple/Program/HcPkg.dyn_o )
  2033. 228.58 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.o, dist/build/Distribution/Simple/GHC/ImplInfo.dyn_o )
  2034. 228.58 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o, dist/build/Distribution/Simple/Program/GHC.dyn_o )
  2035. 230.07 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o, dist/build/Distribution/Simple/Program/Builtin.dyn_o )
  2036. 230.22 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o, dist/build/Distribution/Simple/Program/Db.dyn_o )
  2037. 230.57 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o, dist/build/Distribution/Simple/Program.dyn_o )
  2038. 230.62 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.o, dist/build/Distribution/Simple/Program/Strip.dyn_o )
  2039. 230.67 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o, dist/build/Distribution/Simple/Command.dyn_o )
  2040. 230.67 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.o, dist/build/Distribution/Simple/Setup/Common.dyn_o )
  2041. 230.80 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.o, dist/build/Distribution/Simple/Setup/Test.dyn_o )
  2042. 231.82 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.o, dist/build/Distribution/Simple/Setup/SDist.dyn_o )
  2043. 231.82 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.o, dist/build/Distribution/Simple/Setup/Repl.dyn_o )
  2044. 231.82 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.o, dist/build/Distribution/Simple/Setup/Register.dyn_o )
  2045. 231.82 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.o, dist/build/Distribution/Simple/Setup/Install.dyn_o )
  2046. 231.82 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.o, dist/build/Distribution/Simple/Setup/Hscolour.dyn_o )
  2047. 231.82 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.o, dist/build/Distribution/Simple/Setup/Haddock.dyn_o )
  2048. 232.39 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.o, dist/build/Distribution/Simple/Setup/Global.dyn_o )
  2049. 232.39 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.o, dist/build/Distribution/Simple/Setup/Copy.dyn_o )
  2050. 232.39 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.o, dist/build/Distribution/Simple/Setup/Config.dyn_o )
  2051. 234.64 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.o, dist/build/Distribution/Types/LocalBuildConfig.dyn_o )
  2052. 235.81 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.o, dist/build/Distribution/Types/LocalBuildInfo.dyn_o )
  2053. 236.32 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o, dist/build/Distribution/Simple/LocalBuildInfo.dyn_o )
  2054. 236.57 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.o, dist/build/Distribution/Simple/Test/Log.dyn_o )
  2055. 237.14 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o, dist/build/Distribution/Simple/Hpc.dyn_o )
  2056. 237.14 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.o, dist/build/Distribution/Simple/Build/PackageInfoModule.dyn_o )
  2057. 237.14 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o, dist/build/Distribution/Simple/Build/Macros.dyn_o )
  2058. 237.14 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.o, dist/build/Distribution/Backpack/Id.dyn_o )
  2059. 237.14 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.o, dist/build/Distribution/Backpack/ConfiguredComponent.dyn_o )
  2060. 237.61 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.o, dist/build/Distribution/Backpack/LinkedComponent.dyn_o )
  2061. 238.59 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.o, dist/build/Distribution/Backpack/ComponentsGraph.dyn_o )
  2062. 238.59 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o, dist/build/Distribution/Simple/Program/Ld.dyn_o )
  2063. 238.59 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o, dist/build/Distribution/Simple/Program/Ar.dyn_o )
  2064. 238.59 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.o, dist/build/Distribution/Simple/ConfigureScript.dyn_o )
  2065. 238.59 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.o, dist/build/Distribution/Simple/Setup/Clean.dyn_o )
  2066. 238.60 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.o, dist/build/Distribution/Simple/Setup/Build.dyn_o )
  2067. 238.60 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.o, dist/build/Distribution/Simple/Setup/Benchmark.dyn_o )
  2068. 238.60 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o, dist/build/Distribution/Simple/Setup.dyn_o )
  2069. 238.60 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.o, dist/build/Distribution/Simple/Build/Inputs.dyn_o )
  2070. 238.60 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.o, dist/build/Distribution/Simple/BuildTarget.dyn_o )
  2071. 238.88 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o, dist/build/Distribution/Simple/BuildPaths.dyn_o )
  2072. 238.88 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o, dist/build/Distribution/Simple/UHC.dyn_o )
  2073. 238.88 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.o, dist/build/Distribution/Simple/HaskellSuite.dyn_o )
  2074. 238.88 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.o, dist/build/Distribution/Simple/GHC/Internal.dyn_o )
  2075. 238.88 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.o, dist/build/Distribution/Simple/GHC/EnvironmentParser.dyn_o )
  2076. 238.88 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.o, dist/build/Distribution/Simple/GHCJS.dyn_o )
  2077. 241.18 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.o, dist/build/Distribution/Simple/GHC/Build/Utils.dyn_o )
  2078. 241.22 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.o, dist/build/Distribution/Simple/GHC/Build/Modules.dyn_o )
  2079. 241.22 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.o, dist/build/Distribution/Simple/GHC/Build/ExtraSources.dyn_o )
  2080. 241.22 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.o, dist/build/Distribution/Simple/GHC/Build/Link.dyn_o )
  2081. 241.22 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.o, dist/build/Distribution/Simple/GHC/Build.dyn_o )
  2082. 241.22 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o, dist/build/Distribution/Simple/GHC.dyn_o )
  2083. 241.43 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.o, dist/build/Distribution/Simple/ShowBuildInfo.dyn_o )
  2084. 241.63 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o, dist/build/Distribution/Simple/Install.dyn_o )
  2085. 241.85 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o, dist/build/Distribution/Simple/Build/PathsModule.dyn_o )
  2086. 241.85 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.o, dist/build/Distribution/Simple/Test/LibV09.dyn_o )
  2087. 241.85 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.o, dist/build/Distribution/Simple/Test/ExeV10.dyn_o )
  2088. 241.85 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.o, dist/build/Distribution/PackageDescription/Check/Paths.dyn_o )
  2089. 241.85 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.o, dist/build/Distribution/PackageDescription/Check/Target.dyn_o )
  2090. 241.85 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o, dist/build/Distribution/PackageDescription/Check.dyn_o )
  2091. 242.43 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
  2092. 242.43 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.o, dist/build/Distribution/Compat/Time.dyn_o )
  2093. 242.43 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.o, dist/build/Distribution/Backpack/ReadyComponent.dyn_o )
  2094. 242.43 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.o, dist/build/Distribution/Backpack/Configure.dyn_o )
  2095. 242.43 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.o, dist/build/Distribution/Backpack/DescribeUnitId.dyn_o )
  2096. 242.43 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o, dist/build/Distribution/Simple/Register.dyn_o )
  2097. 242.43 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o, dist/build/Distribution/Simple/PreProcess.dyn_o )
  2098. 242.43 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o, dist/build/Distribution/Simple/UserHooks.dyn_o )
  2099. 242.43 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o, dist/build/Distribution/Simple/Bench.dyn_o )
  2100. 242.43 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o, dist/build/Distribution/Simple/Configure.dyn_o )
  2101. 245.90 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o, dist/build/Distribution/Simple/Test.dyn_o )
  2102. 246.32 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o, dist/build/Distribution/Simple/SrcDist.dyn_o )
  2103. 246.89 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o, dist/build/Distribution/Simple/Build.dyn_o )
  2104. 247.65 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o, dist/build/Distribution/Simple/Haddock.dyn_o )
  2105. 250.09 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
  2106. 253.16 s [Cabal] [ 1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
  2107. 255.20 s [Cabal] [ 2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
  2108. 255.20 s [Cabal] [ 3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
  2109. 255.20 s [Cabal] [ 4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
  2110. 255.91 s [Cabal] [ 5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
  2111. 256.33 s [Cabal] [ 6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
  2112. 256.33 s [Cabal] [ 7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
  2113. 256.33 s [Cabal] [ 8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
  2114. 256.33 s [Cabal] [ 9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
  2115. 256.33 s [Cabal] [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
  2116. 256.33 s [Cabal] [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
  2117. 256.33 s [Cabal] [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
  2118. 256.33 s [Cabal] [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
  2119. 256.33 s [Cabal] [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
  2120. 256.33 s [Cabal] [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
  2121. 256.33 s [Cabal] [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
  2122. 256.33 s [Cabal] [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
  2123. 256.33 s [Cabal] [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
  2124. 256.33 s [Cabal] [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
  2125. 256.33 s [Cabal] [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
  2126. 256.33 s [Cabal] [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
  2127. 259.54 s [Cabal] [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
  2128. 259.54 s [Cabal] [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
  2129. 259.58 s [Cabal] [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
  2130. 259.58 s [Cabal] [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
  2131. 259.58 s [Cabal] [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
  2132. 259.58 s [Cabal] [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
  2133. 259.58 s [Cabal] [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
  2134. 259.58 s [Cabal] [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
  2135. 259.58 s [Cabal] [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
  2136. 259.58 s [Cabal] [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
  2137. 259.58 s [Cabal] [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
  2138. 259.58 s [Cabal] [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
  2139. 259.58 s [Cabal] [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
  2140. 259.58 s [Cabal] [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
  2141. 259.58 s [Cabal] [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
  2142. 259.58 s [Cabal] [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
  2143. 259.58 s [Cabal] [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
  2144. 259.58 s [Cabal] [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
  2145. 259.58 s [Cabal] [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
  2146. 259.58 s [Cabal] [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
  2147. 259.58 s [Cabal] [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
  2148. 259.58 s [Cabal] [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
  2149. 259.58 s [Cabal] [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
  2150. 259.58 s [Cabal] [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
  2151. 259.58 s [Cabal] [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
  2152. 259.58 s [Cabal] [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
  2153. 259.58 s [Cabal] [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
  2154. 260.79 s [Cabal] [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
  2155. 261.05 s [Cabal] [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
  2156. 261.05 s [Cabal] [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
  2157. 261.05 s [Cabal] [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
  2158. 261.05 s [Cabal] [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
  2159. 261.05 s [Cabal] [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
  2160. 261.05 s [Cabal] [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
  2161. 261.05 s [Cabal] [ 56 of 146] Compiling Paths_Cabal ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
  2162. 261.05 s [Cabal] [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
  2163. 262.35 s [Cabal] [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
  2164. 263.52 s [Cabal] [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
  2165. 263.52 s [Cabal] [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
  2166. 263.52 s [Cabal] [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
  2167. 263.99 s [Cabal] [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
  2168. 263.99 s [Cabal] [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
  2169. 263.99 s [Cabal] [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
  2170. 263.99 s [Cabal] [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
  2171. 266.19 s [Cabal] [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
  2172. 266.24 s [Cabal] [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
  2173. 266.24 s [Cabal] [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
  2174. 266.24 s [Cabal] [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
  2175. 266.24 s [Cabal] [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
  2176. 266.78 s [Cabal] [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
  2177. 266.78 s [Cabal] [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
  2178. 266.78 s [Cabal] [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
  2179. 267.37 s [Cabal] [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
  2180. 267.37 s [Cabal] [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
  2181. 269.50 s [Cabal] [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
  2182. 269.77 s [Cabal] [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
  2183. 270.21 s [Cabal] [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
  2184. 270.35 s [Cabal] [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
  2185. 270.50 s [Cabal] [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
  2186. 270.50 s [Cabal] [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
  2187. 270.65 s [Cabal] [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
  2188. 271.90 s [Cabal] [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
  2189. 271.94 s [Cabal] [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
  2190. 271.94 s [Cabal] [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
  2191. 271.94 s [Cabal] [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
  2192. 271.94 s [Cabal] [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
  2193. 271.94 s [Cabal] [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
  2194. 272.73 s [Cabal] [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
  2195. 272.73 s [Cabal] [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
  2196. 272.73 s [Cabal] [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
  2197. 275.06 s [Cabal] [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
  2198. 277.17 s [Cabal] [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
  2199. 277.99 s [Cabal] [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
  2200. 278.45 s [Cabal] [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
  2201. 279.55 s [Cabal] [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
  2202. 279.55 s [Cabal] [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
  2203. 279.55 s [Cabal] [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
  2204. 279.55 s [Cabal] [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
  2205. 279.55 s [Cabal] [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
  2206. 280.66 s [Cabal] [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
  2207. 281.96 s [Cabal] [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
  2208. 281.96 s [Cabal] [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
  2209. 281.96 s [Cabal] [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
  2210. 281.96 s [Cabal] [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
  2211. 281.96 s [Cabal] [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
  2212. 281.96 s [Cabal] [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
  2213. 281.96 s [Cabal] [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
  2214. 281.96 s [Cabal] [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
  2215. 281.96 s [Cabal] [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
  2216. 281.96 s [Cabal] [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
  2217. 281.96 s [Cabal] [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
  2218. 281.96 s [Cabal] [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
  2219. 281.96 s [Cabal] [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
  2220. 281.96 s [Cabal] [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
  2221. 281.96 s [Cabal] [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
  2222. 282.26 s [Cabal] [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
  2223. 286.89 s [Cabal] [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.p_o )
  2224. 286.93 s [Cabal] [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.p_o )
  2225. 286.93 s [Cabal] [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.p_o )
  2226. 286.93 s [Cabal] [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.p_o )
  2227. 286.93 s [Cabal] [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
  2228. 286.93 s [Cabal] [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
  2229. 287.07 s [Cabal] [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
  2230. 287.53 s [Cabal] [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
  2231. 287.73 s [Cabal] [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
  2232. 287.73 s [Cabal] [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
  2233. 287.73 s [Cabal] [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
  2234. 287.73 s [Cabal] [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
  2235. 287.73 s [Cabal] [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
  2236. 287.73 s [Cabal] [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
  2237. 287.73 s [Cabal] [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
  2238. 287.73 s [Cabal] [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
  2239. 287.73 s [Cabal] [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
  2240. 287.73 s [Cabal] [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
  2241. 287.73 s [Cabal] [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
  2242. 287.73 s [Cabal] [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
  2243. 288.26 s [Cabal] [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
  2244. 288.26 s [Cabal] [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
  2245. 288.26 s [Cabal] [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
  2246. 288.26 s [Cabal] [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
  2247. 290.97 s [Cabal] [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
  2248. 291.44 s [Cabal] [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
  2249. 291.91 s [Cabal] [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
  2250. 292.47 s [Cabal] [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
  2251. 294.68 s [Cabal] [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
  2252. 298.75 s [Cabal] buildPhase completed in 1 minutes 18 seconds
  2253. 298.79 s [Cabal] Phase: haddockPhase
  2254. 299.07 s [Cabal] Preprocessing library for Cabal-3.12.1.0..
  2255. 299.11 s [Cabal] Running Haddock on library for Cabal-3.12.1.0..
  2256. 299.24 s [Cabal] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  2257. 303.51 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.FullUnitId'
  2258. 303.51 s [Cabal] Missing documentation for:
  2259. 303.51 s [Cabal] Module header
  2260. 303.51 s [Cabal] FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
  2261. 303.51 s [Cabal] FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
  2262. 303.51 s [Cabal] expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:20)
  2263. 303.52 s [Cabal] expandUnitId (src/Distribution/Backpack/FullUnitId.hs:26)
  2264. 303.53 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  2265. 303.53 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2266. 303.53 s [Cabal] 100% ( 2 / 2) in 'Distribution.Backpack.ModSubst'
  2267. 303.57 s [Cabal] Warning: 'ModuleShape' is out of scope.
  2268. 303.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2269. 303.57 s [Cabal] Warning: 'Module' is out of scope.
  2270. 303.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2271. 303.69 s [Cabal] 80% ( 4 / 5) in 'Distribution.Backpack.ModuleShape'
  2272. 303.69 s [Cabal] Missing documentation for:
  2273. 303.69 s [Cabal] shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:76)
  2274. 303.72 s [Cabal] 0% ( 0 / 5) in 'Distribution.Backpack.PreModuleShape'
  2275. 303.72 s [Cabal] Missing documentation for:
  2276. 303.72 s [Cabal] Module header
  2277. 303.72 s [Cabal] PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
  2278. 303.72 s [Cabal] toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:28)
  2279. 303.72 s [Cabal] renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:31)
  2280. 303.72 s [Cabal] mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:40)
  2281. 303.76 s [Cabal] Warning: 'async' is out of scope.
  2282. 303.76 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2283. 303.80 s [Cabal] 50% ( 1 / 2) in 'Distribution.Compat.CreatePipe'
  2284. 303.80 s [Cabal] Missing documentation for:
  2285. 303.80 s [Cabal] Module header
  2286. 303.80 s [Cabal] 75% ( 3 / 4) in 'Distribution.Compat.Directory'
  2287. 303.80 s [Cabal] Missing documentation for:
  2288. 303.80 s [Cabal] Module header
  2289. 303.80 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.FilePath'
  2290. 303.80 s [Cabal] Missing documentation for:
  2291. 303.80 s [Cabal] Module header
  2292. 303.80 s [Cabal] Warning: 'GetShortPathName' is out of scope.
  2293. 303.80 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2294. 304.09 s [Cabal] 100% ( 2 / 2) in 'Distribution.Compat.Prelude.Internal'
  2295. 304.15 s [Cabal] Warning: 'delegate_ctlc' is out of scope.
  2296. 304.15 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2297. 304.15 s [Cabal] 80% ( 4 / 5) in 'Distribution.Compat.Process'
  2298. 304.15 s [Cabal] Missing documentation for:
  2299. 304.15 s [Cabal] Module header
  2300. 304.16 s [Cabal] 66% ( 2 / 3) in 'Distribution.Compat.ResponseFile'
  2301. 304.16 s [Cabal] Missing documentation for:
  2302. 304.16 s [Cabal] Module header
  2303. 304.20 s [Cabal] Warning: 'Verbosity' is out of scope.
  2304. 304.20 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2305. 304.20 s [Cabal] 66% ( 6 / 9) in 'Distribution.Compat.Stack'
  2306. 304.20 s [Cabal] Missing documentation for:
  2307. 304.20 s [Cabal] Module header
  2308. 304.20 s [Cabal] WithCallStack (src/Distribution/Compat/Stack.hs:31)
  2309. 304.20 s [Cabal] withLexicalCallStack (src/Distribution/Compat/Stack.hs:73)
  2310. 304.26 s [Cabal] Warning: 'ReturnInOrder' is out of scope.
  2311. 304.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2312. 304.89 s [Cabal] 50% ( 5 / 10) in 'Distribution.ReadE'
  2313. 304.89 s [Cabal] Missing documentation for:
  2314. 304.89 s [Cabal] succeedReadE (src/Distribution/ReadE.hs:46)
  2315. 304.89 s [Cabal] failReadE (src/Distribution/ReadE.hs:49)
  2316. 304.89 s [Cabal] parsecToReadE (src/Distribution/ReadE.hs:56)
  2317. 304.89 s [Cabal] parsecToReadEErr (src/Distribution/ReadE.hs:60)
  2318. 304.89 s [Cabal] unexpectMsgString (src/Distribution/ReadE.hs:66)
  2319. 304.93 s [Cabal] 100% ( 6 / 6) in 'Distribution.Simple.BuildToolDepends'
  2320. 304.95 s [Cabal] Warning: 'a' is out of scope.
  2321. 304.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2322. 304.95 s [Cabal] Warning: 'b' is out of scope.
  2323. 304.95 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2324. 304.95 s [Cabal] 100% ( 5 / 5) in 'Distribution.Simple.CCompiler'
  2325. 304.99 s [Cabal] 100% ( 12 / 12) in 'Distribution.Simple.Flag'
  2326. 305.29 s [Cabal] 0% ( 0 / 3) in 'Distribution.Simple.InstallDirs.Internal'
  2327. 305.29 s [Cabal] Missing documentation for:
  2328. 305.29 s [Cabal] Module header
  2329. 305.29 s [Cabal] PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
  2330. 305.29 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2331. 305.43 s [Cabal] 47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
  2332. 305.43 s [Cabal] Missing documentation for:
  2333. 305.43 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2334. 305.43 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2335. 305.43 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2336. 305.43 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2337. 305.43 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2338. 305.43 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2339. 305.43 s [Cabal] substPathTemplate (src/Distribution/Simple/InstallDirs.hs:413)
  2340. 305.43 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2341. 305.43 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2342. 305.43 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2343. 305.43 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2344. 305.43 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2345. 305.57 s [Cabal] Warning: 'strip' is out of scope.
  2346. 305.57 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2347. 305.57 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Internal'
  2348. 305.60 s [Cabal] 22% ( 2 / 9) in 'Distribution.TestSuite'
  2349. 305.60 s [Cabal] Missing documentation for:
  2350. 305.60 s [Cabal] TestInstance (src/Distribution/TestSuite.hs:30)
  2351. 305.60 s [Cabal] OptionDescr (src/Distribution/TestSuite.hs:49)
  2352. 305.60 s [Cabal] OptionType (src/Distribution/TestSuite.hs:59)
  2353. 305.60 s [Cabal] Test (src/Distribution/TestSuite.hs:78)
  2354. 305.60 s [Cabal] Options (src/Distribution/TestSuite.hs:94)
  2355. 305.60 s [Cabal] Progress (src/Distribution/TestSuite.hs:96)
  2356. 305.60 s [Cabal] Result (src/Distribution/TestSuite.hs:100)
  2357. 305.61 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.AnnotatedId'
  2358. 305.61 s [Cabal] Missing documentation for:
  2359. 305.61 s [Cabal] Module header
  2360. 305.63 s [Cabal] Warning: 'LinkedComponent' is out of scope.
  2361. 305.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2362. 305.63 s [Cabal] Warning: 'pc_pkgid' is out of scope.
  2363. 305.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2364. 305.65 s [Cabal] Warning: 'CSubLibName' is out of scope.
  2365. 305.65 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2366. 305.65 s [Cabal] 20% ( 1 / 5) in 'Distribution.Types.ComponentInclude'
  2367. 305.65 s [Cabal] Missing documentation for:
  2368. 305.65 s [Cabal] Module header
  2369. 305.65 s [Cabal] ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
  2370. 305.65 s [Cabal] ci_id (src/Distribution/Types/ComponentInclude.hs:24)
  2371. 305.65 s [Cabal] ci_pkgid (src/Distribution/Types/ComponentInclude.hs:27)
  2372. 305.74 s [Cabal] Warning: 'BuildInfo' is out of scope.
  2373. 305.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2374. 305.74 s [Cabal] 25% ( 1 / 4) in 'Distribution.Types.ComponentLocalBuildInfo'
  2375. 305.74 s [Cabal] Missing documentation for:
  2376. 305.74 s [Cabal] Module header
  2377. 305.74 s [Cabal] componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:121)
  2378. 305.75 s [Cabal] maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:125)
  2379. 305.78 s [Cabal] 0% ( 0 / 2) in 'Distribution.Types.DumpBuildInfo'
  2380. 305.78 s [Cabal] Missing documentation for:
  2381. 305.78 s [Cabal] Module header
  2382. 305.78 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2383. 305.80 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.GivenComponent'
  2384. 305.80 s [Cabal] Missing documentation for:
  2385. 305.80 s [Cabal] Module header
  2386. 305.81 s [Cabal] 100% ( 5 / 5) in 'Distribution.Types.PackageName.Magic'
  2387. 305.82 s [Cabal] 80% ( 4 / 5) in 'Distribution.Types.ParStrat'
  2388. 305.82 s [Cabal] Missing documentation for:
  2389. 305.82 s [Cabal] Module header
  2390. 305.85 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2391. 305.85 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2392. 305.85 s [Cabal] 50% ( 1 / 2) in 'Distribution.Types.TargetInfo'
  2393. 305.85 s [Cabal] Missing documentation for:
  2394. 305.85 s [Cabal] Module header
  2395. 305.87 s [Cabal] Warning: 'hClose' is out of scope.
  2396. 305.87 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2397. 305.87 s [Cabal] 100% ( 8 / 8) in 'Distribution.Utils.IOData'
  2398. 305.88 s [Cabal] Warning: 'ByteString' is out of scope.
  2399. 305.88 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2400. 305.88 s [Cabal] 75% ( 3 / 4) in 'Distribution.Utils.Json'
  2401. 305.88 s [Cabal] Missing documentation for:
  2402. 305.88 s [Cabal] Json (src/Distribution/Utils/Json.hs:20)
  2403. 305.90 s [Cabal] Warning: 'mapAccumL' is out of scope.
  2404. 305.90 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2405. 305.90 s [Cabal] 50% ( 1 / 2) in 'Distribution.Utils.MapAccum'
  2406. 305.90 s [Cabal] Missing documentation for:
  2407. 305.90 s [Cabal] Module header
  2408. 305.92 s [Cabal] 100% ( 5 / 5) in 'Distribution.Utils.Progress'
  2409. 305.96 s [Cabal] 0% ( 0 / 3) in 'Distribution.Verbosity.Internal'
  2410. 305.96 s [Cabal] Missing documentation for:
  2411. 305.96 s [Cabal] Module header
  2412. 305.96 s [Cabal] VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
  2413. 305.96 s [Cabal] VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
  2414. 306.01 s [Cabal] Warning: 'stderr' is out of scope.
  2415. 306.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2416. 306.01 s [Cabal] Warning: 'stdout' is out of scope.
  2417. 306.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2418. 306.02 s [Cabal] 87% ( 35 / 40) in 'Distribution.Verbosity'
  2419. 306.02 s [Cabal] Missing documentation for:
  2420. 306.02 s [Cabal] Verbosity (src/Distribution/Verbosity.hs:90)
  2421. 306.02 s [Cabal] flagToVerbosity (src/Distribution/Verbosity.hs:240)
  2422. 306.02 s [Cabal] showForCabal (src/Distribution/Verbosity.hs:243)
  2423. 306.02 s [Cabal] showForGHC (src/Distribution/Verbosity.hs:266)
  2424. 306.02 s [Cabal] verboseHasFlags (src/Distribution/Verbosity.hs:334)
  2425. 306.11 s [Cabal] Warning: 'simpleProgram' is out of scope.
  2426. 306.11 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2427. 306.12 s [Cabal] Warning: 'findProgramOnSearchPath' is out of scope.
  2428. 306.12 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2429. 306.12 s [Cabal] Warning: 'findExecutable' is out of scope.
  2430. 306.12 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2431. 306.12 s [Cabal] 83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
  2432. 306.12 s [Cabal] Missing documentation for:
  2433. 306.12 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2434. 306.12 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2435. 306.16 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.PreProcess.Types'
  2436. 306.16 s [Cabal] Missing documentation for:
  2437. 306.17 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  2438. 306.17 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  2439. 306.23 s [Cabal] 0% ( 0 / 5) in 'Distribution.Simple.Errors'
  2440. 306.23 s [Cabal] Missing documentation for:
  2441. 306.23 s [Cabal] Module header
  2442. 306.23 s [Cabal] CabalException (src/Distribution/Simple/Errors.hs:46)
  2443. 306.23 s [Cabal] FailedDependency (src/Distribution/Simple/Errors.hs:39)
  2444. 306.23 s [Cabal] exceptionCode (src/Distribution/Simple/Errors.hs:178)
  2445. 306.23 s [Cabal] exceptionMessage (src/Distribution/Simple/Errors.hs:314)
  2446. 306.54 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.PreProcess.Unlit'
  2447. 306.62 s [Cabal] Warning: 'UnitIdU' is ambiguous. It is defined
  2448. 306.62 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:261:5
  2449. 306.62 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:268:1
  2450. 306.62 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2451. 306.62 s [Cabal] by specifying the type/value namespace explicitly.
  2452. 306.62 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:260:1
  2453. 306.63 s [Cabal] Warning: 'ModuleU' is ambiguous. It is defined
  2454. 306.63 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:256:5
  2455. 306.63 s [Cabal] * at src/Distribution/Backpack/UnifyM.hs:265:1
  2456. 306.63 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2457. 306.63 s [Cabal] by specifying the type/value namespace explicitly.
  2458. 306.63 s [Cabal] Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:255:1
  2459. 306.63 s [Cabal] Warning: 'ModuleSubst' is out of scope.
  2460. 306.63 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2461. 307.08 s [Cabal] Warning: 'die' is out of scope.
  2462. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2463. 307.08 s [Cabal] Warning: 'rawSystem' is out of scope.
  2464. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2465. 307.08 s [Cabal] Warning: 'action' is out of scope.
  2466. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2467. 307.08 s [Cabal] Warning: 'CreatePipe' is out of scope.
  2468. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2469. 307.08 s [Cabal] Warning: 'waitForProcess' is out of scope.
  2470. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2471. 307.08 s [Cabal] Warning: 'findModuleFile' is out of scope.
  2472. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2473. 307.08 s [Cabal] Warning: 'createDirectoryIfMissing' is out of scope.
  2474. 307.08 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2475. 307.09 s [Cabal] Warning: 'ByteString' is out of scope.
  2476. 307.09 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2477. 307.09 s [Cabal] 85% (122 /142) in 'Distribution.Simple.Utils'
  2478. 307.09 s [Cabal] Missing documentation for:
  2479. 307.09 s [Cabal] cabalVersion (src/Distribution/Simple/Utils.hs:283)
  2480. 307.09 s [Cabal] dieNoVerbosity (src/Distribution/Simple/Utils.hs:345)
  2481. 307.09 s [Cabal] die' (src/Distribution/Simple/Utils.hs:375)
  2482. 307.09 s [Cabal] dieWithException (src/Distribution/Simple/Utils.hs:388)
  2483. 307.09 s [Cabal] dieWithLocation' (src/Distribution/Simple/Utils.hs:364)
  2484. 307.09 s [Cabal] dieNoWrap (src/Distribution/Simple/Utils.hs:407)
  2485. 307.09 s [Cabal] topHandler (src/Distribution/Simple/Utils.hs:514)
  2486. 307.09 s [Cabal] topHandlerWith (src/Distribution/Simple/Utils.hs:463)
  2487. 307.09 s [Cabal] infoNoWrap (src/Distribution/Simple/Utils.hs:602)
  2488. 307.09 s [Cabal] VerboseException (src/Distribution/Simple/Utils.hs:384)
  2489. 307.09 s [Cabal] setFileOrdinary (src/Distribution/Compat/CopyFile.hs:73)
  2490. 307.09 s [Cabal] setFileExecutable (src/Distribution/Compat/CopyFile.hs:73)
  2491. 307.09 s [Cabal] shortRelativePath (src/Distribution/Simple/Utils.hs:1746)
  2492. 307.09 s [Cabal] findFirstFile (src/Distribution/Simple/Utils.hs:1300)
  2493. 307.09 s [Cabal] findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1272)
  2494. 307.09 s [Cabal] addLibraryPath (src/Distribution/Simple/Utils.hs:1392)
  2495. 307.09 s [Cabal] defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1637)
  2496. 307.09 s [Cabal] createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:123)
  2497. 307.09 s [Cabal] equating
  2498. 307.09 s [Cabal] unintersperse
  2499. 307.31 s [Cabal] 66% ( 6 / 9) in 'Distribution.Utils.NubList'
  2500. 307.31 s [Cabal] Missing documentation for:
  2501. 307.31 s [Cabal] Module header
  2502. 307.31 s [Cabal] fromNubList (src/Distribution/Utils/NubList.hs:24)
  2503. 307.31 s [Cabal] fromNubListR (src/Distribution/Utils/NubList.hs:83)
  2504. 307.33 s [Cabal] Warning: 'die' is out of scope.
  2505. 307.33 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2506. 307.33 s [Cabal] 85% ( 6 / 7) in 'Distribution.Utils.LogProgress'
  2507. 307.33 s [Cabal] Missing documentation for:
  2508. 307.33 s [Cabal] Module header
  2509. 307.36 s [Cabal] 30% ( 4 / 13) in 'Distribution.Simple.Program.Run'
  2510. 307.36 s [Cabal] Missing documentation for:
  2511. 307.36 s [Cabal] IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
  2512. 307.36 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2513. 307.36 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2514. 307.36 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2515. 307.36 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2516. 307.36 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2517. 307.36 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2518. 307.36 s [Cabal] getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:173)
  2519. 307.36 s [Cabal] getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:185)
  2520. 307.39 s [Cabal] 100% ( 4 / 4) in 'Distribution.Simple.Program.Script'
  2521. 307.41 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Program.ResponseFile'
  2522. 307.41 s [Cabal] Missing documentation for:
  2523. 307.41 s [Cabal] withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:24)
  2524. 307.42 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Program.Hpc'
  2525. 307.42 s [Cabal] Missing documentation for:
  2526. 307.42 s [Cabal] union (src/Distribution/Simple/Program/Hpc.hs:105)
  2527. 307.44 s [Cabal] 63% ( 7 / 11) in 'Distribution.Simple.Program.Find'
  2528. 307.44 s [Cabal] Missing documentation for:
  2529. 307.44 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2530. 307.44 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2531. 307.44 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2532. 307.44 s [Cabal] logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:68)
  2533. 307.51 s [Cabal] Warning: 'UnitIndex' is out of scope.
  2534. 307.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2535. 307.51 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2536. 307.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2537. 307.51 s [Cabal] Warning: 'Cabal' is out of scope.
  2538. 307.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2539. 307.51 s [Cabal] Warning: 'PackageDB' is out of scope.
  2540. 307.51 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2541. 307.52 s [Cabal] 92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
  2542. 307.52 s [Cabal] Missing documentation for:
  2543. 307.52 s [Cabal] SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
  2544. 307.52 s [Cabal] topologicalOrder (src/Distribution/Simple/PackageIndex.hs:666)
  2545. 307.52 s [Cabal] reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:674)
  2546. 307.80 s [Cabal] 50% ( 3 / 6) in 'Distribution.Simple.PackageDescription'
  2547. 307.80 s [Cabal] Missing documentation for:
  2548. 307.80 s [Cabal] readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:44)
  2549. 307.80 s [Cabal] readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:47)
  2550. 307.80 s [Cabal] parseString (src/Distribution/Simple/PackageDescription.hs:72)
  2551. 307.86 s [Cabal] Warning: 'matchDirFileGlob' is out of scope.
  2552. 307.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2553. 307.86 s [Cabal] Warning: 'Version' is out of scope.
  2554. 307.86 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2555. 307.86 s [Cabal] 68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
  2556. 307.86 s [Cabal] Missing documentation for:
  2557. 307.86 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2558. 307.86 s [Cabal] enableMultidot (src/Distribution/Simple/Glob/Internal.hs:177)
  2559. 307.86 s [Cabal] dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:233)
  2560. 307.86 s [Cabal] isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:251)
  2561. 307.86 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2562. 307.86 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2563. 307.86 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2564. 307.96 s [Cabal] Warning: 'die'' is out of scope.
  2565. 307.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2566. 307.96 s [Cabal] Warning: 'Version' is out of scope.
  2567. 307.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2568. 307.96 s [Cabal] Warning: 'die' is out of scope.
  2569. 307.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2570. 307.96 s [Cabal] 75% ( 12 / 16) in 'Distribution.Simple.Glob'
  2571. 307.96 s [Cabal] Missing documentation for:
  2572. 307.96 s [Cabal] GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
  2573. 307.96 s [Cabal] parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:137)
  2574. 307.96 s [Cabal] GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
  2575. 307.96 s [Cabal] explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:271)
  2576. 308.01 s [Cabal] Warning: 'm' is out of scope.
  2577. 308.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2578. 308.01 s [Cabal] Warning: 'local' is out of scope.
  2579. 308.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2580. 308.01 s [Cabal] Warning: 'ask' is out of scope.
  2581. 308.01 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2582. 308.07 s [Cabal] Warning: 'TaraAnn' is out of scope.
  2583. 308.07 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2584. 308.19 s [Cabal] Warning: 'LocalBuildInfo' is out of scope.
  2585. 308.19 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2586. 308.21 s [Cabal] 68% ( 33 / 48) in 'Distribution.Simple.Compiler'
  2587. 308.21 s [Cabal] Missing documentation for:
  2588. 308.21 s [Cabal] Compiler (src/Distribution/Simple/Compiler.hs:91)
  2589. 308.21 s [Cabal] showCompilerId (src/Distribution/Simple/Compiler.hs:112)
  2590. 308.21 s [Cabal] showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:115)
  2591. 308.21 s [Cabal] compilerFlavor (src/Distribution/Simple/Compiler.hs:122)
  2592. 308.21 s [Cabal] compilerVersion (src/Distribution/Simple/Compiler.hs:125)
  2593. 308.21 s [Cabal] compilerInfo (src/Distribution/Simple/Compiler.hs:154)
  2594. 308.21 s [Cabal] absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:212)
  2595. 308.21 s [Cabal] flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:236)
  2596. 308.21 s [Cabal] flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:269)
  2597. 308.21 s [Cabal] CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
  2598. 308.21 s [Cabal] languageToFlags (src/Distribution/Simple/Compiler.hs:294)
  2599. 308.21 s [Cabal] unsupportedLanguages (src/Distribution/Simple/Compiler.hs:289)
  2600. 308.21 s [Cabal] knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:475)
  2601. 308.21 s [Cabal] flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:463)
  2602. 308.21 s [Cabal] showProfDetailLevel (src/Distribution/Simple/Compiler.hs:485)
  2603. 308.35 s [Cabal] 65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
  2604. 308.35 s [Cabal] Missing documentation for:
  2605. 308.35 s [Cabal] initInvocation (src/Distribution/Simple/Program/HcPkg.hs:386)
  2606. 308.35 s [Cabal] registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:394)
  2607. 308.35 s [Cabal] unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:423)
  2608. 308.35 s [Cabal] recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:434)
  2609. 308.35 s [Cabal] exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:444)
  2610. 308.35 s [Cabal] hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:467)
  2611. 308.35 s [Cabal] dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:478)
  2612. 308.35 s [Cabal] describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:455)
  2613. 308.35 s [Cabal] listInvocation (src/Distribution/Simple/Program/HcPkg.hs:491)
  2614. 308.51 s [Cabal] 18% ( 2 / 11) in 'Distribution.Simple.Program.GHC'
  2615. 308.51 s [Cabal] Missing documentation for:
  2616. 308.51 s [Cabal] Module header
  2617. 308.51 s [Cabal] GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
  2618. 308.51 s [Cabal] GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
  2619. 308.51 s [Cabal] GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
  2620. 308.51 s [Cabal] GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
  2621. 308.51 s [Cabal] ghcInvocation (src/Distribution/Simple/Program/GHC.hs:641)
  2622. 308.51 s [Cabal] renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:658)
  2623. 308.51 s [Cabal] runGHC (src/Distribution/Simple/Program/GHC.hs:631)
  2624. 308.51 s [Cabal] normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:48)
  2625. 308.74 s [Cabal] 12% ( 4 / 31) in 'Distribution.Simple.Program.Builtin'
  2626. 308.74 s [Cabal] Missing documentation for:
  2627. 308.74 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2628. 308.74 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2629. 308.74 s [Cabal] runghcProgram (src/Distribution/Simple/Program/Builtin.hs:134)
  2630. 308.74 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2631. 308.74 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2632. 308.74 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2633. 308.74 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2634. 308.74 s [Cabal] haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:227)
  2635. 308.74 s [Cabal] haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:238)
  2636. 308.74 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2637. 308.74 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2638. 308.74 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2639. 308.74 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2640. 308.74 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2641. 308.74 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2642. 308.74 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2643. 308.74 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2644. 308.74 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2645. 308.74 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2646. 308.74 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2647. 308.74 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2648. 308.74 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2649. 308.74 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2650. 308.74 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2651. 308.74 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2652. 308.74 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2653. 308.74 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2654. 308.80 s [Cabal] Warning: 'Programs' is out of scope.
  2655. 308.80 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2656. 308.90 s [Cabal] Warning: 'AnyVersion' is out of scope.
  2657. 308.90 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2658. 308.90 s [Cabal] 82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
  2659. 308.90 s [Cabal] Missing documentation for:
  2660. 308.90 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2661. 308.90 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2662. 308.90 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2663. 308.90 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2664. 308.90 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2665. 308.90 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2666. 308.90 s [Cabal] 50% ( 40 / 80) in 'Distribution.Simple.Program'
  2667. 308.90 s [Cabal] Missing documentation for:
  2668. 308.90 s [Cabal] ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
  2669. 308.90 s [Cabal] findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:77)
  2670. 308.90 s [Cabal] defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:65)
  2671. 308.90 s [Cabal] ProgArg (src/Distribution/Simple/Program/Types.hs:83)
  2672. 308.90 s [Cabal] emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:70)
  2673. 308.90 s [Cabal] simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:82)
  2674. 308.90 s [Cabal] programInvocation (src/Distribution/Simple/Program/Run.hs:89)
  2675. 308.90 s [Cabal] runProgramInvocation (src/Distribution/Simple/Program/Run.hs:100)
  2676. 308.90 s [Cabal] getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:157)
  2677. 308.90 s [Cabal] getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:165)
  2678. 308.90 s [Cabal] defaultProgramDb (src/Distribution/Simple/Program/Db.hs:109)
  2679. 308.90 s [Cabal] emptyProgramDb (src/Distribution/Simple/Program/Db.hs:106)
  2680. 308.90 s [Cabal] addKnownPrograms (src/Distribution/Simple/Program/Db.hs:189)
  2681. 308.90 s [Cabal] lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:192)
  2682. 308.90 s [Cabal] knownPrograms (src/Distribution/Simple/Program/Db.hs:196)
  2683. 308.90 s [Cabal] userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:254)
  2684. 308.90 s [Cabal] ghcProgram (src/Distribution/Simple/Program/Builtin.hs:103)
  2685. 308.90 s [Cabal] ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:144)
  2686. 308.90 s [Cabal] ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:155)
  2687. 308.90 s [Cabal] ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:162)
  2688. 308.90 s [Cabal] hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:173)
  2689. 308.90 s [Cabal] jhcProgram (src/Distribution/Simple/Program/Builtin.hs:184)
  2690. 308.90 s [Cabal] uhcProgram (src/Distribution/Simple/Program/Builtin.hs:196)
  2691. 308.90 s [Cabal] gccProgram (src/Distribution/Simple/Program/Builtin.hs:267)
  2692. 308.90 s [Cabal] arProgram (src/Distribution/Simple/Program/Builtin.hs:273)
  2693. 308.90 s [Cabal] stripProgram (src/Distribution/Simple/Program/Builtin.hs:276)
  2694. 308.90 s [Cabal] happyProgram (src/Distribution/Simple/Program/Builtin.hs:245)
  2695. 308.90 s [Cabal] alexProgram (src/Distribution/Simple/Program/Builtin.hs:256)
  2696. 308.90 s [Cabal] hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:283)
  2697. 308.90 s [Cabal] c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:294)
  2698. 308.90 s [Cabal] cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:300)
  2699. 308.90 s [Cabal] hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:310)
  2700. 308.90 s [Cabal] doctestProgram (src/Distribution/Simple/Program/Builtin.hs:323)
  2701. 308.90 s [Cabal] haddockProgram (src/Distribution/Simple/Program/Builtin.hs:334)
  2702. 308.90 s [Cabal] greencardProgram (src/Distribution/Simple/Program/Builtin.hs:346)
  2703. 308.90 s [Cabal] ldProgram (src/Distribution/Simple/Program/Builtin.hs:349)
  2704. 308.90 s [Cabal] tarProgram (src/Distribution/Simple/Program/Builtin.hs:390)
  2705. 308.90 s [Cabal] cppProgram (src/Distribution/Simple/Program/Builtin.hs:408)
  2706. 308.90 s [Cabal] pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:411)
  2707. 308.90 s [Cabal] hpcProgram (src/Distribution/Simple/Program/Builtin.hs:202)
  2708. 308.90 s [Cabal] 33% ( 1 / 3) in 'Distribution.Simple.Program.Strip'
  2709. 308.90 s [Cabal] Missing documentation for:
  2710. 308.90 s [Cabal] stripLib (src/Distribution/Simple/Program/Strip.hs:51)
  2711. 308.90 s [Cabal] stripExe (src/Distribution/Simple/Program/Strip.hs:40)
  2712. 309.21 s [Cabal] Warning: 'GetOpt' is out of scope.
  2713. 309.21 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2714. 309.21 s [Cabal] Warning: 'smart' is out of scope.
  2715. 309.21 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2716. 309.21 s [Cabal] 61% ( 33 / 54) in 'Distribution.Simple.Command'
  2717. 309.21 s [Cabal] Missing documentation for:
  2718. 309.21 s [Cabal] CommandUI (src/Distribution/Simple/Command.hs:97)
  2719. 309.21 s [Cabal] CommandParse (src/Distribution/Simple/Command.hs:596)
  2720. 309.21 s [Cabal] helpCommandUI (src/Distribution/Simple/Command.hs:763)
  2721. 309.21 s [Cabal] ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
  2722. 309.21 s [Cabal] Command (src/Distribution/Simple/Command.hs:608)
  2723. 309.21 s [Cabal] commandAddAction (src/Distribution/Simple/Command.hs:617)
  2724. 309.21 s [Cabal] CommandType (src/Distribution/Simple/Command.hs:607)
  2725. 309.21 s [Cabal] commandFromSpec (src/Distribution/Simple/Command.hs:787)
  2726. 309.21 s [Cabal] commandsRun (src/Distribution/Simple/Command.hs:654)
  2727. 309.21 s [Cabal] commandsRunWithFallback (src/Distribution/Simple/Command.hs:669)
  2728. 309.21 s [Cabal] defaultCommandFallback (src/Distribution/Simple/Command.hs:662)
  2729. 309.21 s [Cabal] Name (src/Distribution/Simple/Command.hs:117)
  2730. 309.21 s [Cabal] liftOption (src/Distribution/Simple/Command.hs:373)
  2731. 309.21 s [Cabal] Description (src/Distribution/Simple/Command.hs:118)
  2732. 309.21 s [Cabal] OptFlags (src/Distribution/Simple/Command.hs:160)
  2733. 309.21 s [Cabal] ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
  2734. 309.21 s [Cabal] MkOptDescr (src/Distribution/Simple/Command.hs:200)
  2735. 309.21 s [Cabal] optArgDef' (src/Distribution/Simple/Command.hs:269)
  2736. 309.21 s [Cabal] noArg (src/Distribution/Simple/Command.hs:278)
  2737. 309.21 s [Cabal] boolOpt (src/Distribution/Simple/Command.hs:281)
  2738. 309.21 s [Cabal] boolOpt' (src/Distribution/Simple/Command.hs:293)
  2739. 309.38 s [Cabal] Warning: 'progDb' is out of scope.
  2740. 309.38 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2741. 309.96 s [Cabal] Warning: 'haddocksInterfaces' is out of scope.
  2742. 309.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2743. 309.96 s [Cabal] Warning: 'haddocksAction' is out of scope.
  2744. 309.96 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2745. 311.07 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  2746. 311.07 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2747. 311.08 s [Cabal] 77% ( 7 / 9) in 'Distribution.Types.LocalBuildConfig'
  2748. 311.08 s [Cabal] Missing documentation for:
  2749. 311.08 s [Cabal] Module header
  2750. 311.08 s [Cabal] buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:201)
  2751. 311.21 s [Cabal] Warning: 'Component' is out of scope.
  2752. 311.21 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2753. 311.21 s [Cabal] Warning: 'LocalBuildInfo' is ambiguous. It is defined
  2754. 311.21 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:180:1
  2755. 311.21 s [Cabal] * at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2756. 311.21 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  2757. 311.21 s [Cabal] by specifying the type/value namespace explicitly.
  2758. 311.21 s [Cabal] Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
  2759. 311.22 s [Cabal] Warning: 'LocalBuildDescr' is out of scope.
  2760. 311.22 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2761. 311.22 s [Cabal] Warning: 'LocalBuildConfig' is out of scope.
  2762. 311.22 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2763. 311.22 s [Cabal] 53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
  2764. 311.22 s [Cabal] Missing documentation for:
  2765. 311.22 s [Cabal] Module header
  2766. 311.22 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2767. 311.22 s [Cabal] buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:280)
  2768. 311.22 s [Cabal] configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:284)
  2769. 311.22 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2770. 311.22 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2771. 311.22 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2772. 311.22 s [Cabal] unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:359)
  2773. 311.22 s [Cabal] componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:419)
  2774. 311.22 s [Cabal] unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:422)
  2775. 311.22 s [Cabal] allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:425)
  2776. 311.23 s [Cabal] withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:428)
  2777. 311.23 s [Cabal] neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:431)
  2778. 311.23 s [Cabal] withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:434)
  2779. 311.32 s [Cabal] Warning: 'compBuildOrder' is out of scope.
  2780. 311.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2781. 311.33 s [Cabal] 49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
  2782. 311.33 s [Cabal] Missing documentation for:
  2783. 311.33 s [Cabal] buildDir (src/Distribution/Types/LocalBuildInfo.hs:276)
  2784. 311.33 s [Cabal] cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:287)
  2785. 311.33 s [Cabal] progPrefix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2786. 311.33 s [Cabal] progSuffix (src/Distribution/Types/LocalBuildInfo.hs:291)
  2787. 311.33 s [Cabal] Component
  2788. 311.33 s [Cabal] ComponentName
  2789. 311.33 s [Cabal] LibraryName
  2790. 311.33 s [Cabal] defaultLibName
  2791. 311.33 s [Cabal] showComponentName
  2792. 311.33 s [Cabal] componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:111)
  2793. 311.33 s [Cabal] foldComponent
  2794. 311.33 s [Cabal] componentName
  2795. 311.33 s [Cabal] componentBuildInfo
  2796. 311.33 s [Cabal] lookupComponent
  2797. 311.33 s [Cabal] getComponent
  2798. 311.33 s [Cabal] allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:208)
  2799. 311.33 s [Cabal] withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:168)
  2800. 311.33 s [Cabal] enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:176)
  2801. 311.33 s [Cabal] enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:186)
  2802. 311.33 s [Cabal] PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
  2803. 311.33 s [Cabal] PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
  2804. 311.33 s [Cabal] defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:178)
  2805. 311.33 s [Cabal] defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:181)
  2806. 311.33 s [Cabal] combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:116)
  2807. 311.33 s [Cabal] combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:409)
  2808. 311.33 s [Cabal] platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:451)
  2809. 311.33 s [Cabal] compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:446)
  2810. 311.33 s [Cabal] packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:436)
  2811. 311.33 s [Cabal] abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:457)
  2812. 311.33 s [Cabal] installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:476)
  2813. 311.33 s [Cabal] absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:372)
  2814. 311.33 s [Cabal] substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:430)
  2815. 311.42 s [Cabal] 71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
  2816. 311.42 s [Cabal] Missing documentation for:
  2817. 311.42 s [Cabal] Module header
  2818. 311.42 s [Cabal] TestLogs (src/Distribution/Simple/Test/Log.hs:66)
  2819. 311.42 s [Cabal] summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:192)
  2820. 311.42 s [Cabal] testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:118)
  2821. 311.50 s [Cabal] 55% ( 5 / 9) in 'Distribution.Simple.Hpc'
  2822. 311.50 s [Cabal] Missing documentation for:
  2823. 311.50 s [Cabal] Way (src/Distribution/Simple/Hpc.hs:55)
  2824. 311.50 s [Cabal] htmlDir (src/Distribution/Simple/Hpc.hs:98)
  2825. 311.50 s [Cabal] mixDir (src/Distribution/Simple/Hpc.hs:71)
  2826. 311.50 s [Cabal] tixDir (src/Distribution/Simple/Hpc.hs:79)
  2827. 311.55 s [Cabal] 50% ( 1 / 2) in 'Distribution.Simple.Build.PackageInfoModule'
  2828. 311.55 s [Cabal] Missing documentation for:
  2829. 311.55 s [Cabal] generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:36)
  2830. 311.58 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Build.Macros'
  2831. 311.61 s [Cabal] Warning: 'computeCompatPackageName' is out of scope.
  2832. 311.61 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2833. 311.67 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
  2834. 311.67 s [Cabal] Missing documentation for:
  2835. 311.67 s [Cabal] toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:172)
  2836. 311.67 s [Cabal] toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:307)
  2837. 311.67 s [Cabal] ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
  2838. 311.67 s [Cabal] extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:288)
  2839. 311.67 s [Cabal] newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:349)
  2840. 311.77 s [Cabal] Warning: 'ReadyComponent' is out of scope.
  2841. 311.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2842. 311.77 s [Cabal] Warning: 'ModSubst' is out of scope.
  2843. 311.77 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2844. 311.78 s [Cabal] 54% ( 6 / 11) in 'Distribution.Backpack.LinkedComponent'
  2845. 311.78 s [Cabal] Missing documentation for:
  2846. 311.78 s [Cabal] toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:114)
  2847. 311.78 s [Cabal] toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:407)
  2848. 311.78 s [Cabal] dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:98)
  2849. 311.78 s [Cabal] LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
  2850. 311.78 s [Cabal] extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:432)
  2851. 311.89 s [Cabal] 100% ( 7 / 7) in 'Distribution.Backpack.ComponentsGraph'
  2852. 311.91 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Program.Ld'
  2853. 311.96 s [Cabal] 100% ( 3 / 3) in 'Distribution.Simple.Program.Ar'
  2854. 312.25 s [Cabal] Warning: 'CommandUI' is out of scope.
  2855. 312.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2856. 312.25 s [Cabal] Warning: 'Monoid' is out of scope.
  2857. 312.25 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2858. 312.25 s [Cabal] 25% ( 26 /102) in 'Distribution.Simple.Setup'
  2859. 312.25 s [Cabal] Missing documentation for:
  2860. 312.25 s [Cabal] emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:114)
  2861. 312.25 s [Cabal] defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:53)
  2862. 312.25 s [Cabal] globalCommand (src/Distribution/Simple/Setup/Global.hs:60)
  2863. 312.25 s [Cabal] emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1023)
  2864. 312.25 s [Cabal] defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:309)
  2865. 312.25 s [Cabal] configureCommand (src/Distribution/Simple/Setup/Config.hs:355)
  2866. 312.25 s [Cabal] configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:301)
  2867. 312.25 s [Cabal] readPackageDbList (src/Distribution/Simple/Setup/Config.hs:868)
  2868. 312.25 s [Cabal] showPackageDbList (src/Distribution/Simple/Setup/Config.hs:880)
  2869. 312.25 s [Cabal] emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:145)
  2870. 312.25 s [Cabal] defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:61)
  2871. 312.25 s [Cabal] copyCommand (src/Distribution/Simple/Setup/Copy.hs:71)
  2872. 312.25 s [Cabal] emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:150)
  2873. 312.25 s [Cabal] defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:60)
  2874. 312.25 s [Cabal] installCommand (src/Distribution/Simple/Setup/Install.hs:72)
  2875. 312.25 s [Cabal] HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
  2876. 312.25 s [Cabal] emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:356)
  2877. 312.25 s [Cabal] defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:115)
  2878. 312.25 s [Cabal] haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:145)
  2879. 312.25 s [Cabal] HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
  2880. 312.25 s [Cabal] emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:598)
  2881. 312.25 s [Cabal] defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:421)
  2882. 312.25 s [Cabal] haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:445)
  2883. 312.25 s [Cabal] HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
  2884. 312.25 s [Cabal] emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:57)
  2885. 312.25 s [Cabal] defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:60)
  2886. 312.25 s [Cabal] hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:80)
  2887. 312.25 s [Cabal] BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
  2888. 312.25 s [Cabal] emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:157)
  2889. 312.25 s [Cabal] defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:64)
  2890. 312.25 s [Cabal] buildCommand (src/Distribution/Simple/Setup/Build.hs:77)
  2891. 312.25 s [Cabal] DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
  2892. 312.25 s [Cabal] ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
  2893. 312.25 s [Cabal] defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:76)
  2894. 312.25 s [Cabal] replCommand (src/Distribution/Simple/Setup/Repl.hs:94)
  2895. 312.25 s [Cabal] ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
  2896. 312.25 s [Cabal] CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
  2897. 312.25 s [Cabal] emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:89)
  2898. 312.25 s [Cabal] defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:53)
  2899. 312.25 s [Cabal] cleanCommand (src/Distribution/Simple/Setup/Clean.hs:62)
  2900. 312.25 s [Cabal] emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:187)
  2901. 312.25 s [Cabal] defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:60)
  2902. 312.25 s [Cabal] registerCommand (src/Distribution/Simple/Setup/Register.hs:74)
  2903. 312.25 s [Cabal] unregisterCommand (src/Distribution/Simple/Setup/Register.hs:141)
  2904. 312.25 s [Cabal] emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:105)
  2905. 312.25 s [Cabal] defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:52)
  2906. 312.25 s [Cabal] sdistCommand (src/Distribution/Simple/Setup/SDist.hs:62)
  2907. 312.25 s [Cabal] TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
  2908. 312.25 s [Cabal] emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:246)
  2909. 312.25 s [Cabal] defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:99)
  2910. 312.25 s [Cabal] testCommand (src/Distribution/Simple/Setup/Test.hs:113)
  2911. 312.25 s [Cabal] TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
  2912. 312.25 s [Cabal] BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
  2913. 312.25 s [Cabal] emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:123)
  2914. 312.25 s [Cabal] defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:55)
  2915. 312.25 s [Cabal] benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:63)
  2916. 312.25 s [Cabal] configureOptions (src/Distribution/Simple/Setup/Config.hs:402)
  2917. 312.25 s [Cabal] configureCCompiler (src/Distribution/Simple/Setup/Common.hs:323)
  2918. 312.25 s [Cabal] configureLinker (src/Distribution/Simple/Setup/Common.hs:329)
  2919. 312.25 s [Cabal] buildOptions (src/Distribution/Simple/Setup/Build.hs:125)
  2920. 312.25 s [Cabal] haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:183)
  2921. 312.25 s [Cabal] haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:483)
  2922. 312.25 s [Cabal] installDirsOptions (src/Distribution/Simple/Setup/Config.hs:919)
  2923. 312.26 s [Cabal] testOptions' (src/Distribution/Simple/Setup/Test.hs:133)
  2924. 312.26 s [Cabal] benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:83)
  2925. 312.26 s [Cabal] programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:104)
  2926. 312.26 s [Cabal] replOptions (src/Distribution/Simple/Setup/Repl.hs:182)
  2927. 312.26 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2928. 312.26 s [Cabal] optionDistPref (src/Distribution/Simple/Setup/Common.hs:250)
  2929. 312.26 s [Cabal] boolOpt (src/Distribution/Simple/Setup/Common.hs:224)
  2930. 312.26 s [Cabal] boolOpt' (src/Distribution/Simple/Setup/Common.hs:230)
  2931. 312.26 s [Cabal] trueArg (src/Distribution/Simple/Setup/Common.hs:236)
  2932. 312.26 s [Cabal] falseArg (src/Distribution/Simple/Setup/Common.hs:236)
  2933. 312.26 s [Cabal] optionVerbosity (src/Distribution/Simple/Setup/Common.hs:271)
  2934. 312.26 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2935. 312.26 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2936. 312.28 s [Cabal] Warning: 'Library' is out of scope.
  2937. 312.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2938. 312.28 s [Cabal] 81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
  2939. 312.28 s [Cabal] Missing documentation for:
  2940. 312.28 s [Cabal] Module header
  2941. 312.28 s [Cabal] buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:179)
  2942. 312.28 s [Cabal] buildingWhatDistPref (src/Distribution/Simple/Setup.hs:186)
  2943. 312.48 s [Cabal] Warning: 'matchExactly' is out of scope.
  2944. 312.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2945. 312.48 s [Cabal] Warning: 'ambiguousWith' is out of scope.
  2946. 312.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2947. 312.48 s [Cabal] Warning: 'shadows' is out of scope.
  2948. 312.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2949. 312.49 s [Cabal] 57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
  2950. 312.49 s [Cabal] Missing documentation for:
  2951. 312.49 s [Cabal] QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
  2952. 312.49 s [Cabal] buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:135)
  2953. 312.49 s [Cabal] readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:178)
  2954. 312.49 s [Cabal] showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:254)
  2955. 312.49 s [Cabal] UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
  2956. 312.49 s [Cabal] reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:246)
  2957. 312.49 s [Cabal] BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
  2958. 312.49 s [Cabal] reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:396)
  2959. 312.83 s [Cabal] Warning: 'lib' is out of scope.
  2960. 312.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2961. 312.83 s [Cabal] Warning: 'C' is out of scope.
  2962. 312.83 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  2963. 312.83 s [Cabal] 58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
  2964. 312.83 s [Cabal] Missing documentation for:
  2965. 312.84 s [Cabal] defaultDistPref (src/Distribution/Simple/Setup/Common.hs:64)
  2966. 312.84 s [Cabal] srcPref (src/Distribution/Simple/BuildPaths.hs:73)
  2967. 312.84 s [Cabal] hscolourPref (src/Distribution/Simple/BuildPaths.hs:76)
  2968. 312.84 s [Cabal] cppHeaderName (src/Distribution/Simple/BuildPaths.hs:107)
  2969. 312.84 s [Cabal] haddockName (src/Distribution/Simple/BuildPaths.hs:128)
  2970. 312.84 s [Cabal] mkLibName (src/Distribution/Simple/BuildPaths.hs:219)
  2971. 312.84 s [Cabal] mkProfLibName (src/Distribution/Simple/BuildPaths.hs:222)
  2972. 312.84 s [Cabal] mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:237)
  2973. 312.84 s [Cabal] mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:243)
  2974. 312.84 s [Cabal] getSourceFiles (src/Distribution/Simple/BuildPaths.hs:186)
  2975. 312.84 s [Cabal] getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:134)
  2976. 312.84 s [Cabal] getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:151)
  2977. 312.84 s [Cabal] getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:170)
  2978. 312.92 s [Cabal] 12% ( 1 / 8) in 'Distribution.Simple.UHC'
  2979. 312.92 s [Cabal] Missing documentation for:
  2980. 312.92 s [Cabal] configure (src/Distribution/Simple/UHC.hs:58)
  2981. 312.92 s [Cabal] getInstalledPackages (src/Distribution/Simple/UHC.hs:112)
  2982. 312.92 s [Cabal] buildLib (src/Distribution/Simple/UHC.hs:201)
  2983. 312.92 s [Cabal] buildExe (src/Distribution/Simple/UHC.hs:235)
  2984. 312.92 s [Cabal] installLib (src/Distribution/Simple/UHC.hs:314)
  2985. 312.92 s [Cabal] registerPackage (src/Distribution/Simple/UHC.hs:343)
  2986. 312.92 s [Cabal] inplacePackageDbPath (src/Distribution/Simple/UHC.hs:364)
  2987. 313.04 s [Cabal] 0% ( 0 / 13) in 'Distribution.Simple.HaskellSuite'
  2988. 313.04 s [Cabal] Missing documentation for:
  2989. 313.04 s [Cabal] Module header
  2990. 313.04 s [Cabal] configure (src/Distribution/Simple/HaskellSuite.hs:30)
  2991. 313.04 s [Cabal] hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:92)
  2992. 313.04 s [Cabal] numericVersion (src/Distribution/Simple/HaskellSuite.hs:95)
  2993. 313.04 s [Cabal] getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:98)
  2994. 313.04 s [Cabal] getExtensions (src/Distribution/Simple/HaskellSuite.hs:112)
  2995. 313.04 s [Cabal] getLanguages (src/Distribution/Simple/HaskellSuite.hs:120)
  2996. 313.04 s [Cabal] getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:130)
  2997. 313.04 s [Cabal] buildLib (src/Distribution/Simple/HaskellSuite.hs:166)
  2998. 313.04 s [Cabal] installLib (src/Distribution/Simple/HaskellSuite.hs:211)
  2999. 313.04 s [Cabal] registerPackage (src/Distribution/Simple/HaskellSuite.hs:239)
  3000. 313.04 s [Cabal] initPackageDB (src/Distribution/Simple/HaskellSuite.hs:256)
  3001. 313.04 s [Cabal] packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:264)
  3002. 313.18 s [Cabal] Warning: 'Arch' is ambiguous. It is defined
  3003. 313.18 s [Cabal] * in ‘Distribution.Types.ConfVar’
  3004. 313.18 s [Cabal] * in ‘Distribution.System’
  3005. 313.19 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  3006. 313.19 s [Cabal] by specifying the type/value namespace explicitly.
  3007. 313.19 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  3008. 313.19 s [Cabal] Warning: 'OS' is ambiguous. It is defined
  3009. 313.19 s [Cabal] * in ‘Distribution.Types.ConfVar’
  3010. 313.19 s [Cabal] * in ‘Distribution.System’
  3011. 313.19 s [Cabal] You may be able to disambiguate the identifier by qualifying it or
  3012. 313.19 s [Cabal] by specifying the type/value namespace explicitly.
  3013. 313.19 s [Cabal] Defaulting to the one defined in ‘Distribution.Types.ConfVar’
  3014. 313.94 s [Cabal] Warning: 'hsLibraries' is out of scope.
  3015. 313.94 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3016. 314.04 s [Cabal] 52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
  3017. 314.04 s [Cabal] Missing documentation for:
  3018. 314.04 s [Cabal] Module header
  3019. 314.04 s [Cabal] getGhcInfo (src/Distribution/Simple/GHCJS.hs:307)
  3020. 314.04 s [Cabal] configure (src/Distribution/Simple/GHCJS.hs:111)
  3021. 314.04 s [Cabal] buildLib (src/Distribution/Simple/GHCJS.hs:455)
  3022. 314.04 s [Cabal] replLib (src/Distribution/Simple/GHCJS.hs:465)
  3023. 314.04 s [Cabal] replFLib (src/Distribution/Simple/GHCJS.hs:882)
  3024. 314.04 s [Cabal] replExe (src/Distribution/Simple/GHCJS.hs:905)
  3025. 314.04 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1967)
  3026. 314.04 s [Cabal] registerPackage (src/Distribution/Simple/GHCJS.hs:1985)
  3027. 314.04 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1773)
  3028. 314.04 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  3029. 314.04 s [Cabal] getLibDir (src/Distribution/Simple/GHCJS.hs:354)
  3030. 314.04 s [Cabal] isDynamic (src/Distribution/Simple/GHCJS.hs:1947)
  3031. 314.04 s [Cabal] pkgRoot (src/Distribution/Simple/GHCJS.hs:2000)
  3032. 314.04 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  3033. 314.04 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  3034. 314.04 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  3035. 314.04 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  3036. 314.60 s [Cabal] Warning: 'PreBuildComponentRules' is out of scope.
  3037. 314.60 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3038. 314.74 s [Cabal] Warning: 'hsLibraries' is out of scope.
  3039. 314.74 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3040. 315.03 s [Cabal] 55% ( 21 / 38) in 'Distribution.Simple.GHC'
  3041. 315.03 s [Cabal] Missing documentation for:
  3042. 315.03 s [Cabal] getGhcInfo (src/Distribution/Simple/GHC.hs:386)
  3043. 315.03 s [Cabal] configure (src/Distribution/Simple/GHC.hs:149)
  3044. 315.03 s [Cabal] getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:539)
  3045. 315.03 s [Cabal] buildLib (src/Distribution/Simple/GHC.hs:570)
  3046. 315.03 s [Cabal] replLib (src/Distribution/Simple/GHC.hs:582)
  3047. 315.03 s [Cabal] replFLib (src/Distribution/Simple/GHC.hs:628)
  3048. 315.03 s [Cabal] replExe (src/Distribution/Simple/GHC.hs:653)
  3049. 315.03 s [Cabal] hcPkgInfo (src/Distribution/Simple/GHC.hs:959)
  3050. 315.03 s [Cabal] registerPackage (src/Distribution/Simple/GHC.hs:977)
  3051. 315.03 s [Cabal] componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:515)
  3052. 315.03 s [Cabal] componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:341)
  3053. 315.03 s [Cabal] getLibDir (src/Distribution/Simple/GHC.hs:450)
  3054. 315.03 s [Cabal] pkgRoot (src/Distribution/Simple/GHC.hs:992)
  3055. 315.03 s [Cabal] readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:56)
  3056. 315.03 s [Cabal] parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:53)
  3057. 315.03 s [Cabal] ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
  3058. 315.03 s [Cabal] getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:69)
  3059. 315.23 s [Cabal] 60% ( 3 / 5) in 'Distribution.Simple.ShowBuildInfo'
  3060. 315.23 s [Cabal] Missing documentation for:
  3061. 315.24 s [Cabal] mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:133)
  3062. 315.24 s [Cabal] mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:141)
  3063. 315.26 s [Cabal] Warning: 'register' is out of scope.
  3064. 315.26 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3065. 315.26 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Install'
  3066. 315.29 s [Cabal] 66% ( 2 / 3) in 'Distribution.Simple.Build.PathsModule'
  3067. 315.29 s [Cabal] Missing documentation for:
  3068. 315.29 s [Cabal] generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:41)
  3069. 315.32 s [Cabal] Warning: 'TestSuite' is out of scope.
  3070. 315.32 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3071. 315.32 s [Cabal] 75% ( 6 / 8) in 'Distribution.Simple.Test.LibV09'
  3072. 315.32 s [Cabal] Missing documentation for:
  3073. 315.32 s [Cabal] Module header
  3074. 315.32 s [Cabal] runTest (src/Distribution/Simple/Test/LibV09.hs:57)
  3075. 315.37 s [Cabal] 0% ( 0 / 2) in 'Distribution.Simple.Test.ExeV10'
  3076. 315.37 s [Cabal] Missing documentation for:
  3077. 315.37 s [Cabal] Module header
  3078. 315.37 s [Cabal] runTest (src/Distribution/Simple/Test/ExeV10.hs:51)
  3079. 315.67 s [Cabal] Warning: 'dist' is out of scope.
  3080. 315.67 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3081. 316.04 s [Cabal] 89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
  3082. 316.04 s [Cabal] Missing documentation for:
  3083. 316.04 s [Cabal] CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
  3084. 316.04 s [Cabal] ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:596)
  3085. 316.25 s [Cabal] 66% ( 4 / 6) in 'Distribution.Make'
  3086. 316.25 s [Cabal] Missing documentation for:
  3087. 316.25 s [Cabal] defaultMain (src/Distribution/Make.hs:84)
  3088. 316.25 s [Cabal] defaultMainArgs (src/Distribution/Make.hs:87)
  3089. 316.28 s [Cabal] Warning: 'sleepFileTimeCalibrate' is out of scope.
  3090. 316.28 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3091. 316.28 s [Cabal] 85% ( 6 / 7) in 'Distribution.Compat.Time'
  3092. 316.28 s [Cabal] Missing documentation for:
  3093. 316.28 s [Cabal] Module header
  3094. 316.34 s [Cabal] Warning: 'componentPackageDeps' is out of scope.
  3095. 316.34 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3096. 316.34 s [Cabal] Warning: 'InstalledPackageInfo' is out of scope.
  3097. 316.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3098. 316.35 s [Cabal] Warning: 'improveUnitId' is out of scope.
  3099. 316.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3100. 316.35 s [Cabal] Warning: 'HashedUnitId' is out of scope.
  3101. 316.35 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3102. 316.43 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.Configure'
  3103. 316.43 s [Cabal] Missing documentation for:
  3104. 316.43 s [Cabal] configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:65)
  3105. 316.48 s [Cabal] Warning: 'OpenModule' is out of scope.
  3106. 316.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3107. 316.48 s [Cabal] Warning: 'Module' is out of scope.
  3108. 316.48 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3109. 316.48 s [Cabal] 50% ( 1 / 2) in 'Distribution.Backpack.DescribeUnitId'
  3110. 316.48 s [Cabal] Missing documentation for:
  3111. 316.48 s [Cabal] Module header
  3112. 316.54 s [Cabal] 52% ( 9 / 17) in 'Distribution.Simple.Register'
  3113. 316.54 s [Cabal] Missing documentation for:
  3114. 316.54 s [Cabal] register (src/Distribution/Simple/Register.hs:93)
  3115. 316.54 s [Cabal] unregister (src/Distribution/Simple/Register.hs:702)
  3116. 316.54 s [Cabal] internalPackageDBPath (src/Distribution/Simple/Register.hs:737)
  3117. 316.54 s [Cabal] initPackageDB (src/Distribution/Simple/Register.hs:354)
  3118. 316.54 s [Cabal] doesPackageDBExist (src/Distribution/Simple/Register.hs:374)
  3119. 316.54 s [Cabal] deletePackageDB (src/Distribution/Simple/Register.hs:382)
  3120. 316.54 s [Cabal] registerPackage (src/Distribution/Simple/Register.hs:422)
  3121. 316.54 s [Cabal] generateRegistrationInfo (src/Distribution/Simple/Register.hs:250)
  3122. 316.71 s [Cabal] 40% ( 9 / 22) in 'Distribution.Simple.PreProcess'
  3123. 316.71 s [Cabal] Missing documentation for:
  3124. 316.71 s [Cabal] builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:110)
  3125. 316.71 s [Cabal] builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:113)
  3126. 316.71 s [Cabal] mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:103)
  3127. 316.71 s [Cabal] runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:118)
  3128. 316.71 s [Cabal] ppCpp (src/Distribution/Simple/PreProcess.hs:406)
  3129. 316.71 s [Cabal] ppCpp' (src/Distribution/Simple/PreProcess.hs:409)
  3130. 316.71 s [Cabal] ppGreenCard (src/Distribution/Simple/PreProcess.hs:381)
  3131. 316.71 s [Cabal] ppC2hs (src/Distribution/Simple/PreProcess.hs:650)
  3132. 316.71 s [Cabal] ppHsc2hs (src/Distribution/Simple/PreProcess.hs:475)
  3133. 316.71 s [Cabal] ppHappy (src/Distribution/Simple/PreProcess.hs:812)
  3134. 316.71 s [Cabal] ppAlex (src/Distribution/Simple/PreProcess.hs:821)
  3135. 316.71 s [Cabal] ppUnlit (src/Distribution/Simple/PreProcess.hs:396)
  3136. 316.71 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  3137. 316.88 s [Cabal] 75% ( 3 / 4) in 'Distribution.Simple.UserHooks'
  3138. 316.89 s [Cabal] Missing documentation for:
  3139. 316.89 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  3140. 316.92 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Bench'
  3141. 317.10 s [Cabal] Warning: 'UserHooks' is out of scope.
  3142. 317.10 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3143. 317.11 s [Cabal] 85% ( 23 / 27) in 'Distribution.Simple.Configure'
  3144. 317.11 s [Cabal] Missing documentation for:
  3145. 317.11 s [Cabal] configCompilerEx (src/Distribution/Simple/Configure.hs:2267)
  3146. 317.11 s [Cabal] configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2255)
  3147. 317.11 s [Cabal] checkForeignDeps (src/Distribution/Simple/Configure.hs:2292)
  3148. 317.11 s [Cabal] platformDefines (src/Distribution/Simple/PreProcess.hs:719)
  3149. 317.67 s [Cabal] 100% ( 2 / 2) in 'Distribution.Simple.Test'
  3150. 317.73 s [Cabal] Warning: 'die' is out of scope.
  3151. 317.73 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3152. 317.73 s [Cabal] Warning: 'errorPrefix' is out of scope.
  3153. 317.73 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3154. 317.73 s [Cabal] 100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
  3155. 317.89 s [Cabal] Warning: 'autogenComponentsModuleDir' is out of scope.
  3156. 317.89 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3157. 317.90 s [Cabal] 88% ( 15 / 17) in 'Distribution.Simple.Build'
  3158. 317.90 s [Cabal] Missing documentation for:
  3159. 317.90 s [Cabal] repl (src/Distribution/Simple/Build.hs:267)
  3160. 317.90 s [Cabal] AutogenFile (src/Distribution/Simple/Build.hs:1078)
  3161. 318.19 s [Cabal] Warning: 'haddocks' is out of scope.
  3162. 318.19 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3163. 318.19 s [Cabal] Warning: 'Haddock' is out of scope.
  3164. 318.19 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3165. 318.19 s [Cabal] Warning: 'HaddocksFlags' is out of scope.
  3166. 318.19 s [Cabal] If you qualify the identifier, haddock can try to link it anyway.
  3167. 318.19 s [Cabal] 66% ( 4 / 6) in 'Distribution.Simple.Haddock'
  3168. 318.19 s [Cabal] Missing documentation for:
  3169. 318.19 s [Cabal] haddock (src/Distribution/Simple/Haddock.hs:207)
  3170. 318.19 s [Cabal] hscolour (src/Distribution/Simple/Haddock.hs:1119)
  3171. 318.51 s [Cabal] 95% ( 20 / 21) in 'Distribution.Simple'
  3172. 318.51 s [Cabal] Missing documentation for:
  3173. 318.51 s [Cabal] Args (src/Distribution/Simple/UserHooks.hs:45)
  3174. 319.13 s [Cabal] Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
  3175. 319.13 s [Cabal] - Distribution.Utils.Structured.Tagged
  3176. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3177. 319.21 s [Cabal] Warning: Distribution.ReadE: could not find link destinations for:
  3178. 319.21 s [Cabal] - Distribution.ReadE.ErrorMsg
  3179. 319.21 s [Cabal] Warning: Distribution.Simple.Flag: could not find link destinations for:
  3180. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3181. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3182. 319.21 s [Cabal] Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
  3183. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3184. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3185. 319.21 s [Cabal] Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
  3186. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3187. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3188. 319.21 s [Cabal] Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
  3189. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3190. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3191. 319.21 s [Cabal] Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
  3192. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3193. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3194. 319.21 s [Cabal] Warning: Distribution.Types.GivenComponent: could not find link destinations for:
  3195. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3196. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3197. 319.21 s [Cabal] Warning: Distribution.Types.TargetInfo: could not find link destinations for:
  3198. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3199. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3200. 319.21 s [Cabal] Warning: Distribution.Verbosity.Internal: could not find link destinations for:
  3201. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3202. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3203. 319.21 s [Cabal] Warning: Distribution.Verbosity: could not find link destinations for:
  3204. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3205. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3206. 319.21 s [Cabal] Warning: Distribution.Simple.Program.Types: could not find link destinations for:
  3207. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3208. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3209. 319.21 s [Cabal] Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
  3210. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3211. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3212. 319.21 s [Cabal] Warning: Distribution.Simple.Utils: could not find link destinations for:
  3213. 319.21 s [Cabal] - Distribution.Simple.Utils.withMetadata
  3214. 319.21 s [Cabal] Warning: Distribution.Utils.NubList: could not find link destinations for:
  3215. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3216. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3217. 319.21 s [Cabal] Warning: Distribution.Utils.LogProgress: could not find link destinations for:
  3218. 319.21 s [Cabal] - Distribution.Utils.LogProgress.CtxMsg
  3219. 319.21 s [Cabal] Warning: Distribution.Simple.Program.Find: could not find link destinations for:
  3220. 319.21 s [Cabal] - Distribution.Utils.Structured.Tagged
  3221. 319.21 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3222. 319.21 s [Cabal] - Distribution.Simple.Program.Find.findExecutable
  3223. 319.22 s [Cabal] Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
  3224. 319.22 s [Cabal] - Distribution.Utils.Structured.Tagged
  3225. 319.22 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3226. 319.22 s [Cabal] - Distribution.Simple.PackageIndex.DepUniqueKey
  3227. 319.22 s [Cabal] Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
  3228. 319.22 s [Cabal] - Distribution.Utils.Structured.Tagged
  3229. 319.22 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3230. 319.22 s [Cabal] Warning: Distribution.Simple.Glob: could not find link destinations for:
  3231. 319.22 s [Cabal] - Distribution.Utils.Structured.Tagged
  3232. 319.22 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3233. 319.23 s [Cabal] Warning: Distribution.Simple.Compiler: could not find link destinations for:
  3234. 319.23 s [Cabal] - Distribution.Utils.Structured.Tagged
  3235. 319.23 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3236. 319.23 s [Cabal] Warning: Distribution.Simple.Program.Db: could not find link destinations for:
  3237. 319.23 s [Cabal] - Distribution.Utils.Structured.Tagged
  3238. 319.23 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3239. 319.24 s [Cabal] Warning: Distribution.Simple.Program: could not find link destinations for:
  3240. 319.24 s [Cabal] - Distribution.Utils.Structured.Tagged
  3241. 319.24 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3242. 319.26 s [Cabal] Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
  3243. 319.26 s [Cabal] - Distribution.Utils.Structured.Tagged
  3244. 319.26 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3245. 319.26 s [Cabal] Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
  3246. 319.26 s [Cabal] - Distribution.Utils.Structured.Tagged
  3247. 319.26 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3248. 319.27 s [Cabal] Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
  3249. 319.27 s [Cabal] - Distribution.Utils.Structured.Tagged
  3250. 319.27 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3251. 319.27 s [Cabal] - Distribution.Types.ComponentName.NotLibComponentName
  3252. 319.30 s [Cabal] Warning: Distribution.Simple.Setup: could not find link destinations for:
  3253. 319.30 s [Cabal] - Distribution.Utils.Structured.Tagged
  3254. 319.30 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3255. 319.30 s [Cabal] - Distribution.Simple.Setup.Common.programDbPaths
  3256. 319.30 s [Cabal] Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
  3257. 319.30 s [Cabal] - Distribution.Utils.Structured.Tagged
  3258. 319.30 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3259. 319.32 s [Cabal] Warning: Distribution.PackageDescription.Check: could not find link destinations for:
  3260. 319.33 s [Cabal] - Distribution.PackageDescription.Check.Warning.WarnLang
  3261. 319.33 s [Cabal] - Distribution.PackageDescription.Check.Warning.CEType
  3262. 319.33 s [Cabal] Warning: Distribution.Make: could not find link destinations for:
  3263. 319.33 s [Cabal] - Distribution.Utils.Structured.Tagged
  3264. 319.33 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3265. 319.33 s [Cabal] Warning: Distribution.Compat.Time: could not find link destinations for:
  3266. 319.33 s [Cabal] - Distribution.Utils.Structured.Tagged
  3267. 319.33 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3268. 319.33 s [Cabal] Warning: Distribution.Backpack.Configure: could not find link destinations for:
  3269. 319.33 s [Cabal] - Distribution.Backpack.PreExistingComponent.PreExistingComponent
  3270. 319.33 s [Cabal] - Distribution.Backpack.PreExistingComponent.PromisedComponent
  3271. 319.33 s [Cabal] Warning: Distribution.Simple.PreProcess: could not find link destinations for:
  3272. 319.33 s [Cabal] - Distribution.Utils.Structured.Tagged
  3273. 319.33 s [Cabal] - Distribution.Utils.Structured.structureHash'
  3274. 328.38 s [Cabal] Documentation created: dist/doc/html/Cabal/, dist/doc/html/Cabal/Cabal.txt
  3275. 328.49 s [Cabal] haddockPhase completed in 30 seconds
  3276. 328.49 s [Cabal] Phase: installPhase
  3277. 328.65 s [Cabal] Installing library in /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  3278. 332.11 s [Cabal] Phase: fixupPhase
  3279. 332.13 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0
  3280. 332.13 s [Cabal] shrinking /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSCabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE-ghc9.6.7.so
  3281. 332.24 s [Cabal] checking for references to /build/ in /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0...
  3282. 332.36 s [Cabal] patching script interpreter paths in /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0
  3283. 332.37 s [Cabal] stripping (with command strip and flags -S -p) in /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0/lib
  3284. 334.08 s [Cabal] shrinking RPATHs of ELF executables and libraries in /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc
  3285. 334.18 s [Cabal] checking for references to /build/ in /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc...
  3286. 334.21 s [Cabal] patching script interpreter paths in /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc
  3287. 334.64 s [Cabal:post-build] Uploading to cachix cache "sellout": /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0 /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc
  3288. 335.16 s [Cabal:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  3289. 335.16 s [Cabal:post-build]
  3290. 335.65 s [Cabal:post-build] Pushing /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc (32.77 MiB)
  3291. 335.77 s [Cabal:post-build] Pushing /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0 (122.54 MiB)
  3292. 338.12 s [Cabal:post-build]
  3293. 338.12 s [Cabal:post-build] All done.
  3294. 338.15 s [Cabal:post-build] Uploading to the NixCI cache: /nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0 /nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc
  3295. 338.20 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3296. 338.46 s [Cabal:post-build] copying 2 paths...
  3297. 338.46 s [Cabal:post-build] copying path '/nix/store/q99r9dfb0r09wh01qqcf2km9rfam2as3-Cabal-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
  3298. 344.66 s [Cabal:post-build] copying path '/nix/store/ail5c1d42qk0dz8qgk574rnarpqblk5z-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
  3299. 375.25 s [Cabal:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3300. 375.54 s [Cabal:post-build] copying 1 paths...
  3301. 375.57 s [Cabal:post-build] copying path '/nix/store/wr6wf00sww8639shsils9q6jvhj7amd5-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  3302. 375.78 s Progress: 2 of 22 built, 73 of 73 downloaded from cache
  3303. 375.82 s Building /nix/store/991m8h7khjnr98msizg8rws1hlgaklxz-cabal-doctest-1.0.12.drv
  3304. 375.86 s Building /nix/store/34p6i6n13j7m07zig9g5m3awrdna88xs-ghc-paths-0.1.0.12.drv
  3305. 375.90 s [cabal-doctest] Phase: setupCompilerEnvironmentPhase
  3306. 375.90 s [cabal-doctest] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  3307. 375.93 s [ghc-paths] Phase: setupCompilerEnvironmentPhase
  3308. 375.93 s [ghc-paths] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  3309. 376.05 s [cabal-doctest] Phase: unpackPhase
  3310. 376.05 s [cabal-doctest] unpacking source archive /nix/store/ckph819l8a613hapx2pwbjv3yzi8gm3k-cabal-doctest-1.0.12.tar.gz
  3311. 376.06 s [cabal-doctest] source root is cabal-doctest-1.0.12
  3312. 376.07 s [cabal-doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.12/src/Distribution/Extra/Doctest.hs"
  3313. 376.07 s [cabal-doctest] Phase: patchPhase
  3314. 376.08 s [cabal-doctest] Phase: compileBuildDriverPhase
  3315. 376.08 s [cabal-doctest] setupCompileFlags: -package-db=/build/tmp.3CsQDjHL7s/setup-package.conf.d -threaded
  3316. 376.09 s [ghc-paths] Phase: unpackPhase
  3317. 376.10 s [ghc-paths] unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
  3318. 376.11 s [ghc-paths] source root is ghc-paths-0.1.0.12
  3319. 376.11 s [ghc-paths] setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
  3320. 376.12 s [ghc-paths] Phase: patchPhase
  3321. 376.12 s [ghc-paths] Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/8.cabal.
  3322. 376.13 s [ghc-paths] applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
  3323. 376.13 s [ghc-paths] patching file GHC/Paths.hs
  3324. 376.13 s [ghc-paths] Phase: compileBuildDriverPhase
  3325. 376.13 s [ghc-paths] setupCompileFlags: -package-db=/build/tmp.suswhjTFnM/setup-package.conf.d -threaded
  3326. 376.14 s [cabal-doctest] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.3CsQDjHL7s/Main.o )
  3327. 376.20 s [cabal-doctest] [2 of 2] Linking Setup
  3328. 376.21 s [ghc-paths] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.suswhjTFnM/Main.o )
  3329. 376.44 s [ghc-paths] [2 of 2] Linking Setup
  3330. 377.62 s [cabal-doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3331. 377.64 s [cabal-doctest] Phase: configurePhase
  3332. 377.65 s [cabal-doctest] configureFlags: --verbose --prefix=/nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12 --with-gcc=gcc --package-db=/build/tmp.3CsQDjHL7s/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3333. 377.66 s [cabal-doctest] Using Parsec parser
  3334. 377.66 s [cabal-doctest] Configuring cabal-doctest-1.0.12...
  3335. 377.92 s [ghc-paths] Phase: updateAutotoolsGnuConfigScriptsPhase
  3336. 377.93 s [ghc-paths] Phase: configurePhase
  3337. 377.94 s [ghc-paths] configureFlags: --verbose --prefix=/nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.suswhjTFnM/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  3338. 377.95 s [ghc-paths] Using Parsec parser
  3339. 377.95 s [ghc-paths] Configuring ghc-paths-0.1.0.12...
  3340. 378.02 s [cabal-doctest] Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
  3341. 378.02 s [cabal-doctest] Dependency base >=4.9 && <5: using base-4.18.3.0
  3342. 378.02 s [cabal-doctest] Dependency directory >=1.3 && <2: using directory-1.3.8.5
  3343. 378.02 s [cabal-doctest] Dependency filepath >=1.4 && <2: using filepath-1.4.301.0
  3344. 378.39 s [cabal-doctest] Source component graph: component lib
  3345. 378.39 s [cabal-doctest] Configured component graph:
  3346. 378.39 s [cabal-doctest] component cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj
  3347. 378.39 s [cabal-doctest] include Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  3348. 378.39 s [cabal-doctest] include base-4.18.3.0
  3349. 378.39 s [cabal-doctest] include directory-1.3.8.5
  3350. 378.39 s [cabal-doctest] include filepath-1.4.301.0
  3351. 378.39 s [cabal-doctest] Linked component graph:
  3352. 378.39 s [cabal-doctest] unit cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj
  3353. 378.39 s [cabal-doctest] include Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  3354. 378.39 s [cabal-doctest] include base-4.18.3.0
  3355. 378.39 s [cabal-doctest] include directory-1.3.8.5
  3356. 378.39 s [cabal-doctest] include filepath-1.4.301.0
  3357. 378.39 s [cabal-doctest] Distribution.Extra.Doctest=cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj:Distribution.Extra.Doctest
  3358. 378.39 s [cabal-doctest] Ready component graph:
  3359. 378.39 s [cabal-doctest] definite cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj
  3360. 378.39 s [cabal-doctest] depends Cabal-3.12.1.0-1GJpGjYSFcbK9ZaIlUyPTE
  3361. 378.39 s [cabal-doctest] depends base-4.18.3.0
  3362. 378.39 s [cabal-doctest] depends directory-1.3.8.5
  3363. 378.39 s [cabal-doctest] depends filepath-1.4.301.0
  3364. 378.39 s [cabal-doctest] Using Cabal-3.10.3.0 compiled by ghc-9.6
  3365. 378.39 s [cabal-doctest] Using compiler: ghc-9.6.7
  3366. 378.39 s [cabal-doctest] Using install prefix:
  3367. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12
  3368. 378.39 s [cabal-doctest] Executables installed in:
  3369. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/bin
  3370. 378.39 s [cabal-doctest] Libraries installed in:
  3371. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj
  3372. 378.39 s [cabal-doctest] Dynamic Libraries installed in:
  3373. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  3374. 378.39 s [cabal-doctest] Private executables installed in:
  3375. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/libexec/x86_64-linux-ghc-9.6.7/cabal-doctest-1.0.12
  3376. 378.39 s [cabal-doctest] Data files installed in:
  3377. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/share/x86_64-linux-ghc-9.6.7/cabal-doctest-1.0.12
  3378. 378.39 s [cabal-doctest] Documentation installed in:
  3379. 378.39 s [cabal-doctest] /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc/share/doc/cabal-doctest-1.0.12
  3380. 378.39 s [cabal-doctest] Configuration files installed in:
  3381. 378.39 s [cabal-doctest] /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/etc
  3382. 378.39 s [cabal-doctest] No alex found
  3383. 378.39 s [cabal-doctest] Using ar found on system at:
  3384. 378.39 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3385. 378.39 s [cabal-doctest] No c2hs found
  3386. 378.39 s [cabal-doctest] No cpphs found
  3387. 378.39 s [cabal-doctest] No doctest found
  3388. 378.39 s [cabal-doctest] Using gcc version 14.3.0 given by user at:
  3389. 378.39 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3390. 378.39 s [cabal-doctest] Using ghc version 9.6.7 found on system at:
  3391. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  3392. 378.39 s [cabal-doctest] Using ghc-pkg version 9.6.7 found on system at:
  3393. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  3394. 378.39 s [cabal-doctest] No ghcjs found
  3395. 378.39 s [cabal-doctest] No ghcjs-pkg found
  3396. 378.39 s [cabal-doctest] No greencard found
  3397. 378.39 s [cabal-doctest] Using haddock version 2.29.2 found on system at:
  3398. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  3399. 378.39 s [cabal-doctest] No happy found
  3400. 378.39 s [cabal-doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  3401. 378.39 s [cabal-doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3402. 378.39 s [cabal-doctest] No hmake found
  3403. 378.39 s [cabal-doctest] Using hpc version 0.68 found on system at:
  3404. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  3405. 378.39 s [cabal-doctest] Using hsc2hs version 0.68.9 found on system at:
  3406. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  3407. 378.39 s [cabal-doctest] Using hscolour version 1.25 found on system at:
  3408. 378.39 s [cabal-doctest] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  3409. 378.39 s [cabal-doctest] No jhc found
  3410. 378.39 s [cabal-doctest] Using ld found on system at:
  3411. 378.39 s [cabal-doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3412. 378.39 s [cabal-doctest] No pkg-config found
  3413. 378.39 s [cabal-doctest] Using runghc version 9.6.7 found on system at:
  3414. 378.39 s [cabal-doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  3415. 378.39 s [cabal-doctest] Using strip version 2.44 found on system at:
  3416. 378.39 s [cabal-doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3417. 378.39 s [cabal-doctest] Using tar found on system at:
  3418. 378.39 s [cabal-doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3419. 378.39 s [cabal-doctest] No uhc found
  3420. 378.58 s [cabal-doctest] Phase: buildPhase
  3421. 378.63 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3422. 378.63 s [cabal-doctest] Building library for cabal-doctest-1.0.12..
  3423. 378.64 s [ghc-paths] Dependency base >=3 && <5: using base-4.18.3.0
  3424. 378.64 s [ghc-paths] Source component graph: component lib
  3425. 378.64 s [ghc-paths] Configured component graph:
  3426. 378.64 s [ghc-paths] component ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3427. 378.64 s [ghc-paths] include base-4.18.3.0
  3428. 378.64 s [ghc-paths] Linked component graph:
  3429. 378.64 s [ghc-paths] unit ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3430. 378.64 s [ghc-paths] include base-4.18.3.0
  3431. 378.64 s [ghc-paths] GHC.Paths=ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze:GHC.Paths
  3432. 378.64 s [ghc-paths] Ready component graph:
  3433. 378.64 s [ghc-paths] definite ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3434. 378.64 s [ghc-paths] depends base-4.18.3.0
  3435. 378.64 s [ghc-paths] Using Cabal-3.12.1.0 compiled by ghc-9.6
  3436. 378.64 s [ghc-paths] Using compiler: ghc-9.6.7
  3437. 378.64 s [ghc-paths] Using install prefix:
  3438. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12
  3439. 378.64 s [ghc-paths] Executables installed in:
  3440. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/bin
  3441. 378.64 s [ghc-paths] Libraries installed in:
  3442. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3443. 378.64 s [ghc-paths] Dynamic Libraries installed in:
  3444. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  3445. 378.64 s [ghc-paths] Private executables installed in:
  3446. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.6.7/ghc-paths-0.1.0.12
  3447. 378.64 s [ghc-paths] Data files installed in:
  3448. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.6.7/ghc-paths-0.1.0.12
  3449. 378.64 s [ghc-paths] Documentation installed in:
  3450. 378.64 s [ghc-paths] /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
  3451. 378.64 s [ghc-paths] Configuration files installed in:
  3452. 378.64 s [ghc-paths] /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/etc
  3453. 378.64 s [ghc-paths] No alex found
  3454. 378.65 s [ghc-paths] Using ar found on system at:
  3455. 378.65 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3456. 378.65 s [ghc-paths] No c2hs found
  3457. 378.65 s [ghc-paths] No cpphs found
  3458. 378.65 s [ghc-paths] No doctest found
  3459. 378.65 s [ghc-paths] Using gcc version 14.3.0 given by user at:
  3460. 378.65 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3461. 378.65 s [ghc-paths] Using ghc version 9.6.7 found on system at:
  3462. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  3463. 378.65 s [ghc-paths] Using ghc-pkg version 9.6.7 found on system at:
  3464. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  3465. 378.65 s [ghc-paths] No ghcjs found
  3466. 378.65 s [ghc-paths] No ghcjs-pkg found
  3467. 378.65 s [ghc-paths] No greencard found
  3468. 378.65 s [ghc-paths] Using haddock version 2.29.2 found on system at:
  3469. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  3470. 378.65 s [ghc-paths] No happy found
  3471. 378.65 s [ghc-paths] Using haskell-suite found on system at: haskell-suite-dummy-location
  3472. 378.65 s [ghc-paths] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3473. 378.65 s [ghc-paths] No hmake found
  3474. 378.65 s [ghc-paths] Using hpc version 0.68 found on system at:
  3475. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  3476. 378.65 s [ghc-paths] Using hsc2hs version 0.68.9 found on system at:
  3477. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  3478. 378.65 s [ghc-paths] Using hscolour version 1.25 found on system at:
  3479. 378.65 s [ghc-paths] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  3480. 378.65 s [ghc-paths] No jhc found
  3481. 378.65 s [ghc-paths] Using ld found on system at:
  3482. 378.65 s [ghc-paths] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3483. 378.65 s [ghc-paths] No pkg-config found
  3484. 378.65 s [ghc-paths] Using runghc version 9.6.7 found on system at:
  3485. 378.65 s [ghc-paths] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  3486. 378.65 s [ghc-paths] Using strip version 2.44 found on system at:
  3487. 378.65 s [ghc-paths] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3488. 378.65 s [ghc-paths] Using tar found on system at:
  3489. 378.65 s [ghc-paths] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3490. 378.65 s [ghc-paths] No uhc found
  3491. 378.65 s [ghc-paths] Running: /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
  3492. 378.70 s [ghc-paths] Phase: buildPhase
  3493. 378.72 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
  3494. 378.75 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3495. 378.75 s [ghc-paths] Building library for ghc-paths-0.1.0.12...
  3496. 378.83 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
  3497. 379.08 s [ghc-paths] [1 of 1] Compiling GHC.Paths ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
  3498. 380.01 s [ghc-paths] Phase: checkPhase
  3499. 380.04 s [ghc-paths] Package has no test suites.
  3500. 380.05 s [ghc-paths] Phase: haddockPhase
  3501. 380.20 s [cabal-doctest] [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
  3502. 380.45 s [ghc-paths] Preprocessing library for ghc-paths-0.1.0.12...
  3503. 380.45 s [ghc-paths] Running Haddock on library for ghc-paths-0.1.0.12...
  3504. 380.64 s [ghc-paths] 0% ( 0 / 5) in 'GHC.Paths'
  3505. 380.73 s [ghc-paths] Missing documentation for:
  3506. 380.73 s [ghc-paths] Module header
  3507. 380.73 s [ghc-paths] ghc (GHC/Paths.hs:29)
  3508. 380.73 s [ghc-paths] ghc_pkg (GHC/Paths.hs:29)
  3509. 380.73 s [ghc-paths] libdir (GHC/Paths.hs:29)
  3510. 380.73 s [ghc-paths] docdir (GHC/Paths.hs:29)
  3511. 382.25 s [ghc-paths] Documentation created: dist/doc/html/ghc-paths/,
  3512. 382.25 s [ghc-paths] dist/doc/html/ghc-paths/ghc-paths.txt
  3513. 382.32 s [ghc-paths] Phase: installPhase
  3514. 382.36 s [ghc-paths] Installing library in /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3515. 382.51 s [ghc-paths] Phase: fixupPhase
  3516. 382.53 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12
  3517. 382.53 s [ghc-paths] shrinking /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze-ghc9.6.7.so
  3518. 382.54 s [ghc-paths] checking for references to /build/ in /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12...
  3519. 382.55 s [ghc-paths] patching script interpreter paths in /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12
  3520. 382.56 s [ghc-paths] stripping (with command strip and flags -S -p) in /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12/lib
  3521. 382.59 s [ghc-paths] shrinking RPATHs of ELF executables and libraries in /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc
  3522. 382.59 s [ghc-paths] checking for references to /build/ in /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc...
  3523. 382.61 s [ghc-paths] patching script interpreter paths in /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc
  3524. 382.68 s [ghc-paths:post-build] Uploading to cachix cache "sellout": /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12
  3525. 383.15 s [ghc-paths:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  3526. 383.15 s [ghc-paths:post-build]
  3527. 383.50 s [ghc-paths:post-build] Pushing /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12 (101.62 KiB)
  3528. 383.67 s [ghc-paths:post-build] Pushing /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc (121.06 KiB)
  3529. 384.67 s [ghc-paths:post-build]
  3530. 384.67 s [ghc-paths:post-build] All done.
  3531. 384.70 s [ghc-paths:post-build] Uploading to the NixCI cache: /nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc /nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12
  3532. 384.75 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3533. 384.95 s [ghc-paths:post-build] copying 2 paths...
  3534. 384.95 s [ghc-paths:post-build] copying path '/nix/store/631yygw51d39b963rmjcf9mw1jajilvx-ghc-paths-0.1.0.12-doc' to 'https://cache.nix-ci.com'...
  3535. 385.06 s [ghc-paths:post-build] copying path '/nix/store/bp7havsnal7j6k156s15xbqcz19b22b1-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
  3536. 385.35 s [ghc-paths:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3537. 385.59 s [ghc-paths:post-build] copying 1 paths...
  3538. 385.59 s [ghc-paths:post-build] copying path '/nix/store/34p6i6n13j7m07zig9g5m3awrdna88xs-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  3539. 385.83 s Progress: 3 of 22 built (1 building), 73 of 73 downloaded from cache
  3540. 385.88 s Building /nix/store/h2jfa2vyl9w9h8524glcaag9mwvgm7l8-doctest-0.24.2.drv
  3541. 385.92 s [cabal-doctest] Phase: checkPhase
  3542. 385.92 s [cabal-doctest] Package has no test suites.
  3543. 385.92 s [cabal-doctest] Phase: haddockPhase
  3544. 385.92 s [cabal-doctest] Preprocessing library for cabal-doctest-1.0.12..
  3545. 385.92 s [cabal-doctest] Running Haddock on library for cabal-doctest-1.0.12..
  3546. 385.92 s [cabal-doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  3547. 385.92 s [cabal-doctest] 100% ( 7 / 7) in 'Distribution.Extra.Doctest'
  3548. 386.02 s [doctest] Phase: setupCompilerEnvironmentPhase
  3549. 386.02 s [doctest] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  3550. 386.22 s [doctest] Phase: unpackPhase
  3551. 386.23 s [doctest] unpacking source archive /nix/store/bhl15ifbap4vkm5qbpgwa3svq4yanr2l-doctest-0.24.2.tar.gz
  3552. 386.24 s [doctest] source root is doctest-0.24.2
  3553. 386.26 s [doctest] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.24.2/test/UtilSpec.hs"
  3554. 386.26 s [doctest] Phase: patchPhase
  3555. 386.27 s [doctest] Phase: compileBuildDriverPhase
  3556. 386.28 s [doctest] setupCompileFlags: -package-db=/build/tmp.IdNZQgWcSW/setup-package.conf.d -threaded
  3557. 386.34 s [doctest] [1 of 2] Compiling Main ( Setup.lhs, /build/tmp.IdNZQgWcSW/Main.o )
  3558. 386.40 s [doctest] [2 of 2] Linking Setup
  3559. 387.88 s [doctest] Phase: updateAutotoolsGnuConfigScriptsPhase
  3560. 387.90 s [doctest] Phase: configurePhase
  3561. 387.90 s [doctest] configureFlags: --verbose --prefix=/nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc/share/doc/doctest-0.24.2 --with-gcc=gcc --package-db=/build/tmp.IdNZQgWcSW/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  3562. 387.91 s [doctest] Using Parsec parser
  3563. 387.91 s [doctest] Configuring doctest-0.24.2...
  3564. 388.26 s [doctest] Flags chosen: cabal-doctest=False
  3565. 388.26 s [doctest] Dependency base >=4.12 && <5: using base-4.18.3.0
  3566. 388.26 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3567. 388.26 s [doctest] Dependency containers: using containers-0.6.7
  3568. 388.26 s [doctest] Dependency deepseq: using deepseq-1.4.8.1
  3569. 388.26 s [doctest] Dependency directory: using directory-1.3.8.5
  3570. 388.26 s [doctest] Dependency exceptions: using exceptions-0.10.7
  3571. 388.26 s [doctest] Dependency filepath: using filepath-1.4.301.0
  3572. 388.26 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.6.7
  3573. 388.26 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3574. 388.26 s [doctest] Dependency process: using process-1.6.19.0
  3575. 388.26 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3576. 388.26 s [doctest] Dependency temporary: using temporary-1.3
  3577. 388.26 s [doctest] Dependency transformers: using transformers-0.6.1.0
  3578. 388.26 s [doctest] Dependency base >=4.12 && <5: using base-4.18.3.0
  3579. 388.26 s [doctest] Dependency doctest: using doctest-0.24.2
  3580. 388.26 s [doctest] Dependency HUnit: using HUnit-1.6.2.0
  3581. 388.26 s [doctest] Dependency QuickCheck >=2.13.1: using QuickCheck-2.15.0.1
  3582. 388.26 s [doctest] Dependency base >=4.12 && <5: using base-4.18.3.0
  3583. 388.26 s [doctest] Dependency code-page >=0.1: using code-page-0.2.1
  3584. 388.26 s [doctest] Dependency containers: using containers-0.6.7
  3585. 388.26 s [doctest] Dependency deepseq: using deepseq-1.4.8.1
  3586. 388.26 s [doctest] Dependency directory: using directory-1.3.8.5
  3587. 388.26 s [doctest] Dependency exceptions: using exceptions-0.10.7
  3588. 388.26 s [doctest] Dependency filepath: using filepath-1.4.301.0
  3589. 388.26 s [doctest] Dependency ghc >=8.6 && <9.14: using ghc-9.6.7
  3590. 388.26 s [doctest] Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
  3591. 388.26 s [doctest] Dependency hspec >=2.3.0: using hspec-2.11.14
  3592. 388.26 s [doctest] Dependency hspec-core >=2.3.0: using hspec-core-2.11.14
  3593. 388.26 s [doctest] Dependency mockery: using mockery-0.3.5
  3594. 388.26 s [doctest] Dependency process: using process-1.6.19.0
  3595. 388.26 s [doctest] Dependency silently >=1.2.4: using silently-1.2.5.4
  3596. 388.26 s [doctest] Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
  3597. 388.26 s [doctest] Dependency syb >=0.3: using syb-0.7.2.4
  3598. 388.26 s [doctest] Dependency temporary: using temporary-1.3
  3599. 388.26 s [doctest] Dependency transformers: using transformers-0.6.1.0
  3600. 388.28 s [cabal-doctest] Documentation created: dist/doc/html/cabal-doctest/,
  3601. 388.28 s [cabal-doctest] dist/doc/html/cabal-doctest/cabal-doctest.txt
  3602. 388.35 s [cabal-doctest] Phase: installPhase
  3603. 388.40 s [cabal-doctest] Installing library in /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/cabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj
  3604. 388.57 s [cabal-doctest] Phase: fixupPhase
  3605. 388.59 s [doctest] Source component graph:
  3606. 388.59 s [doctest] component test:spec
  3607. 388.59 s [doctest] component lib
  3608. 388.59 s [doctest] component exe:doctest dependency lib
  3609. 388.59 s [doctest] Configured component graph:
  3610. 388.59 s [doctest] component doctest-0.24.2-EwSNfmqJBjtGbzRSicnMvQ-spec
  3611. 388.59 s [doctest] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  3612. 388.59 s [doctest] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  3613. 388.59 s [doctest] include base-4.18.3.0
  3614. 388.59 s [doctest] include code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3615. 388.59 s [doctest] include containers-0.6.7
  3616. 388.59 s [doctest] include deepseq-1.4.8.1
  3617. 388.59 s [doctest] include directory-1.3.8.5
  3618. 388.59 s [doctest] include exceptions-0.10.7
  3619. 388.59 s [doctest] include filepath-1.4.301.0
  3620. 388.59 s [doctest] include ghc-9.6.7
  3621. 388.59 s [doctest] include ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3622. 388.59 s [doctest] include hspec-2.11.14-I9omB8cQWqjGiWysmEIWy3
  3623. 388.59 s [doctest] include hspec-core-2.11.14-DBhCbi3Zj7xBuKjfoT8Xg7
  3624. 388.59 s [doctest] include mockery-0.3.5-KNOGHAieUmoL9o3MFuASSn
  3625. 388.59 s [doctest] include process-1.6.19.0
  3626. 388.59 s [doctest] include silently-1.2.5.4-IDv2T3wjKRi13PP31mYrJe
  3627. 388.59 s [doctest] include stringbuilder-0.5.1-7mJFrtGnIBlE6lWAUiKpTK
  3628. 388.59 s [doctest] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3629. 388.59 s [doctest] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3630. 388.59 s [doctest] include transformers-0.6.1.0
  3631. 388.59 s [doctest] component doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3632. 388.59 s [doctest] include base-4.18.3.0
  3633. 388.59 s [doctest] include code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3634. 388.59 s [doctest] include containers-0.6.7
  3635. 388.59 s [doctest] include deepseq-1.4.8.1
  3636. 388.59 s [doctest] include directory-1.3.8.5
  3637. 388.59 s [doctest] include exceptions-0.10.7
  3638. 388.59 s [doctest] include filepath-1.4.301.0
  3639. 388.59 s [doctest] include ghc-9.6.7
  3640. 388.59 s [doctest] include ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3641. 388.59 s [doctest] include process-1.6.19.0
  3642. 388.59 s [doctest] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3643. 388.59 s [doctest] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3644. 388.59 s [doctest] include transformers-0.6.1.0
  3645. 388.59 s [doctest] component doctest-0.24.2-4hfMWkba3Ez88N2aZPTHqc-doctest
  3646. 388.59 s [doctest] include base-4.18.3.0
  3647. 388.59 s [doctest] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3648. 388.59 s [doctest] Linked component graph:
  3649. 388.59 s [doctest] unit doctest-0.24.2-EwSNfmqJBjtGbzRSicnMvQ-spec
  3650. 388.59 s [doctest] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  3651. 388.59 s [doctest] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  3652. 388.59 s [doctest] include base-4.18.3.0
  3653. 388.59 s [doctest] include code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3654. 388.59 s [doctest] include containers-0.6.7
  3655. 388.59 s [doctest] include deepseq-1.4.8.1
  3656. 388.59 s [doctest] include directory-1.3.8.5
  3657. 388.59 s [doctest] include exceptions-0.10.7
  3658. 388.59 s [doctest] include filepath-1.4.301.0
  3659. 388.59 s [doctest] include ghc-9.6.7
  3660. 388.59 s [doctest] include ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3661. 388.59 s [doctest] include hspec-2.11.14-I9omB8cQWqjGiWysmEIWy3
  3662. 388.59 s [doctest] include hspec-core-2.11.14-DBhCbi3Zj7xBuKjfoT8Xg7
  3663. 388.59 s [doctest] include mockery-0.3.5-KNOGHAieUmoL9o3MFuASSn
  3664. 388.59 s [doctest] include process-1.6.19.0
  3665. 388.59 s [doctest] include silently-1.2.5.4-IDv2T3wjKRi13PP31mYrJe
  3666. 388.59 s [doctest] include stringbuilder-0.5.1-7mJFrtGnIBlE6lWAUiKpTK
  3667. 388.59 s [doctest] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3668. 388.59 s [doctest] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3669. 388.59 s [doctest] include transformers-0.6.1.0
  3670. 388.59 s [doctest] unit doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3671. 388.59 s [doctest] include base-4.18.3.0
  3672. 388.59 s [doctest] include code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3673. 388.59 s [doctest] include containers-0.6.7
  3674. 388.59 s [doctest] include deepseq-1.4.8.1
  3675. 388.59 s [doctest] include directory-1.3.8.5
  3676. 388.59 s [doctest] include exceptions-0.10.7
  3677. 388.59 s [doctest] include filepath-1.4.301.0
  3678. 388.59 s [doctest] include ghc-9.6.7
  3679. 388.59 s [doctest] include ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3680. 388.59 s [doctest] include process-1.6.19.0
  3681. 388.59 s [doctest] include syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3682. 388.59 s [doctest] include temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3683. 388.59 s [doctest] include transformers-0.6.1.0
  3684. 388.59 s [doctest] Test.DocTest=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF:Test.DocTest.Internal.Run
  3685. 388.59 s [doctest] unit doctest-0.24.2-4hfMWkba3Ez88N2aZPTHqc-doctest
  3686. 388.59 s [doctest] include base-4.18.3.0
  3687. 388.59 s [doctest] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3688. 388.59 s [doctest] Ready component graph:
  3689. 388.59 s [doctest] definite doctest-0.24.2-EwSNfmqJBjtGbzRSicnMvQ-spec
  3690. 388.59 s [doctest] depends HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  3691. 388.59 s [doctest] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  3692. 388.59 s [doctest] depends base-4.18.3.0
  3693. 388.59 s [doctest] depends code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3694. 388.59 s [doctest] depends containers-0.6.7
  3695. 388.59 s [doctest] depends deepseq-1.4.8.1
  3696. 388.59 s [doctest] depends directory-1.3.8.5
  3697. 388.59 s [doctest] depends exceptions-0.10.7
  3698. 388.59 s [doctest] depends filepath-1.4.301.0
  3699. 388.59 s [doctest] depends ghc-9.6.7
  3700. 388.59 s [doctest] depends ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3701. 388.59 s [doctest] depends hspec-2.11.14-I9omB8cQWqjGiWysmEIWy3
  3702. 388.59 s [doctest] depends hspec-core-2.11.14-DBhCbi3Zj7xBuKjfoT8Xg7
  3703. 388.59 s [doctest] depends mockery-0.3.5-KNOGHAieUmoL9o3MFuASSn
  3704. 388.59 s [doctest] depends process-1.6.19.0
  3705. 388.59 s [doctest] depends silently-1.2.5.4-IDv2T3wjKRi13PP31mYrJe
  3706. 388.59 s [doctest] depends stringbuilder-0.5.1-7mJFrtGnIBlE6lWAUiKpTK
  3707. 388.59 s [doctest] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3708. 388.59 s [doctest] depends temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3709. 388.59 s [doctest] depends transformers-0.6.1.0
  3710. 388.59 s [doctest] definite doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3711. 388.59 s [doctest] depends base-4.18.3.0
  3712. 388.59 s [doctest] depends code-page-0.2.1-KL0sq19EuMI4bUG2N1N8uf
  3713. 388.59 s [doctest] depends containers-0.6.7
  3714. 388.59 s [doctest] depends deepseq-1.4.8.1
  3715. 388.59 s [doctest] depends directory-1.3.8.5
  3716. 388.59 s [doctest] depends exceptions-0.10.7
  3717. 388.59 s [doctest] depends filepath-1.4.301.0
  3718. 388.59 s [doctest] depends ghc-9.6.7
  3719. 388.59 s [doctest] depends ghc-paths-0.1.0.12-FYbNroakwr3J9PgmQPEoze
  3720. 388.59 s [doctest] depends process-1.6.19.0
  3721. 388.59 s [doctest] depends syb-0.7.2.4-1j7sl8ozD953vQbAtPT2wy
  3722. 388.59 s [doctest] depends temporary-1.3-HdHuOgtZUl4D7UgDABDcym
  3723. 388.59 s [doctest] depends transformers-0.6.1.0
  3724. 388.59 s [doctest] definite doctest-0.24.2-4hfMWkba3Ez88N2aZPTHqc-doctest
  3725. 388.59 s [doctest] depends base-4.18.3.0
  3726. 388.59 s [doctest] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3727. 388.59 s [doctest] Using Cabal-3.10.3.0 compiled by ghc-9.6
  3728. 388.59 s [doctest] Using compiler: ghc-9.6.7
  3729. 388.59 s [doctest] Using install prefix:
  3730. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2
  3731. 388.59 s [doctest] Executables installed in:
  3732. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin
  3733. 388.59 s [doctest] Libraries installed in:
  3734. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  3735. 388.59 s [doctest] Dynamic Libraries installed in:
  3736. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  3737. 388.59 s [doctest] Private executables installed in:
  3738. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/libexec/x86_64-linux-ghc-9.6.7/doctest-0.24.2
  3739. 388.59 s [doctest] Data files installed in:
  3740. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/share/x86_64-linux-ghc-9.6.7/doctest-0.24.2
  3741. 388.59 s [doctest] Documentation installed in:
  3742. 388.59 s [doctest] /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc/share/doc/doctest-0.24.2
  3743. 388.59 s [doctest] Configuration files installed in:
  3744. 388.59 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/etc
  3745. 388.59 s [doctest] No alex found
  3746. 388.59 s [doctest] Using ar found on system at:
  3747. 388.59 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  3748. 388.59 s [doctest] No c2hs found
  3749. 388.59 s [doctest] No cpphs found
  3750. 388.59 s [doctest] No doctest found
  3751. 388.59 s [doctest] Using gcc version 14.3.0 given by user at:
  3752. 388.59 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  3753. 388.59 s [doctest] Using ghc version 9.6.7 found on system at:
  3754. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  3755. 388.59 s [doctest] Using ghc-pkg version 9.6.7 found on system at:
  3756. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  3757. 388.59 s [doctest] No ghcjs found
  3758. 388.59 s [doctest] No ghcjs-pkg found
  3759. 388.59 s [doctest] No greencard found
  3760. 388.59 s [doctest] Using haddock version 2.29.2 found on system at:
  3761. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  3762. 388.59 s [doctest] No happy found
  3763. 388.59 s [doctest] Using haskell-suite found on system at: haskell-suite-dummy-location
  3764. 388.59 s [doctest] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  3765. 388.59 s [doctest] No hmake found
  3766. 388.59 s [doctest] Using hpc version 0.68 found on system at:
  3767. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  3768. 388.59 s [doctest] Using hsc2hs version 0.68.9 found on system at:
  3769. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  3770. 388.59 s [doctest] Using hscolour version 1.25 found on system at:
  3771. 388.59 s [doctest] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  3772. 388.59 s [doctest] No jhc found
  3773. 388.59 s [doctest] Using ld found on system at:
  3774. 388.59 s [doctest] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  3775. 388.59 s [doctest] No pkg-config found
  3776. 388.59 s [doctest] Using runghc version 9.6.7 found on system at:
  3777. 388.59 s [doctest] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  3778. 388.59 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12
  3779. 388.59 s [cabal-doctest] shrinking /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHScabal-doctest-1.0.12-BZEsTKfWRzc4XJOIEFKZoj-ghc9.6.7.so
  3780. 388.60 s [cabal-doctest] checking for references to /build/ in /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12...
  3781. 388.60 s [doctest] Using strip version 2.44 found on system at:
  3782. 388.60 s [doctest] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  3783. 388.60 s [doctest] Using tar found on system at:
  3784. 388.60 s [doctest] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  3785. 388.60 s [doctest] No uhc found
  3786. 388.62 s [cabal-doctest] patching script interpreter paths in /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12
  3787. 388.62 s [cabal-doctest] stripping (with command strip and flags -S -p) in /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12/lib
  3788. 388.65 s [cabal-doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc
  3789. 388.66 s [cabal-doctest] checking for references to /build/ in /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc...
  3790. 388.67 s [cabal-doctest] patching script interpreter paths in /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc
  3791. 388.76 s [cabal-doctest:post-build] Uploading to cachix cache "sellout": /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12
  3792. 389.25 s [cabal-doctest:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  3793. 389.25 s [cabal-doctest:post-build]
  3794. 389.64 s [cabal-doctest:post-build] Pushing /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc (387.13 KiB)
  3795. 389.74 s [cabal-doctest:post-build] Pushing /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12 (789.59 KiB)
  3796. 391.12 s [cabal-doctest:post-build]
  3797. 391.12 s [cabal-doctest:post-build] All done.
  3798. 391.14 s [cabal-doctest:post-build] Uploading to the NixCI cache: /nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc /nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12
  3799. 391.25 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3800. 391.40 s [cabal-doctest:post-build] copying 2 paths...
  3801. 391.40 s [cabal-doctest:post-build] copying path '/nix/store/p646blwi1g3mknxs3iwifns7rmyq0ics-cabal-doctest-1.0.12-doc' to 'https://cache.nix-ci.com'...
  3802. 391.76 s [cabal-doctest:post-build] copying path '/nix/store/wi8abvw0fnprp2b9wkz929vvkxaglh9l-cabal-doctest-1.0.12' to 'https://cache.nix-ci.com'...
  3803. 392.25 s [cabal-doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  3804. 392.50 s [cabal-doctest:post-build] copying 1 paths...
  3805. 392.50 s [cabal-doctest:post-build] copying path '/nix/store/991m8h7khjnr98msizg8rws1hlgaklxz-cabal-doctest-1.0.12.drv' to 'https://cache.nix-ci.com'...
  3806. 392.74 s Progress: 4 of 22 built (1 building), 73 of 73 downloaded from cache
  3807. 392.74 s [doctest] Phase: buildPhase
  3808. 392.74 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  3809. 392.74 s [doctest] Building test suite 'spec' for doctest-0.24.2..
  3810. 392.74 s [doctest] [ 1 of 44] Compiling Imports ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
  3811. 392.74 s [doctest] [ 2 of 44] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
  3812. 392.74 s [doctest] [ 3 of 44] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/spec/spec-tmp/Cabal/ReplOptions.o )
  3813. 392.74 s [doctest] [ 4 of 44] Compiling Cabal.ReplOptionsSpec ( test/Cabal/ReplOptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/ReplOptionsSpec.o )
  3814. 392.74 s [doctest] [ 5 of 44] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
  3815. 392.74 s [doctest] [ 6 of 44] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
  3816. 392.74 s [doctest] [ 7 of 44] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
  3817. 392.74 s [doctest] [ 8 of 44] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
  3818. 392.74 s [doctest] [ 9 of 44] Compiling Interpreter ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
  3819. 392.74 s [doctest] [10 of 44] Compiling InterpreterSpec ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
  3820. 392.74 s [doctest] [11 of 44] Compiling Info ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
  3821. 392.74 s [doctest] [12 of 44] Compiling InfoSpec ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
  3822. 392.74 s [doctest] [13 of 44] Compiling Cabal ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
  3823. 392.74 s [doctest] [14 of 44] Compiling Cabal.PathsSpec ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
  3824. 392.74 s [doctest] [15 of 44] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
  3825. 392.74 s [doctest] [16 of 44] Compiling Location ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
  3826. 392.74 s [doctest] [17 of 44] Compiling LocationSpec ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
  3827. 392.74 s [doctest] [18 of 44] Compiling Options ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
  3828. 392.74 s [doctest] [19 of 44] Compiling OptionsSpec ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
  3829. 392.74 s [doctest] [20 of 44] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
  3830. 392.74 s [doctest] [21 of 44] Compiling PackageDBsSpec ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
  3831. 392.74 s [doctest] [22 of 44] Compiling Paths_doctest ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
  3832. 392.74 s [doctest] [23 of 44] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
  3833. 392.75 s [doctest] [24 of 44] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
  3834. 392.75 s [doctest] [25 of 44] Compiling Util ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
  3835. 392.75 s [doctest] [26 of 44] Compiling Extract ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
  3836. 392.75 s [doctest] [27 of 44] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
  3837. 392.75 s [doctest] [28 of 44] Compiling Parse ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
  3838. 392.75 s [doctest] [29 of 44] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
  3839. 392.75 s [doctest] [30 of 44] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
  3840. 392.75 s [doctest] [31 of 44] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
  3841. 392.75 s [doctest] [32 of 44] Compiling Property ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
  3842. 392.75 s [doctest] [33 of 44] Compiling Runner ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
  3843. 392.75 s [doctest] [34 of 44] Compiling RunnerSpec ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
  3844. 392.75 s [doctest] [35 of 44] Compiling Run ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
  3845. 392.75 s [doctest] [36 of 44] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
  3846. 392.75 s [doctest] [37 of 44] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
  3847. 392.75 s [doctest] [38 of 44] Compiling RunSpec ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
  3848. 392.75 s [doctest] [39 of 44] Compiling MainSpec ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
  3849. 392.75 s [doctest] [40 of 44] Compiling PropertySpec ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
  3850. 392.75 s [doctest] [41 of 44] Compiling ParseSpec ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
  3851. 392.75 s [doctest] [42 of 44] Compiling ExtractSpec ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
  3852. 392.75 s [doctest] [43 of 44] Compiling UtilSpec ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
  3853. 392.75 s [doctest] [44 of 44] Compiling Main ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
  3854. 393.27 s [doctest] [45 of 45] Linking dist/build/spec/spec
  3855. 397.06 s [doctest] Preprocessing library for doctest-0.24.2..
  3856. 397.07 s [doctest] Building library for doctest-0.24.2..
  3857. 397.45 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
  3858. 397.57 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
  3859. 398.54 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.o, dist/build/Cabal/ReplOptions.dyn_o )
  3860. 398.54 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
  3861. 398.54 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
  3862. 398.54 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
  3863. 398.54 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
  3864. 398.54 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
  3865. 398.54 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
  3866. 398.54 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
  3867. 398.54 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
  3868. 398.54 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
  3869. 398.65 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
  3870. 398.68 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
  3871. 398.71 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
  3872. 398.71 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
  3873. 398.71 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
  3874. 399.23 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
  3875. 399.25 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
  3876. 399.51 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
  3877. 399.54 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
  3878. 399.83 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
  3879. 399.83 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
  3880. 400.24 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
  3881. 400.45 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
  3882. 400.48 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
  3883. 401.17 s [doctest] [ 1 of 26] Compiling Imports ( src/Imports.hs, dist/build/Imports.p_o )
  3884. 401.39 s [doctest] [ 2 of 26] Compiling GhcUtil ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
  3885. 402.25 s [doctest] [ 3 of 26] Compiling Cabal.ReplOptions ( src/Cabal/ReplOptions.hs, dist/build/Cabal/ReplOptions.p_o )
  3886. 402.30 s [doctest] [ 4 of 26] Compiling Cabal.Paths ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
  3887. 402.30 s [doctest] [ 5 of 26] Compiling Cabal.Options ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
  3888. 402.45 s [doctest] [ 6 of 26] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
  3889. 402.45 s [doctest] [ 7 of 26] Compiling Interpreter ( src/Interpreter.hs, dist/build/Interpreter.p_o )
  3890. 402.45 s [doctest] [ 8 of 26] Compiling Location ( src/Location.hs, dist/build/Location.p_o )
  3891. 402.45 s [doctest] [ 9 of 26] Compiling PackageDBs ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
  3892. 402.45 s [doctest] [10 of 26] Compiling Paths_doctest ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
  3893. 402.45 s [doctest] [11 of 26] Compiling Info ( src/Info.hs, dist/build/Info.p_o )
  3894. 402.45 s [doctest] [12 of 26] Compiling Options ( src/Options.hs, dist/build/Options.p_o )
  3895. 402.74 s [doctest] [13 of 26] Compiling Cabal ( src/Cabal.hs, dist/build/Cabal.p_o )
  3896. 402.74 s [doctest] [14 of 26] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
  3897. 402.78 s [doctest] [15 of 26] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
  3898. 402.78 s [doctest] [16 of 26] Compiling Util ( src/Util.hs, dist/build/Util.p_o )
  3899. 402.78 s [doctest] [17 of 26] Compiling Extract ( src/Extract.hs, dist/build/Extract.p_o )
  3900. 402.81 s [doctest] [18 of 26] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
  3901. 402.95 s [doctest] [19 of 26] Compiling Parse ( src/Parse.hs, dist/build/Parse.p_o )
  3902. 403.14 s [doctest] [20 of 26] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
  3903. 403.26 s [doctest] [21 of 26] Compiling Runner.Example ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
  3904. 403.49 s [doctest] [22 of 26] Compiling Property ( src/Property.hs, dist/build/Property.p_o )
  3905. 403.49 s [doctest] [23 of 26] Compiling Runner ( src/Runner.hs, dist/build/Runner.p_o )
  3906. 403.95 s [doctest] [24 of 26] Compiling Run ( src/Run.hs, dist/build/Run.p_o )
  3907. 404.17 s [doctest] [25 of 26] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
  3908. 404.29 s [doctest] [26 of 26] Compiling Test.DocTest ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
  3909. 407.26 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  3910. 407.26 s [doctest] Building executable 'doctest' for doctest-0.24.2..
  3911. 407.35 s [doctest] [1 of 2] Compiling Main ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
  3912. 407.47 s [doctest] [2 of 2] Compiling Paths_doctest ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
  3913. 407.62 s [doctest] [3 of 3] Linking dist/build/doctest/doctest
  3914. 411.20 s [doctest] Phase: checkPhase
  3915. 411.22 s [doctest] Running 1 test suites...
  3916. 411.22 s [doctest] Test suite spec: RUNNING...
  3917. 411.24 s [doctest]
  3918. 411.24 s [doctest] Extract
  3919. 411.24 s [doctest] extract
  3920. 411.27 s [doctest] extracts documentation for a top-level declaration [✔]
  3921. 411.30 s [doctest] extracts documentation from argument list [✔]
  3922. 411.32 s [doctest] extracts documentation for a type class function [✔]
  3923. 411.35 s [doctest] extracts documentation from the argument list of a type class function [✔]
  3924. 411.36 s [doctest] extracts documentation from the module header [✔]
  3925. 411.40 s [doctest] extracts documentation from imported modules [✔]
  3926. 411.41 s [doctest] extracts documentation from export list [✔]
  3927. 411.44 s [doctest] extracts documentation from named chunks [✔]
  3928. 411.46 s [doctest] returns docstrings in the same order they appear in the source [✔]
  3929. 411.47 s [doctest] extracts $setup code [✔]
  3930. 411.48 s [doctest] fails on invalid flags [✔]
  3931. 411.48 s [doctest] extract (regression tests)
  3932. 411.51 s [doctest] works with infix operators [✔]
  3933. 411.53 s [doctest] works with parallel list comprehensions [✔]
  3934. 411.54 s [doctest] works with list comprehensions in instance definitions [✔]
  3935. 411.56 s [doctest] works with foreign imports [✔]
  3936. 411.58 s [doctest] works for rewrite rules [✔]
  3937. 411.61 s [doctest] works for rewrite rules with type signatures [✔]
  3938. 411.63 s [doctest] strips CR from dos line endings [✔]
  3939. 411.67 s [doctest] works with a module that splices in an expression from an other module [✔]
  3940. 411.68 s [doctest] works for type families and GHC 7.6.1 [✔]
  3941. 411.68 s [doctest] Info
  3942. 411.68 s [doctest] formatInfo
  3943. 411.72 s [doctest] formats --info output [✔]
  3944. 411.72 s [doctest] Interpreter
  3945. 411.72 s [doctest] interpreterSupported
  3946. 411.76 s [doctest] indicates whether GHCi is supported on current platform [✔]
  3947. 411.76 s [doctest] ghcInfo
  3948. 411.81 s [doctest] includes "Have interpreter" [✔]
  3949. 411.81 s [doctest] safeEval
  3950. 411.96 s [doctest] evaluates an expression [✔]
  3951. 412.11 s [doctest] returns Left on unterminated multiline command [✔]
  3952. 412.11 s [doctest] filterExpression
  3953. 412.11 s [doctest] removes :set -XTemplateHaskell [✔]
  3954. 412.11 s [doctest] filters -XTemplateHaskell [✔]
  3955. 412.11 s [doctest] leaves :set-statement that do not set -XTemplateHaskell alone [✔]
  3956. 412.11 s [doctest] Language.Haskell.GhciWrapper
  3957. 412.11 s [doctest] evalEcho
  3958. 412.24 s [doctest] prints result to stdout [✔]
  3959. 412.24 s [doctest] evalWith
  3960. 412.24 s [doctest] with PreserveIt
  3961. 412.39 s [doctest] preserves it [✔]
  3962. 412.39 s [doctest] eval
  3963. 412.56 s [doctest] shows literals [✔]
  3964. 412.72 s [doctest] shows string literals containing Unicode [✔]
  3965. 412.92 s [doctest] evaluates simple expressions [✔]
  3966. 413.09 s [doctest] supports let bindings [✔]
  3967. 413.28 s [doctest] allows import statements [✔]
  3968. 413.43 s [doctest] captures stdout [✔]
  3969. 413.58 s [doctest] captures stdout (Unicode) [✔]
  3970. 413.78 s [doctest] captures stdout (empty line) [✔]
  3971. 413.95 s [doctest] captures stdout (multiple lines) [✔]
  3972. 414.10 s [doctest] captures stderr [✔]
  3973. 414.25 s [doctest] captures stderr (Unicode) [✔]
  3974. 414.40 s [doctest] shows exceptions [✔]
  3975. 414.55 s [doctest] shows exceptions (ExitCode) [✔]
  3976. 414.70 s [doctest] gives an error message for identifiers that are not in scope [✔]
  3977. 414.70 s [doctest] when configVerbose is True
  3978. 414.86 s [doctest] prints prompt [✔]
  3979. 414.86 s [doctest] with -XOverloadedStrings, -Wall and -Werror
  3980. 415.02 s [doctest] does not fail on marker expression (bug fix) [✔]
  3981. 415.02 s [doctest] with NoImplicitPrelude
  3982. 415.18 s [doctest] works [✔]
  3983. 415.18 s [doctest] with a strange String type
  3984. 415.34 s [doctest] works [✔]
  3985. 415.34 s [doctest] Location
  3986. 415.34 s [doctest] toLocation
  3987. 415.34 s [doctest] works for a regular SrcSpan [✔]
  3988. 415.34 s [doctest] works for a single-line SrcSpan [✔]
  3989. 415.34 s [doctest] works for a SrcSpan that corresponds to single point [✔]
  3990. 415.34 s [doctest] works for a bad SrcSpan [✔]
  3991. 415.34 s [doctest] works for a SrcLoc with bad locations [✔]
  3992. 415.34 s [doctest] enumerate
  3993. 415.34 s [doctest] replicates UnhelpfulLocation [✔]
  3994. 415.34 s [doctest] enumerates Location [✔]
  3995. 415.34 s [doctest] Main
  3996. 415.34 s [doctest] doctest
  3997. 415.52 s [doctest] testSimple [✔]
  3998. 415.73 s [doctest] it-variable [✔]
  3999. 415.99 s [doctest] it-variable in $setup [✔]
  4000. 416.18 s [doctest] failing [✔]
  4001. 416.39 s [doctest] skips subsequent examples from the same group if an example fails [✔]
  4002. 416.39 s [doctest] without --fail-fast
  4003. 416.67 s [doctest] continuous even if some tests fail [✔]
  4004. 416.67 s [doctest] with --fail-fast
  4005. 416.89 s [doctest] stops after the first failure [✔]
  4006. 417.09 s [doctest] stops after failures in $setup [✔]
  4007. 417.63 s [doctest] testImport [✔]
  4008. 417.93 s [doctest] testCommentLocation [✔]
  4009. 418.16 s [doctest] testPutStr [✔]
  4010. 418.36 s [doctest] fails on multi-line expressions, introduced with :{ [✔]
  4011. 418.59 s [doctest] testBlankline [✔]
  4012. 418.81 s [doctest] examples from the same Haddock comment share the same scope [✔]
  4013. 419.03 s [doctest] testDocumentationForArguments [✔]
  4014. 419.30 s [doctest] template-haskell [✔]
  4015. 419.52 s [doctest] handles source files with CRLF line endings [✔]
  4016. 419.73 s [doctest] runs $setup before each test group [✔]
  4017. 419.93 s [doctest] skips subsequent tests from a module, if $setup fails [✔]
  4018. 420.13 s [doctest] ignores trailing whitespace when matching test output [✔]
  4019. 420.13 s [doctest] doctest as a runner for QuickCheck properties
  4020. 420.39 s [doctest] runs a boolean property [✔]
  4021. 420.68 s [doctest] runs an explicitly quantified property [✔]
  4022. 420.97 s [doctest] runs an implicitly quantified property [✔]
  4023. 421.23 s [doctest] reports a failing property [✔]
  4024. 421.46 s [doctest] runs a boolean property with an explicit type signature [✔]
  4025. 421.85 s [doctest] runs $setup before each property [✔]
  4026. 421.85 s [doctest] doctest (regression tests)
  4027. 422.28 s [doctest] bugfixWorkingDirectory [✔]
  4028. 422.52 s [doctest] bugfixOutputToStdErr [✔]
  4029. 422.81 s [doctest] bugfixImportHierarchical [✔]
  4030. 423.11 s [doctest] bugfixMultipleModules [✔]
  4031. 423.66 s [doctest] testCPP [✔]
  4032. 424.02 s [doctest] template-haskell-bugfix [✔]
  4033. 424.20 s [doctest] doesn't clash with user bindings of stdout/stderr [✔]
  4034. 424.38 s [doctest] doesn't get confused by doctests using System.IO imports [✔]
  4035. 424.38 s [doctest] Options
  4036. 424.38 s [doctest] parseOptions
  4037. 424.38 s [doctest] strips --optghc [✔]
  4038. 424.38 s [doctest] strips --optghc= [✔]
  4039. 424.38 s [doctest] with ghc options that are not valid with --interactive
  4040. 424.39 s [doctest] returns ProxyToGhc [✔]
  4041. 424.39 s [doctest] +++ OK, passed 100 tests.
  4042. 424.39 s [doctest] with --interactive
  4043. 424.39 s [doctest] disables magic mode [✔]
  4044. 424.39 s [doctest] filters out --interactive [✔]
  4045. 424.39 s [doctest] accepts --fast [✔]
  4046. 424.39 s [doctest] --no-magic
  4047. 424.39 s [doctest] without --no-magic
  4048. 424.39 s [doctest] enables magic mode [✔]
  4049. 424.39 s [doctest] with --no-magic
  4050. 424.39 s [doctest] disables magic mode [✔]
  4051. 424.39 s [doctest] --fast
  4052. 424.39 s [doctest] without --fast
  4053. 424.39 s [doctest] disables fast mode [✔]
  4054. 424.39 s [doctest] with --fast
  4055. 424.39 s [doctest] enables fast mode [✔]
  4056. 424.39 s [doctest] --preserve-it
  4057. 424.39 s [doctest] without --preserve-it
  4058. 424.39 s [doctest] does not preserve the `it` variable [✔]
  4059. 424.39 s [doctest] with --preserve-it
  4060. 424.39 s [doctest] preserves the `it` variable [✔]
  4061. 424.39 s [doctest] --fail-fast
  4062. 424.39 s [doctest] without --fail-fast
  4063. 424.39 s [doctest] disables fail-fast mode [✔]
  4064. 424.39 s [doctest] with --fail-fast
  4065. 424.39 s [doctest] enables fail-fast mode [✔]
  4066. 424.39 s [doctest] with --help
  4067. 424.39 s [doctest] outputs usage information [✔]
  4068. 424.39 s [doctest] with --version
  4069. 424.39 s [doctest] outputs version information [✔]
  4070. 424.39 s [doctest] with --info
  4071. 424.43 s [doctest] outputs machine readable version information [✔]
  4072. 424.43 s [doctest] --verbose
  4073. 424.43 s [doctest] without --verbose
  4074. 424.43 s [doctest] is not verbose by default [✔]
  4075. 424.43 s [doctest] with --verbose
  4076. 424.43 s [doctest] parses verbose option [✔]
  4077. 424.43 s [doctest] PackageDBs
  4078. 424.43 s [doctest] getPackageDBsFromEnv
  4079. 424.43 s [doctest] uses global and user when no env used [✔]
  4080. 424.43 s [doctest] respects GHC_PACKAGE_PATH [✔]
  4081. 424.43 s [doctest] Parse
  4082. 424.43 s [doctest] extractDocTests
  4083. 424.45 s [doctest] extracts properties from a module [✔]
  4084. 424.46 s [doctest] extracts examples from a module [✔]
  4085. 424.48 s [doctest] extracts examples from documentation for non-exported names [✔]
  4086. 424.50 s [doctest] extracts multiple examples from a module [✔]
  4087. 424.52 s [doctest] returns an empty list, if documentation contains no examples [✔]
  4088. 424.55 s [doctest] sets setup code to Nothing, if it does not contain any tests [✔]
  4089. 424.57 s [doctest] keeps modules that only contain setup code [✔]
  4090. 424.57 s [doctest] parseInteractions (an internal function)
  4091. 424.57 s [doctest] parses an interaction [✔]
  4092. 424.57 s [doctest] drops whitespace as appropriate [✔]
  4093. 424.57 s [doctest] parses an interaction without a result [✔]
  4094. 424.57 s [doctest] works with a complex example [✔]
  4095. 424.57 s [doctest] attaches location information to parsed interactions [✔]
  4096. 424.57 s [doctest] basic multiline [✔]
  4097. 424.57 s [doctest] multiline align output [✔]
  4098. 424.57 s [doctest] multiline align output with >>> [✔]
  4099. 424.57 s [doctest] parses wild cards lines [✔]
  4100. 424.57 s [doctest] parses wild card chunks [✔]
  4101. 424.57 s [doctest] parseProperties (an internal function)
  4102. 424.57 s [doctest] parses a property [✔]
  4103. 424.57 s [doctest] mkLineChunks (an internal function)
  4104. 424.57 s [doctest] replaces ellipsis with WildCardChunks [✔]
  4105. 424.57 s [doctest] doesn't replace fewer than 3 consecutive dots [✔]
  4106. 424.57 s [doctest] handles leading and trailing dots [✔]
  4107. 424.57 s [doctest] handles leading and trailing ellipsis [✔]
  4108. 424.57 s [doctest] Property
  4109. 424.57 s [doctest] runProperty
  4110. 424.79 s [doctest] reports a failing property [✔]
  4111. 425.05 s [doctest] runs a Bool property [✔]
  4112. 425.28 s [doctest] runs a Bool property with an explicit type signature [✔]
  4113. 425.51 s [doctest] runs an implicitly quantified property [✔]
  4114. 425.77 s [doctest] runs an implicitly quantified property even with GHC 7.4 [✔]
  4115. 426.05 s [doctest] runs an explicitly quantified property [✔]
  4116. 426.37 s [doctest] allows to mix implicit and explicit quantification [✔]
  4117. 426.66 s [doctest] reports the value for which a property fails [✔]
  4118. 426.94 s [doctest] reports the values for which a property that takes multiple arguments fails [✔]
  4119. 427.20 s [doctest] defaults ambiguous type variables to Integer [✔]
  4120. 427.20 s [doctest] freeVariables
  4121. 427.36 s [doctest] finds a free variables in a term [✔]
  4122. 427.53 s [doctest] ignores duplicates [✔]
  4123. 427.70 s [doctest] works for terms with multiple names [✔]
  4124. 427.89 s [doctest] works for names that contain a prime [✔]
  4125. 428.06 s [doctest] works for names that are similar to other names that are in scope [✔]
  4126. 428.06 s [doctest] parseNotInScope
  4127. 428.07 s [doctest] when error message was produced by GHC 7.4.1
  4128. 428.07 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  4129. 428.07 s [doctest] ignores duplicates [✔]
  4130. 428.07 s [doctest] works for variable names that contain a prime [✔]
  4131. 428.07 s [doctest] works for error messages with suggestions [✔]
  4132. 428.07 s [doctest] when error message was produced by GHC 8.0.1
  4133. 428.07 s [doctest] extracts a variable name of variable that is not in scope from an error message [✔]
  4134. 428.07 s [doctest] ignores duplicates [✔]
  4135. 428.07 s [doctest] works for variable names that contain a prime [✔]
  4136. 428.07 s [doctest] works for error messages with suggestions [✔]
  4137. 428.07 s [doctest] Run
  4138. 428.07 s [doctest] doctest
  4139. 428.39 s [doctest] exits with ExitFailure if at least one test case fails [✔]
  4140. 428.39 s [doctest] prints help on --help [✔]
  4141. 428.39 s [doctest] prints version on --version [✔]
  4142. 428.70 s [doctest] accepts arbitrary GHC options [✔]
  4143. 428.96 s [doctest] accepts GHC options with --optghc [✔]
  4144. 429.28 s [doctest] prints a deprecation message for --optghc [✔]
  4145. 429.34 s [doctest] prints error message on invalid option [✔]
  4146. 429.59 s [doctest] interprets GHC response files [✔]
  4147. 429.82 s [doctest] prints verbose description of a specification [✔]
  4148. 430.12 s [doctest] prints verbose description of a property [✔]
  4149. 430.34 s [doctest] prints verbose error [✔]
  4150. 430.66 s [doctest] can deal with potentially problematic GHC options [✔]
  4151. 430.66 s [doctest] doctestWithResult
  4152. 430.66 s [doctest] on parse error
  4153. 430.68 s [doctest] aborts with (ExitFailure 1) [✔]
  4154. 430.70 s [doctest] prints a useful error message [✔]
  4155. 430.70 s [doctest] expandDirs
  4156. 430.70 s [doctest] expands a directory [✔]
  4157. 430.70 s [doctest] ignores files [✔]
  4158. 430.70 s [doctest] ignores random things [✔]
  4159. 430.70 s [doctest] Runner
  4160. 430.70 s [doctest] report
  4161. 430.70 s [doctest] when mode is interactive
  4162. 430.70 s [doctest] writes to stderr [✔]
  4163. 430.70 s [doctest] when mode is non-interactive
  4164. 430.70 s [doctest] writes to stderr [✔]
  4165. 430.70 s [doctest] report_
  4166. 430.70 s [doctest] when mode is interactive
  4167. 430.70 s [doctest] writes transient output to stderr [✔]
  4168. 430.70 s [doctest] when mode is non-interactive
  4169. 430.70 s [doctest] is ignored [✔]
  4170. 430.70 s [doctest] Runner.Example
  4171. 430.70 s [doctest] mkResult
  4172. 430.73 s [doctest] returns Equal when output matches [✔]
  4173. 430.73 s [doctest] +++ OK, passed 100 tests.
  4174. 430.73 s [doctest] ignores trailing whitespace [✔]
  4175. 430.73 s [doctest] with WildCardLine
  4176. 430.73 s [doctest] matches zero lines [✔]
  4177. 430.73 s [doctest] matches first zero line [✔]
  4178. 430.73 s [doctest] matches final zero line [✔]
  4179. 430.73 s [doctest] matches an arbitrary number of lines [✔]
  4180. 430.73 s [doctest] matches an arbitrary number of lines (quickcheck) [✔]
  4181. 430.73 s [doctest] +++ OK, passed 100 tests.
  4182. 430.73 s [doctest] with WildCardChunk
  4183. 430.73 s [doctest] matches an arbitrary line chunk [✔]
  4184. 430.73 s [doctest] matches an arbitrary line chunk at end [✔]
  4185. 430.73 s [doctest] does not match at end [✔]
  4186. 430.73 s [doctest] does not match at start [✔]
  4187. 430.73 s [doctest] when output does not match
  4188. 430.73 s [doctest] constructs failure message [✔]
  4189. 430.73 s [doctest] constructs failure message for multi-line output [✔]
  4190. 430.73 s [doctest] when any output line contains "unsafe" characters
  4191. 430.73 s [doctest] uses show to format output lines [✔]
  4192. 430.73 s [doctest] insert caret after last matching character on different lengths [✔]
  4193. 430.73 s [doctest] insert caret after mismatching line for multi-line output [✔]
  4194. 430.73 s [doctest] insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
  4195. 430.73 s [doctest] insert caret after longest match for wildcard [✔]
  4196. 430.73 s [doctest] show expanded pattern for long matches [✔]
  4197. 430.73 s [doctest] Util
  4198. 430.73 s [doctest] convertDosLineEndings
  4199. 430.73 s [doctest] converts CRLF to LF [✔]
  4200. 430.73 s [doctest] strips a trailing CR [✔]
  4201. 430.73 s [doctest] takeWhileEnd
  4202. 430.73 s [doctest] returns the longest suffix of elements that satisfy a given predicate [✔]
  4203. 430.73 s [doctest]
  4204. 430.73 s [doctest] Finished in 19.4944 seconds
  4205. 430.73 s [doctest] 198 examples, 0 failures
  4206. 430.75 s [doctest] Test suite spec: PASS
  4207. 430.75 s [doctest] Test suite logged to: dist/test/doctest-0.24.2-spec.log
  4208. 430.75 s [doctest] 1 of 1 test suites (1 of 1 test cases) passed.
  4209. 430.77 s [doctest] Phase: haddockPhase
  4210. 430.91 s [doctest] Preprocessing test suite 'spec' for doctest-0.24.2..
  4211. 430.92 s [doctest] Preprocessing library for doctest-0.24.2..
  4212. 430.92 s [doctest] Running Haddock on library for doctest-0.24.2..
  4213. 430.97 s [doctest] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  4214. 432.10 s [doctest] 0% ( 0 / 2) in 'Test.DocTest.Internal.Cabal'
  4215. 432.10 s [doctest] Missing documentation for:
  4216. 432.10 s [doctest] Module header
  4217. 432.10 s [doctest] doctest (src/Test/DocTest/Internal/Cabal.hs:9)
  4218. 432.10 s [doctest] 88% ( 8 / 9) in 'Test.DocTest.Internal.Location'
  4219. 432.10 s [doctest] Missing documentation for:
  4220. 432.10 s [doctest] Module header
  4221. 432.22 s [doctest] 66% ( 2 / 3) in 'Test.DocTest.Internal.Extract'
  4222. 432.22 s [doctest] Missing documentation for:
  4223. 432.22 s [doctest] Module header
  4224. 432.25 s [doctest] 22% ( 2 / 9) in 'Test.DocTest.Internal.Parse'
  4225. 432.25 s [doctest] Missing documentation for:
  4226. 432.25 s [doctest] Module header
  4227. 432.25 s [doctest] DocTest (src/Parse.hs:29)
  4228. 432.25 s [doctest] Expression (src/Parse.hs:44)
  4229. 432.25 s [doctest] ExpectedResult (src/Parse.hs:45)
  4230. 432.25 s [doctest] ExpectedLine (src/Parse.hs:38)
  4231. 432.25 s [doctest] LineChunk (src/Parse.hs:32)
  4232. 432.25 s [doctest] parseModules (src/Parse.hs:59)
  4233. 432.31 s [doctest] Warning: 'report_' is out of scope.
  4234. 432.31 s [doctest] If you qualify the identifier, haddock can try to link it anyway.
  4235. 432.35 s [doctest] 15% ( 2 / 13) in 'Test.DocTest.Internal.Run'
  4236. 432.35 s [doctest] Missing documentation for:
  4237. 432.35 s [doctest] Module header
  4238. 432.35 s [doctest] doctestWithRepl (src/Run.hs:66)
  4239. 432.35 s [doctest] Config (src/Options.hs:58)
  4240. 432.35 s [doctest] defaultConfig (src/Options.hs:67)
  4241. 432.35 s [doctest] doctestWith (src/Run.hs:136)
  4242. 432.35 s [doctest] Result (src/Run.hs:139)
  4243. 432.35 s [doctest] formatSummary (src/Runner.hs:57)
  4244. 432.35 s [doctest] isSuccess (src/Runner.hs:54)
  4245. 432.35 s [doctest] evaluateResult (src/Run.hs:141)
  4246. 432.35 s [doctest] doctestWithResult (src/Run.hs:144)
  4247. 432.35 s [doctest] runDocTests (src/Run.hs:154)
  4248. 432.35 s [doctest] 50% ( 1 / 2) in 'Test.DocTest'
  4249. 432.35 s [doctest] Missing documentation for:
  4250. 432.35 s [doctest] Module header
  4251. 440.39 s [doctest] Documentation created: dist/doc/html/doctest/,
  4252. 440.39 s [doctest] dist/doc/html/doctest/doctest.txt
  4253. 440.45 s [doctest] Preprocessing executable 'doctest' for doctest-0.24.2..
  4254. 440.46 s [doctest] Phase: installPhase
  4255. 440.51 s [doctest] Installing library in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4256. 440.63 s [doctest] Installing executable doctest in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin
  4257. 440.63 s [doctest] Warning: The directory
  4258. 440.63 s [doctest] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin is not in the
  4259. 440.63 s [doctest] system search path.
  4260. 441.19 s [doctest] Phase: fixupPhase
  4261. 441.20 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2
  4262. 441.21 s [doctest] shrinking /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSdoctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF-ghc9.6.7.so
  4263. 441.23 s [doctest] shrinking /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  4264. 441.32 s [doctest] checking for references to /build/ in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2...
  4265. 441.40 s [doctest] patching script interpreter paths in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2
  4266. 441.41 s [doctest] stripping (with command strip and flags -S -p) in /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/lib /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin
  4267. 441.64 s [doctest] shrinking RPATHs of ELF executables and libraries in /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc
  4268. 441.65 s [doctest] checking for references to /build/ in /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc...
  4269. 441.67 s [doctest] patching script interpreter paths in /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc
  4270. 441.87 s [doctest:post-build] Uploading to cachix cache "sellout": /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2
  4271. 442.35 s [doctest:post-build] Pushing 2 paths (82 are already present) using zstd to cache sellout ⏳
  4272. 442.35 s [doctest:post-build]
  4273. 442.70 s [doctest:post-build] Pushing /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2 (66.25 MiB)
  4274. 442.77 s [doctest:post-build] Pushing /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc (1.55 MiB)
  4275. 446.33 s [doctest:post-build]
  4276. 446.37 s [doctest:post-build] All done.
  4277. 446.37 s [doctest:post-build] Uploading to the NixCI cache: /nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2
  4278. 446.39 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4279. 446.65 s [doctest:post-build] copying 2 paths...
  4280. 446.65 s [doctest:post-build] copying path '/nix/store/c7iwrp8gb3gj9rsxlpmbcvzmj579f796-doctest-0.24.2-doc' to 'https://cache.nix-ci.com'...
  4281. 447.12 s [doctest:post-build] copying path '/nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2' to 'https://cache.nix-ci.com'...
  4282. 468.61 s [doctest:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4283. 468.87 s [doctest:post-build] copying 1 paths...
  4284. 468.91 s [doctest:post-build] copying path '/nix/store/h2jfa2vyl9w9h8524glcaag9mwvgm7l8-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  4285. 469.11 s Progress: 5 of 22 built, 73 of 73 downloaded from cache
  4286. 469.15 s Building /nix/store/dbh8imklsp5lq14a5gfrhghaf18cqw5j-duoids-0.0.1.0.drv
  4287. 469.19 s Building /nix/store/30q2qqbzic7i0d639bhlldx0x7w5dxzm-vector-0.13.2.0.drv
  4288. 469.25 s [duoids] Phase: setupCompilerEnvironmentPhase
  4289. 469.26 s [duoids] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  4290. 469.32 s [vector] Phase: setupCompilerEnvironmentPhase
  4291. 469.32 s [vector] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  4292. 469.40 s [duoids] Phase: unpackPhase
  4293. 469.41 s [duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./core
  4294. 469.42 s [duoids] source root is core
  4295. 469.42 s [duoids] Phase: patchPhase
  4296. 469.43 s [duoids] Phase: compileBuildDriverPhase
  4297. 469.44 s [duoids] setupCompileFlags: -package-db=/build/tmp.fA0xOLSNyi/setup-package.conf.d -threaded
  4298. 469.48 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.fA0xOLSNyi/Main.o )
  4299. 469.50 s [vector] Phase: unpackPhase
  4300. 469.52 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  4301. 469.53 s [vector] source root is vector-0.13.2.0
  4302. 469.53 s [duoids] [2 of 2] Linking Setup
  4303. 469.54 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  4304. 469.54 s [vector] Phase: patchPhase
  4305. 469.57 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  4306. 469.58 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  4307. 469.60 s [vector] Phase: compileBuildDriverPhase
  4308. 469.61 s [vector] setupCompileFlags: -package-db=/build/tmp.OGbDfH9mH8/setup-package.conf.d -threaded
  4309. 469.66 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.OGbDfH9mH8/Main.o )
  4310. 469.71 s [vector] [2 of 2] Linking Setup
  4311. 470.90 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  4312. 470.91 s [duoids] Phase: configurePhase
  4313. 470.99 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  4314. 471.00 s [vector] Phase: configurePhase
  4315. 471.10 s [duoids] configureFlags: --verbose --prefix=/nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.fA0xOLSNyi/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  4316. 471.10 s [vector] configureFlags: --verbose --prefix=/nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.OGbDfH9mH8/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  4317. 471.11 s [duoids] Using Parsec parser
  4318. 471.11 s [duoids] Configuring duoids-0.0.1.0...
  4319. 471.11 s [vector] Using Parsec parser
  4320. 471.11 s [vector] Configuring vector-0.13.2.0...
  4321. 471.43 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  4322. 471.45 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  4323. 471.45 s [vector] wall=False
  4324. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4325. 471.45 s [vector] Dependency deepseq: using deepseq-1.4.8.1
  4326. 471.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  4327. 471.45 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  4328. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4329. 471.45 s [vector] Dependency random: using random-1.2.1.3
  4330. 471.45 s [vector] Dependency tasty: using tasty-1.5.3
  4331. 471.45 s [vector] Dependency vector: using vector-0.13.2.0
  4332. 471.45 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  4333. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4334. 471.45 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  4335. 471.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  4336. 471.45 s [vector] Dependency random: using random-1.2.1.3
  4337. 471.45 s [vector] Dependency tasty: using tasty-1.5.3
  4338. 471.45 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  4339. 471.45 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  4340. 471.45 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  4341. 471.45 s [vector] Dependency transformers: using transformers-0.6.1.0
  4342. 471.45 s [vector] Dependency vector: using vector-0.13.2.0
  4343. 471.45 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  4344. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4345. 471.45 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  4346. 471.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  4347. 471.45 s [vector] Dependency random: using random-1.2.1.3
  4348. 471.45 s [vector] Dependency tasty: using tasty-1.5.3
  4349. 471.45 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  4350. 471.45 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  4351. 471.45 s [vector] Dependency template-haskell: using template-haskell-2.20.0.0
  4352. 471.45 s [vector] Dependency transformers: using transformers-0.6.1.0
  4353. 471.45 s [vector] Dependency vector: using vector-0.13.2.0
  4354. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4355. 471.45 s [vector] Dependency doctest: using doctest-0.24.2
  4356. 471.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  4357. 471.45 s [vector] Dependency vector: using vector-0.13.2.0
  4358. 471.45 s [vector] Dependency base: using base-4.18.3.0
  4359. 471.45 s [vector] Dependency primitive: using primitive-0.9.1.0
  4360. 471.45 s [vector] Dependency tasty: using tasty-1.5.3
  4361. 471.45 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  4362. 471.45 s [vector] Dependency vector: using vector-0.13.2.0
  4363. 471.93 s [vector] Source component graph:
  4364. 471.93 s [vector] component lib
  4365. 471.93 s [vector] component lib:benchmarks-O2 dependency lib
  4366. 471.93 s [vector] component test:vector-doctest dependency lib
  4367. 471.93 s [vector] component test:vector-inspection dependency lib
  4368. 471.93 s [vector] component test:vector-tests-O0 dependency lib
  4369. 471.93 s [vector] component test:vector-tests-O2 dependency lib
  4370. 471.94 s [vector] Configured component graph:
  4371. 471.94 s [vector] component vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4372. 471.94 s [vector] include base-4.18.3.0
  4373. 471.94 s [vector] include deepseq-1.4.8.1
  4374. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4375. 471.94 s [vector] include vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  4376. 471.94 s [vector] component vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  4377. 471.94 s [vector] include base-4.18.3.0
  4378. 471.94 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4379. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4380. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4381. 471.94 s [vector] component vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  4382. 471.94 s [vector] include base-4.18.3.0
  4383. 471.94 s [vector] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4384. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4385. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4386. 471.94 s [vector] component vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  4387. 471.94 s [vector] include base-4.18.3.0
  4388. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4389. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4390. 471.94 s [vector] include tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  4391. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4392. 471.94 s [vector] component vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  4393. 471.94 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4394. 471.94 s [vector] include base-4.18.3.0
  4395. 471.94 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4396. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4397. 471.94 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4398. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4399. 471.94 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4400. 471.94 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4401. 471.94 s [vector] include template-haskell-2.20.0.0
  4402. 471.94 s [vector] include transformers-0.6.1.0
  4403. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4404. 471.94 s [vector] component vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  4405. 471.94 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4406. 471.94 s [vector] include base-4.18.3.0
  4407. 471.94 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4408. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4409. 471.94 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4410. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4411. 471.94 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4412. 471.94 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4413. 471.94 s [vector] include template-haskell-2.20.0.0
  4414. 471.94 s [vector] include transformers-0.6.1.0
  4415. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4416. 471.94 s [vector] Linked component graph:
  4417. 471.94 s [vector] unit vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4418. 471.94 s [vector] include base-4.18.3.0
  4419. 471.94 s [vector] include deepseq-1.4.8.1
  4420. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4421. 471.94 s [vector] include vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  4422. 471.94 s [vector] Data.Vector=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I:Data.Vector.Unboxed.Mutable
  4423. 471.94 s [vector] unit vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  4424. 471.94 s [vector] include base-4.18.3.0
  4425. 471.94 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4426. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4427. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4428. 471.94 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2:Bench.Vector.TestData.ParenTree
  4429. 471.94 s [vector] unit vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  4430. 471.94 s [vector] include base-4.18.3.0
  4431. 471.94 s [vector] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4432. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4433. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4434. 471.94 s [vector] unit vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  4435. 471.94 s [vector] include base-4.18.3.0
  4436. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4437. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4438. 471.94 s [vector] include tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  4439. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4440. 471.94 s [vector] unit vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  4441. 471.94 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4442. 471.94 s [vector] include base-4.18.3.0
  4443. 471.94 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4444. 471.94 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4445. 471.94 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4446. 471.94 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4447. 471.94 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4448. 471.94 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4449. 471.94 s [vector] include template-haskell-2.20.0.0
  4450. 471.94 s [vector] include transformers-0.6.1.0
  4451. 471.94 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4452. 471.94 s [vector] unit vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  4453. 471.94 s [vector] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4454. 471.94 s [vector] include base-4.18.3.0
  4455. 471.97 s [vector] include base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4456. 471.97 s [vector] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4457. 471.97 s [vector] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4458. 471.97 s [vector] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4459. 471.97 s [vector] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4460. 471.97 s [vector] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4461. 471.97 s [vector] include template-haskell-2.20.0.0
  4462. 471.97 s [vector] include transformers-0.6.1.0
  4463. 471.97 s [vector] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4464. 471.97 s [vector] Ready component graph:
  4465. 471.97 s [vector] definite vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4466. 471.97 s [vector] depends base-4.18.3.0
  4467. 471.97 s [vector] depends deepseq-1.4.8.1
  4468. 471.97 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4469. 471.97 s [vector] depends vector-stream-0.1.0.1-7qX9oQxWHCz9yDWW5CqJnq
  4470. 471.97 s [vector] definite vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  4471. 471.97 s [vector] depends base-4.18.3.0
  4472. 471.97 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4473. 471.97 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4474. 471.97 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4475. 471.97 s [vector] definite vector-0.13.2.0-8LOelnSUdEBA96wwEHnFX5-vector-tests-O2
  4476. 471.97 s [vector] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4477. 471.97 s [vector] depends base-4.18.3.0
  4478. 471.97 s [vector] depends base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4479. 471.97 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4480. 471.97 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4481. 471.97 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4482. 471.97 s [vector] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4483. 471.97 s [vector] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4484. 471.97 s [vector] depends template-haskell-2.20.0.0
  4485. 471.97 s [vector] depends transformers-0.6.1.0
  4486. 471.97 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4487. 471.97 s [vector] definite vector-0.13.2.0-CdRaf8rd0cN250Lun0s1xX-vector-tests-O0
  4488. 471.97 s [vector] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  4489. 471.97 s [vector] depends base-4.18.3.0
  4490. 471.97 s [vector] depends base-orphans-0.9.3-4XU5Y5cR9qABDCj5ujzp1o
  4491. 471.97 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4492. 471.97 s [vector] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  4493. 471.97 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4494. 471.97 s [vector] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  4495. 471.97 s [vector] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  4496. 471.97 s [vector] depends template-haskell-2.20.0.0
  4497. 471.97 s [vector] depends transformers-0.6.1.0
  4498. 471.97 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4499. 471.97 s [vector] definite vector-0.13.2.0-LnTwbj1fD5P548jgjJP8km-vector-inspection
  4500. 471.97 s [vector] depends base-4.18.3.0
  4501. 471.97 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4502. 471.97 s [vector] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  4503. 471.97 s [vector] depends tasty-inspection-testing-0.2.1-Az6JDTbWQZ44em03VPnfTo
  4504. 471.97 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4505. 471.97 s [vector] definite vector-0.13.2.0-LrI0dkKApwzC3Hsdwz2nAc-vector-doctest
  4506. 471.97 s [vector] depends base-4.18.3.0
  4507. 471.97 s [vector] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4508. 471.97 s [vector] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  4509. 471.97 s [vector] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4510. 471.97 s [vector] Using Cabal-3.10.3.0 compiled by ghc-9.6
  4511. 471.97 s [vector] Using compiler: ghc-9.6.7
  4512. 471.97 s [vector] Using install prefix:
  4513. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  4514. 471.97 s [vector] Executables installed in:
  4515. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/bin
  4516. 471.97 s [vector] Libraries installed in:
  4517. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  4518. 471.97 s [vector] Dynamic Libraries installed in:
  4519. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  4520. 471.97 s [vector] Private executables installed in:
  4521. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  4522. 471.97 s [vector] Data files installed in:
  4523. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/share/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  4524. 471.97 s [vector] Documentation installed in:
  4525. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.6.7/vector-0.13.2.0
  4526. 471.97 s [vector] Configuration files installed in:
  4527. 471.97 s [vector] /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/etc
  4528. 471.97 s [vector] No alex found
  4529. 471.97 s [vector] Using ar found on system at:
  4530. 471.97 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4531. 471.97 s [vector] No c2hs found
  4532. 471.97 s [vector] No cpphs found
  4533. 471.97 s [vector] Using doctest version 0.24.2 found on system at:
  4534. 471.97 s [vector] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  4535. 471.97 s [vector] Using gcc version 14.3.0 given by user at:
  4536. 471.97 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4537. 471.97 s [vector] Using ghc version 9.6.7 found on system at:
  4538. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  4539. 471.97 s [vector] Using ghc-pkg version 9.6.7 found on system at:
  4540. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  4541. 471.97 s [vector] No ghcjs found
  4542. 471.97 s [vector] No ghcjs-pkg found
  4543. 471.97 s [vector] No greencard found
  4544. 471.97 s [vector] Using haddock version 2.29.2 found on system at:
  4545. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  4546. 471.97 s [vector] No happy found
  4547. 471.97 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  4548. 471.97 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4549. 471.97 s [vector] No hmake found
  4550. 471.97 s [vector] Using hpc version 0.68 found on system at:
  4551. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  4552. 471.97 s [vector] Using hsc2hs version 0.68.9 found on system at:
  4553. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  4554. 471.97 s [vector] Using hscolour version 1.25 found on system at:
  4555. 471.97 s [vector] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  4556. 471.97 s [vector] No jhc found
  4557. 471.97 s [vector] Using ld found on system at:
  4558. 471.97 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4559. 471.97 s [vector] No pkg-config found
  4560. 471.97 s [vector] Using runghc version 9.6.7 found on system at:
  4561. 471.97 s [vector] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  4562. 471.97 s [vector] Using strip version 2.44 found on system at:
  4563. 471.97 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4564. 471.97 s [vector] Using tar found on system at:
  4565. 471.97 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4566. 471.97 s [vector] No uhc found
  4567. 471.97 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4568. 471.97 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4569. 471.97 s [duoids] <4.23: using base-4.18.3.0
  4570. 471.97 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4571. 471.97 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4572. 471.97 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4573. 471.97 s [duoids] <4.23: using base-4.18.3.0
  4574. 471.97 s [duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  4575. 471.97 s [duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  4576. 471.97 s [duoids] doctest-0.24.2
  4577. 471.97 s [duoids] Dependency duoids: using duoids-0.0.1.0
  4578. 471.97 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4579. 471.97 s [duoids] Source component graph:
  4580. 471.97 s [duoids] component lib
  4581. 471.98 s [duoids] component test:doctests dependency lib
  4582. 471.98 s [duoids] Configured component graph:
  4583. 471.98 s [duoids] component duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4584. 471.98 s [duoids] include base-4.18.3.0
  4585. 471.98 s [duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4586. 471.98 s [duoids] component duoids-0.0.1.0-ECRVEQeoCeVGu7oK6bTdoZ-doctests
  4587. 471.98 s [duoids] include base-4.18.3.0
  4588. 471.98 s [duoids] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4589. 471.98 s [duoids] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4590. 471.98 s [duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4591. 471.98 s [duoids] Linked component graph:
  4592. 471.98 s [duoids] unit duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4593. 471.98 s [duoids] include base-4.18.3.0
  4594. 471.98 s [duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4595. 471.98 s [duoids] Control.Duoidal=duoids-0.0.1.0-105u05r7TW2MRcOyPjMls:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-105u05r7TW2MRcOyPjMls:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-105u05r7TW2MRcOyPjMls:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-105u05r7TW2MRcOyPjMls:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-105u05r7TW2MRcOyPjMls:Data.Duoid.Laws
  4596. 471.98 s [duoids] unit duoids-0.0.1.0-ECRVEQeoCeVGu7oK6bTdoZ-doctests
  4597. 471.98 s [duoids] include base-4.18.3.0
  4598. 471.98 s [duoids] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4599. 471.98 s [duoids] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4600. 471.98 s [duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4601. 471.98 s [duoids] Ready component graph:
  4602. 471.98 s [duoids] definite duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4603. 471.98 s [duoids] depends base-4.18.3.0
  4604. 471.98 s [duoids] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4605. 471.98 s [duoids] definite duoids-0.0.1.0-ECRVEQeoCeVGu7oK6bTdoZ-doctests
  4606. 471.98 s [duoids] depends base-4.18.3.0
  4607. 471.98 s [duoids] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4608. 471.98 s [duoids] depends duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4609. 471.98 s [duoids] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4610. 471.98 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.6
  4611. 471.98 s [duoids] Using compiler: ghc-9.6.7
  4612. 471.98 s [duoids] Using install prefix:
  4613. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0
  4614. 471.98 s [duoids] Executables installed in:
  4615. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/bin
  4616. 471.98 s [duoids] Libraries installed in:
  4617. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4618. 471.98 s [duoids] Dynamic Libraries installed in:
  4619. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  4620. 471.98 s [duoids] Private executables installed in:
  4621. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.6.7/duoids-0.0.1.0
  4622. 471.98 s [duoids] Data files installed in:
  4623. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/share/x86_64-linux-ghc-9.6.7/duoids-0.0.1.0
  4624. 471.98 s [duoids] Documentation installed in:
  4625. 471.98 s [duoids] /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  4626. 471.98 s [duoids] Configuration files installed in:
  4627. 471.98 s [duoids] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/etc
  4628. 471.98 s [duoids] No alex found
  4629. 471.98 s [duoids] Using ar found on system at:
  4630. 471.98 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4631. 471.98 s [duoids] No c2hs found
  4632. 471.98 s [duoids] No cpphs found
  4633. 471.98 s [duoids] Using doctest version 0.24.2 found on system at:
  4634. 471.98 s [duoids] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  4635. 471.98 s [duoids] Using gcc version 14.3.0 given by user at:
  4636. 471.98 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4637. 471.98 s [duoids] Using ghc version 9.6.7 found on system at:
  4638. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  4639. 471.98 s [duoids] Using ghc-pkg version 9.6.7 found on system at:
  4640. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  4641. 471.98 s [duoids] No ghcjs found
  4642. 471.98 s [duoids] No ghcjs-pkg found
  4643. 471.98 s [duoids] No greencard found
  4644. 471.98 s [duoids] Using haddock version 2.29.2 found on system at:
  4645. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  4646. 471.98 s [duoids] No happy found
  4647. 471.98 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  4648. 471.98 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4649. 471.98 s [duoids] No hmake found
  4650. 471.98 s [duoids] Using hpc version 0.68 found on system at:
  4651. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  4652. 471.98 s [duoids] Using hsc2hs version 0.68.9 found on system at:
  4653. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  4654. 471.98 s [duoids] Using hscolour version 1.25 found on system at:
  4655. 471.98 s [duoids] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  4656. 471.98 s [duoids] No jhc found
  4657. 471.98 s [duoids] Using ld found on system at:
  4658. 471.98 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4659. 471.98 s [duoids] No pkg-config found
  4660. 471.98 s [duoids] Using runghc version 9.6.7 found on system at:
  4661. 471.98 s [duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  4662. 471.98 s [duoids] Using strip version 2.44 found on system at:
  4663. 471.98 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4664. 471.98 s [duoids] Using tar found on system at:
  4665. 471.98 s [duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4666. 471.98 s [duoids] No uhc found
  4667. 472.23 s [duoids] Phase: buildPhase
  4668. 472.28 s [vector] Phase: buildPhase
  4669. 472.30 s [duoids] Preprocessing library for duoids-0.0.1.0...
  4670. 472.30 s [duoids] Building library for duoids-0.0.1.0...
  4671. 472.39 s [vector] Preprocessing library for vector-0.13.2.0..
  4672. 472.39 s [vector] Building library for vector-0.13.2.0..
  4673. 472.45 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  4674. 473.07 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  4675. 473.08 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 )
  4676. 473.25 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 )
  4677. 473.29 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 )
  4678. 473.55 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 )
  4679. 473.55 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 )
  4680. 473.55 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 )
  4681. 473.55 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 )
  4682. 475.32 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  4683. 477.30 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  4684. 477.44 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  4685. 477.44 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  4686. 477.64 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  4687. 478.22 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  4688. 479.78 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 )
  4689. 480.23 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  4690. 482.52 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  4691. 482.64 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  4692. 482.64 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  4693. 483.26 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 )
  4694. 485.29 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4695. 485.29 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  4696. 485.39 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  4697. 485.82 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  4698. 486.36 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 )
  4699. 486.43 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  4700. 486.89 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 )
  4701. 490.11 s [duoids] Phase: checkPhase
  4702. 490.43 s [duoids] Running 1 test suites...
  4703. 490.43 s [duoids] Test suite doctests: RUNNING...
  4704. 490.94 s [duoids]
  4705. 490.99 s [duoids] on the commandline: warning:
  4706. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4707. 490.99 s [duoids]
  4708. 490.99 s [duoids] on the commandline: warning:
  4709. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4710. 490.99 s [duoids]
  4711. 490.99 s [duoids] on the commandline: warning:
  4712. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4713. 490.99 s [duoids]
  4714. 490.99 s [duoids] on the commandline: warning:
  4715. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4716. 490.99 s [duoids]
  4717. 490.99 s [duoids] on the commandline: warning:
  4718. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4719. 490.99 s [duoids]
  4720. 490.99 s [duoids] on the commandline: warning:
  4721. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4722. 490.99 s [duoids]
  4723. 490.99 s [duoids] on the commandline: warning:
  4724. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4725. 490.99 s [duoids]
  4726. 490.99 s [duoids] on the commandline: warning:
  4727. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4728. 490.99 s [duoids]
  4729. 490.99 s [duoids] on the commandline: warning:
  4730. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4731. 490.99 s [duoids]
  4732. 490.99 s [duoids] on the commandline: warning:
  4733. 490.99 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  4734. 492.51 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  4735. 492.57 s [duoids] NameLib Nothing
  4736. 492.57 s [duoids] ----------------------------------------
  4737. 492.58 s [duoids] Test suite doctests: PASS
  4738. 492.58 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  4739. 492.58 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  4740. 492.60 s [duoids] Phase: haddockPhase
  4741. 492.77 s [duoids] Preprocessing library for duoids-0.0.1.0...
  4742. 492.77 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  4743. 493.16 s [duoids] Warning: 'cancel' is out of scope.
  4744. 493.16 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4745. 493.16 s [duoids] Warning: 'Applicative' is out of scope.
  4746. 493.16 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4747. 493.16 s [duoids] Warning: 'Alternative' is out of scope.
  4748. 493.16 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4749. 493.65 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  4750. 493.94 s [duoids] Warning: 'ExceptT' is out of scope.
  4751. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4752. 493.94 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  4753. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4754. 493.94 s [duoids] Warning: 'Validation' is out of scope.
  4755. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4756. 493.94 s [duoids] Warning: 'fail' is out of scope.
  4757. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4758. 493.94 s [duoids] Warning: 'MonadFail' is out of scope.
  4759. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4760. 493.94 s [duoids] Warning: 'Writer' is out of scope.
  4761. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4762. 493.94 s [duoids] Warning: 'Set' is out of scope.
  4763. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4764. 493.94 s [duoids] Warning: 'Char' is out of scope.
  4765. 493.94 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4766. 493.95 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  4767. 494.42 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  4768. 494.44 s [duoids] Warning: 'Normal' is out of scope.
  4769. 494.44 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  4770. 494.44 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  4771. 494.47 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  4772. 496.08 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 )
  4773. 496.13 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  4774. 504.64 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  4775. 504.74 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  4776. 504.76 s [duoids] Phase: installPhase
  4777. 504.86 s [duoids] Installing library in /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4778. 505.49 s [duoids] Phase: fixupPhase
  4779. 505.50 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0
  4780. 505.51 s [duoids] shrinking /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSduoids-0.0.1.0-105u05r7TW2MRcOyPjMls-ghc9.6.7.so
  4781. 505.51 s [duoids] checking for references to /build/ in /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0...
  4782. 505.55 s [duoids] patching script interpreter paths in /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0
  4783. 505.55 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/lib
  4784. 505.70 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc
  4785. 505.70 s [duoids] checking for references to /build/ in /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc...
  4786. 505.73 s [duoids] patching script interpreter paths in /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc
  4787. 505.98 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0
  4788. 507.14 s [duoids:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  4789. 507.14 s [duoids:post-build]
  4790. 507.51 s [duoids:post-build] Pushing /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0 (8.24 MiB)
  4791. 507.71 s [duoids:post-build] Pushing /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc (2.15 MiB)
  4792. 509.00 s [duoids:post-build]
  4793. 509.00 s [duoids:post-build] All done.
  4794. 509.10 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0
  4795. 509.39 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4796. 509.44 s [duoids:post-build] copying 2 paths...
  4797. 509.44 s [duoids:post-build] copying path '/nix/store/h17bsvr2vv9kcrj5kmrnymllhmy5w014-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  4798. 510.17 s [duoids:post-build] copying path '/nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  4799. 513.48 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  4800. 513.78 s [duoids:post-build] copying 1 paths...
  4801. 513.78 s [duoids:post-build] copying path '/nix/store/dbh8imklsp5lq14a5gfrhghaf18cqw5j-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  4802. 514.21 s Progress: 6 of 22 built (1 building), 73 of 73 downloaded from cache
  4803. 514.28 s Building /nix/store/rfdk71wrmdphdxqyzsawanbm9j2bpki2-duoidal-transformers-0.0.1.0.drv
  4804. 514.36 s Building /nix/store/4w1v7w3iz7cl4524iwrc9jvvgishz42l-duoids-hedgehog-0.0.1.0.drv
  4805. 514.36 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 )
  4806. 514.36 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 )
  4807. 514.36 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 )
  4808. 514.36 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 )
  4809. 514.36 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 )
  4810. 514.36 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 )
  4811. 514.36 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 )
  4812. 514.39 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  4813. 514.39 s [duoidal-transformers] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  4814. 514.56 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  4815. 514.57 s [duoids-hedgehog] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  4816. 514.70 s [duoidal-transformers] Phase: unpackPhase
  4817. 514.71 s [duoidal-transformers] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./transformers
  4818. 514.71 s [duoidal-transformers] source root is transformers
  4819. 514.73 s [duoidal-transformers] Phase: patchPhase
  4820. 514.74 s [duoidal-transformers] Phase: compileBuildDriverPhase
  4821. 514.74 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.UOgTHExzKC/setup-package.conf.d -threaded
  4822. 514.86 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.UOgTHExzKC/Main.o )
  4823. 514.93 s [duoids-hedgehog] Phase: unpackPhase
  4824. 514.94 s [duoids-hedgehog] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./hedgehog
  4825. 514.95 s [duoids-hedgehog] source root is hedgehog
  4826. 514.96 s [duoidal-transformers] [2 of 2] Linking Setup
  4827. 514.98 s [duoids-hedgehog] Phase: patchPhase
  4828. 514.99 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  4829. 514.99 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.JyuxMQbQlM/setup-package.conf.d -threaded
  4830. 515.09 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JyuxMQbQlM/Main.o )
  4831. 515.19 s [duoids-hedgehog] [2 of 2] Linking Setup
  4832. 517.05 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  4833. 517.06 s [duoidal-transformers] Phase: configurePhase
  4834. 517.07 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.UOgTHExzKC/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  4835. 517.09 s [duoidal-transformers] Using Parsec parser
  4836. 517.09 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  4837. 517.27 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  4838. 517.29 s [duoids-hedgehog] Phase: configurePhase
  4839. 517.30 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.JyuxMQbQlM/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  4840. 517.33 s [duoids-hedgehog] Using Parsec parser
  4841. 517.34 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  4842. 517.63 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  4843. 517.91 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  4844. 518.25 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4845. 518.25 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4846. 518.25 s [duoidal-transformers] <4.23: using base-4.18.3.0
  4847. 518.25 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4848. 518.25 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4849. 518.25 s [duoidal-transformers] Dependency transformers >=0.5.6 && <0.6 || >=0.6.1 && <0.7: using
  4850. 518.25 s [duoidal-transformers] transformers-0.6.1.0
  4851. 518.25 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4852. 518.25 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4853. 518.25 s [duoidal-transformers] <4.23: using base-4.18.3.0
  4854. 518.25 s [duoidal-transformers] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  4855. 518.25 s [duoidal-transformers] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  4856. 518.25 s [duoidal-transformers] doctest-0.24.2
  4857. 518.25 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  4858. 518.25 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4859. 518.25 s [duoidal-transformers] Source component graph:
  4860. 518.25 s [duoidal-transformers] component lib
  4861. 518.25 s [duoidal-transformers] component test:doctests dependency lib
  4862. 518.25 s [duoidal-transformers] Configured component graph:
  4863. 518.25 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4864. 518.25 s [duoidal-transformers] include base-4.18.3.0
  4865. 518.25 s [duoidal-transformers] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4866. 518.25 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4867. 518.25 s [duoidal-transformers] include transformers-0.6.1.0
  4868. 518.25 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-EwwelHJcMk197ai0rWolQc-doctests
  4869. 518.25 s [duoidal-transformers] include base-4.18.3.0
  4870. 518.25 s [duoidal-transformers] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4871. 518.25 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4872. 518.25 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4873. 518.25 s [duoidal-transformers] Linked component graph:
  4874. 518.25 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4875. 518.25 s [duoidal-transformers] include base-4.18.3.0
  4876. 518.25 s [duoidal-transformers] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4877. 518.25 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4878. 518.25 s [duoidal-transformers] include transformers-0.6.1.0
  4879. 518.25 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT:Control.Duoidal.Trans.Orphans
  4880. 518.25 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-EwwelHJcMk197ai0rWolQc-doctests
  4881. 518.25 s [duoidal-transformers] include base-4.18.3.0
  4882. 518.25 s [duoidal-transformers] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4883. 518.25 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4884. 518.25 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4885. 518.25 s [duoidal-transformers] Ready component graph:
  4886. 518.25 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4887. 518.25 s [duoidal-transformers] depends base-4.18.3.0
  4888. 518.25 s [duoidal-transformers] depends duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4889. 518.25 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4890. 518.25 s [duoidal-transformers] depends transformers-0.6.1.0
  4891. 518.25 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-EwwelHJcMk197ai0rWolQc-doctests
  4892. 518.25 s [duoidal-transformers] depends base-4.18.3.0
  4893. 518.25 s [duoidal-transformers] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4894. 518.25 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4895. 518.25 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4896. 518.25 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.6
  4897. 518.25 s [duoidal-transformers] Using compiler: ghc-9.6.7
  4898. 518.25 s [duoidal-transformers] Using install prefix:
  4899. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0
  4900. 518.25 s [duoidal-transformers] Executables installed in:
  4901. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/bin
  4902. 518.25 s [duoidal-transformers] Libraries installed in:
  4903. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  4904. 518.25 s [duoidal-transformers] Dynamic Libraries installed in:
  4905. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  4906. 518.25 s [duoidal-transformers] Private executables installed in:
  4907. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.6.7/duoidal-transformers-0.0.1.0
  4908. 518.25 s [duoidal-transformers] Data files installed in:
  4909. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.6.7/duoidal-transformers-0.0.1.0
  4910. 518.25 s [duoidal-transformers] Documentation installed in:
  4911. 518.25 s [duoidal-transformers] /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  4912. 518.25 s [duoidal-transformers] Configuration files installed in:
  4913. 518.25 s [duoidal-transformers] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/etc
  4914. 518.25 s [duoidal-transformers] No alex found
  4915. 518.25 s [duoidal-transformers] Using ar found on system at:
  4916. 518.25 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  4917. 518.25 s [duoidal-transformers] No c2hs found
  4918. 518.25 s [duoidal-transformers] No cpphs found
  4919. 518.25 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  4920. 518.25 s [duoidal-transformers] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  4921. 518.25 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  4922. 518.25 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  4923. 518.25 s [duoidal-transformers] Using ghc version 9.6.7 found on system at:
  4924. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  4925. 518.25 s [duoidal-transformers] Using ghc-pkg version 9.6.7 found on system at:
  4926. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  4927. 518.25 s [duoidal-transformers] No ghcjs found
  4928. 518.25 s [duoidal-transformers] No ghcjs-pkg found
  4929. 518.25 s [duoidal-transformers] No greencard found
  4930. 518.25 s [duoidal-transformers] Using haddock version 2.29.2 found on system at:
  4931. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  4932. 518.25 s [duoidal-transformers] No happy found
  4933. 518.25 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  4934. 518.25 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  4935. 518.25 s [duoidal-transformers] No hmake found
  4936. 518.25 s [duoidal-transformers] Using hpc version 0.68 found on system at:
  4937. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  4938. 518.25 s [duoidal-transformers] Using hsc2hs version 0.68.9 found on system at:
  4939. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  4940. 518.25 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  4941. 518.25 s [duoidal-transformers] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  4942. 518.25 s [duoidal-transformers] No jhc found
  4943. 518.25 s [duoidal-transformers] Using ld found on system at:
  4944. 518.25 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  4945. 518.25 s [duoidal-transformers] No pkg-config found
  4946. 518.25 s [duoidal-transformers] Using runghc version 9.6.7 found on system at:
  4947. 518.25 s [duoidal-transformers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  4948. 518.25 s [duoidal-transformers] Using strip version 2.44 found on system at:
  4949. 518.25 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  4950. 518.25 s [duoidal-transformers] Using tar found on system at:
  4951. 518.25 s [duoidal-transformers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  4952. 518.25 s [duoidal-transformers] No uhc found
  4953. 518.45 s [duoidal-transformers] Phase: buildPhase
  4954. 518.53 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4955. 518.53 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4956. 518.53 s [duoids-hedgehog] <4.23: using base-4.18.3.0
  4957. 518.53 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  4958. 518.53 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4959. 518.53 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4960. 518.53 s [duoids-hedgehog] hedgehog-1.5
  4961. 518.53 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4962. 518.53 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4963. 518.53 s [duoids-hedgehog] <4.23: using base-4.18.3.0
  4964. 518.53 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4965. 518.53 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4966. 518.53 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  4967. 518.53 s [duoids-hedgehog] hedgehog-1.5
  4968. 518.53 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  4969. 518.53 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  4970. 518.53 s [duoids-hedgehog] <4.23: using base-4.18.3.0
  4971. 518.53 s [duoids-hedgehog] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  4972. 518.53 s [duoids-hedgehog] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  4973. 518.53 s [duoids-hedgehog] doctest-0.24.2
  4974. 518.53 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  4975. 518.53 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  4976. 518.53 s [duoids-hedgehog] Source component graph:
  4977. 518.53 s [duoids-hedgehog] component lib
  4978. 518.53 s [duoids-hedgehog] component test:doctests dependency lib
  4979. 518.53 s [duoids-hedgehog] component test:laws dependency lib
  4980. 518.53 s [duoids-hedgehog] Configured component graph:
  4981. 518.53 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  4982. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  4983. 518.53 s [duoids-hedgehog] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  4984. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4985. 518.53 s [duoids-hedgehog] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  4986. 518.53 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-6w2mGaT8tsl9SoXRidi3Hj-doctests
  4987. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  4988. 518.53 s [duoids-hedgehog] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  4989. 518.53 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  4990. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4991. 518.53 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-xLe4HGKuir39kTZM6Spxy-laws
  4992. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  4993. 518.53 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  4994. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  4995. 518.53 s [duoids-hedgehog] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  4996. 518.53 s [duoids-hedgehog] Linked component graph:
  4997. 518.53 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  4998. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  4999. 518.53 s [duoids-hedgehog] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  5000. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5001. 518.53 s [duoids-hedgehog] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  5002. 518.53 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn:Test.Duoidal
  5003. 518.53 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-6w2mGaT8tsl9SoXRidi3Hj-doctests
  5004. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  5005. 518.53 s [duoids-hedgehog] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  5006. 518.53 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5007. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5008. 518.53 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-xLe4HGKuir39kTZM6Spxy-laws
  5009. 518.53 s [duoids-hedgehog] include base-4.18.3.0
  5010. 518.53 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5011. 518.53 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5012. 518.53 s [duoids-hedgehog] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  5013. 518.53 s [duoids-hedgehog] Ready component graph:
  5014. 518.53 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5015. 518.53 s [duoids-hedgehog] depends base-4.18.3.0
  5016. 518.53 s [duoids-hedgehog] depends duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  5017. 518.53 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5018. 518.53 s [duoids-hedgehog] depends hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  5019. 518.53 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-xLe4HGKuir39kTZM6Spxy-laws
  5020. 518.53 s [duoids-hedgehog] depends base-4.18.3.0
  5021. 518.53 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5022. 518.53 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5023. 518.53 s [duoids-hedgehog] depends hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  5024. 518.53 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-6w2mGaT8tsl9SoXRidi3Hj-doctests
  5025. 518.53 s [duoids-hedgehog] depends base-4.18.3.0
  5026. 518.53 s [duoids-hedgehog] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  5027. 518.53 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5028. 518.53 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  5029. 518.53 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.6
  5030. 518.53 s [duoids-hedgehog] Using compiler: ghc-9.6.7
  5031. 518.53 s [duoids-hedgehog] Using install prefix:
  5032. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0
  5033. 518.53 s [duoids-hedgehog] Executables installed in:
  5034. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/bin
  5035. 518.53 s [duoids-hedgehog] Libraries installed in:
  5036. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5037. 518.53 s [duoids-hedgehog] Dynamic Libraries installed in:
  5038. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  5039. 518.53 s [duoids-hedgehog] Private executables installed in:
  5040. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.6.7/duoids-hedgehog-0.0.1.0
  5041. 518.53 s [duoids-hedgehog] Data files installed in:
  5042. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.6.7/duoids-hedgehog-0.0.1.0
  5043. 518.53 s [duoids-hedgehog] Documentation installed in:
  5044. 518.53 s [duoids-hedgehog] /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  5045. 518.53 s [duoids-hedgehog] Configuration files installed in:
  5046. 518.53 s [duoids-hedgehog] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/etc
  5047. 518.53 s [duoids-hedgehog] No alex found
  5048. 518.53 s [duoids-hedgehog] Using ar found on system at:
  5049. 518.53 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  5050. 518.53 s [duoids-hedgehog] No c2hs found
  5051. 518.53 s [duoids-hedgehog] No cpphs found
  5052. 518.53 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  5053. 518.53 s [duoids-hedgehog] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  5054. 518.53 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  5055. 518.53 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  5056. 518.53 s [duoids-hedgehog] Using ghc version 9.6.7 found on system at:
  5057. 518.53 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  5058. 518.53 s [duoids-hedgehog] Using ghc-pkg version 9.6.7 found on system at:
  5059. 518.53 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  5060. 518.53 s [duoids-hedgehog] No ghcjs found
  5061. 518.53 s [duoids-hedgehog] No ghcjs-pkg found
  5062. 518.54 s [duoids-hedgehog] No greencard found
  5063. 518.54 s [duoids-hedgehog] Using haddock version 2.29.2 found on system at:
  5064. 518.54 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  5065. 518.54 s [duoids-hedgehog] No happy found
  5066. 518.54 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  5067. 518.54 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  5068. 518.54 s [duoids-hedgehog] No hmake found
  5069. 518.54 s [duoids-hedgehog] Using hpc version 0.68 found on system at:
  5070. 518.54 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  5071. 518.54 s [duoids-hedgehog] Using hsc2hs version 0.68.9 found on system at:
  5072. 518.54 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  5073. 518.54 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  5074. 518.54 s [duoids-hedgehog] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  5075. 518.54 s [duoids-hedgehog] No jhc found
  5076. 518.54 s [duoids-hedgehog] Using ld found on system at:
  5077. 518.54 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  5078. 518.54 s [duoids-hedgehog] No pkg-config found
  5079. 518.54 s [duoids-hedgehog] Using runghc version 9.6.7 found on system at:
  5080. 518.54 s [duoids-hedgehog] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  5081. 518.54 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  5082. 518.54 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  5083. 518.54 s [duoids-hedgehog] Using tar found on system at:
  5084. 518.54 s [duoids-hedgehog] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  5085. 518.54 s [duoids-hedgehog] No uhc found
  5086. 518.60 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  5087. 518.60 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  5088. 518.77 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.o, dist/build/Control/Duoidal/Trans/Class.dyn_o )
  5089. 518.91 s [duoids-hedgehog] Phase: buildPhase
  5090. 519.03 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  5091. 519.03 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  5092. 519.14 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.o, dist/build/Control/Duoidal/Trans/Orphans.dyn_o )
  5093. 519.41 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  5094. 519.51 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 )
  5095. 520.06 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.p_o )
  5096. 520.49 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  5097. 520.56 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.p_o )
  5098. 520.86 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  5099. 521.95 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  5100. 525.31 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5101. 525.31 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5102. 525.54 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  5103. 526.08 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  5104. 526.75 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5105. 526.79 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5106. 526.93 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  5107. 527.00 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  5108. 528.44 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  5109. 528.76 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 )
  5110. 530.03 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5111. 530.03 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5112. 530.21 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  5113. 530.76 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  5114. 531.73 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  5115. 532.26 s [duoidal-transformers] Phase: checkPhase
  5116. 532.75 s [duoidal-transformers] Running 1 test suites...
  5117. 532.75 s [duoidal-transformers] Test suite doctests: RUNNING...
  5118. 533.27 s [duoidal-transformers]
  5119. 533.27 s [duoidal-transformers] on the commandline: warning:
  5120. 533.27 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5121. 533.27 s [duoidal-transformers]
  5122. 533.27 s [duoidal-transformers] on the commandline: warning:
  5123. 533.27 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5124. 533.27 s [duoidal-transformers]
  5125. 533.27 s [duoidal-transformers] on the commandline: warning:
  5126. 533.27 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  5127. 533.57 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  5128. 533.64 s [duoidal-transformers] NameLib Nothing
  5129. 533.64 s [duoidal-transformers] ----------------------------------------
  5130. 533.66 s [duoidal-transformers] Test suite doctests: PASS
  5131. 533.67 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  5132. 533.67 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  5133. 533.68 s [duoidal-transformers] Phase: haddockPhase
  5134. 533.90 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  5135. 533.90 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  5136. 534.51 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  5137. 534.51 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  5138. 534.51 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  5139. 534.94 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  5140. 537.32 s [duoids-hedgehog] Phase: checkPhase
  5141. 537.88 s [duoids-hedgehog] Running 2 test suites...
  5142. 537.92 s [duoids-hedgehog] Test suite laws: RUNNING...
  5143. 537.92 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  5144. 537.92 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5145. 537.92 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5146. 537.92 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5147. 537.92 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5148. 537.92 s [duoids-hedgehog] ✓ 4 succeeded.
  5149. 537.92 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  5150. 537.92 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5151. 537.92 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5152. 537.92 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5153. 537.92 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5154. 537.92 s [duoids-hedgehog] ✓ 4 succeeded.
  5155. 537.92 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  5156. 537.92 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5157. 537.92 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5158. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5159. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5160. 537.93 s [duoids-hedgehog] ✓ 4 succeeded.
  5161. 537.93 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  5162. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5163. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5164. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5165. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5166. 537.93 s [duoids-hedgehog] ✓ 4 succeeded.
  5167. 537.93 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  5168. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5169. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5170. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5171. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5172. 537.93 s [duoids-hedgehog] ✓ 4 succeeded.
  5173. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  5174. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5175. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5176. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5177. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5178. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5179. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5180. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  5181. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5182. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5183. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5184. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5185. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5186. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5187. 537.93 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  5188. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5189. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5190. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5191. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5192. 537.93 s [duoids-hedgehog] ✓ 4 succeeded.
  5193. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  5194. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5195. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5196. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5197. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5198. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5199. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5200. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  5201. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5202. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5203. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5204. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5205. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5206. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5207. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  5208. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5209. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5210. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5211. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5212. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5213. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5214. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  5215. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5216. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5217. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5218. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5219. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5220. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5221. 537.93 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  5222. 537.93 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  5223. 537.93 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  5224. 537.93 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  5225. 537.93 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  5226. 537.93 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  5227. 537.93 s [duoids-hedgehog] ✓ 5 succeeded.
  5228. 537.93 s [duoids-hedgehog] Test suite laws: PASS
  5229. 537.93 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  5230. 537.93 s [duoids-hedgehog] Test suite doctests: RUNNING...
  5231. 539.08 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  5232. 539.15 s [duoids-hedgehog] NameLib Nothing
  5233. 539.15 s [duoids-hedgehog] ----------------------------------------
  5234. 539.16 s [duoids-hedgehog] Test suite doctests: PASS
  5235. 539.16 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  5236. 539.16 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  5237. 539.19 s [duoids-hedgehog] Phase: haddockPhase
  5238. 539.37 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 )
  5239. 539.46 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  5240. 539.46 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  5241. 540.60 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 )
  5242. 540.78 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  5243. 540.96 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  5244. 540.96 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 )
  5245. 541.12 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  5246. 541.34 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 )
  5247. 541.34 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  5248. 541.35 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  5249. 541.35 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 )
  5250. 545.86 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  5251. 545.86 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  5252. 545.94 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  5253. 545.96 s [duoidal-transformers] Phase: installPhase
  5254. 546.06 s [duoidal-transformers] Installing library in /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT
  5255. 546.43 s [duoidal-transformers] Phase: fixupPhase
  5256. 546.46 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0
  5257. 546.47 s [duoidal-transformers] shrinking /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSduoidal-transformers-0.0.1.0-18oruCUsNga1KLwzMhvrwT-ghc9.6.7.so
  5258. 546.48 s [duoidal-transformers] checking for references to /build/ in /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0...
  5259. 546.50 s [duoidal-transformers] patching script interpreter paths in /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0
  5260. 546.51 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/lib
  5261. 546.56 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc
  5262. 546.57 s [duoidal-transformers] checking for references to /build/ in /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc...
  5263. 546.59 s [duoidal-transformers] patching script interpreter paths in /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc
  5264. 546.85 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0 /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc
  5265. 547.68 s [duoidal-transformers:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  5266. 547.68 s [duoidal-transformers:post-build]
  5267. 548.04 s [duoidal-transformers:post-build] Pushing /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc (341.26 KiB)
  5268. 548.25 s [duoidal-transformers:post-build] Pushing /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0 (671.68 KiB)
  5269. 549.18 s [duoidal-transformers:post-build]
  5270. 549.18 s [duoidal-transformers:post-build] All done.
  5271. 549.30 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0 /nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc
  5272. 549.57 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5273. 549.59 s [duoidal-transformers:post-build] copying 2 paths...
  5274. 549.59 s [duoidal-transformers:post-build] copying path '/nix/store/pqzn2xkxjda94da1j55h7m8vqjyazh3d-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  5275. 550.02 s [duoidal-transformers:post-build] copying path '/nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  5276. 550.50 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5277. 550.78 s [duoidal-transformers:post-build] copying 1 paths...
  5278. 550.78 s [duoidal-transformers:post-build] copying path '/nix/store/rfdk71wrmdphdxqyzsawanbm9j2bpki2-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  5279. 551.07 s Progress: 7 of 21 built (2 building), 73 of 73 downloaded from cache
  5280. 551.08 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  5281. 553.03 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  5282. 553.03 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  5283. 553.08 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  5284. 553.08 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  5285. 553.10 s [duoids-hedgehog] Phase: installPhase
  5286. 553.20 s [duoids-hedgehog] Installing library in /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  5287. 553.29 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  5288. 553.59 s [duoids-hedgehog] Phase: fixupPhase
  5289. 553.62 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0
  5290. 553.62 s [duoids-hedgehog] shrinking /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSduoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn-ghc9.6.7.so
  5291. 553.63 s [duoids-hedgehog] checking for references to /build/ in /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0...
  5292. 553.65 s [duoids-hedgehog] patching script interpreter paths in /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0
  5293. 553.66 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/lib
  5294. 553.69 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc
  5295. 553.70 s [duoids-hedgehog] checking for references to /build/ in /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc...
  5296. 553.72 s [duoids-hedgehog] patching script interpreter paths in /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc
  5297. 553.91 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0 /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc
  5298. 554.45 s [duoids-hedgehog:post-build] Pushing 2 paths (138 are already present) using zstd to cache sellout ⏳
  5299. 554.45 s [duoids-hedgehog:post-build]
  5300. 554.81 s [duoids-hedgehog:post-build] Pushing /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc (307.08 KiB)
  5301. 554.98 s [duoids-hedgehog:post-build] Pushing /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0 (522.67 KiB)
  5302. 556.00 s [duoids-hedgehog:post-build]
  5303. 556.00 s [duoids-hedgehog:post-build] All done.
  5304. 556.03 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0 /nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc
  5305. 556.11 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5306. 556.14 s [duoids-hedgehog:post-build] copying 2 paths...
  5307. 556.19 s [duoids-hedgehog:post-build] copying path '/nix/store/66wxwb4vnxzr6mzs9agajq4msdr0p3if-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  5308. 556.71 s [duoids-hedgehog:post-build] copying path '/nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  5309. 557.13 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  5310. 557.42 s [duoids-hedgehog:post-build] copying 1 paths...
  5311. 557.42 s [duoids-hedgehog:post-build] copying path '/nix/store/4w1v7w3iz7cl4524iwrc9jvvgishz42l-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  5312. 557.67 s Progress: 8 of 20 built (1 building), 73 of 73 downloaded from cache
  5313. 557.68 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  5314. 557.68 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  5315. 565.27 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  5316. 565.31 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  5317. 572.12 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  5318. 572.15 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  5319. 572.15 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  5320. 572.15 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  5321. 572.15 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  5322. 572.92 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  5323. 572.92 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  5324. 578.26 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  5325. 584.26 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  5326. 591.68 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  5327. 592.81 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  5328. 592.81 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  5329. 592.87 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 )
  5330. 594.16 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 )
  5331. 594.16 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 )
  5332. 594.31 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 )
  5333. 594.31 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 )
  5334. 594.31 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 )
  5335. 594.31 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 )
  5336. 594.31 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 )
  5337. 594.31 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 )
  5338. 594.31 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 )
  5339. 594.31 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 )
  5340. 594.31 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 )
  5341. 594.31 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 )
  5342. 594.31 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 )
  5343. 594.54 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 )
  5344. 596.50 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 )
  5345. 596.50 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 )
  5346. 596.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.p_o )
  5347. 596.81 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 )
  5348. 596.81 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 )
  5349. 596.81 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 )
  5350. 596.81 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 )
  5351. 596.81 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 )
  5352. 596.81 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 )
  5353. 596.81 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 )
  5354. 596.81 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  5355. 596.81 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 )
  5356. 596.81 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 )
  5357. 598.10 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  5358. 598.10 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  5359. 598.21 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 )
  5360. 598.36 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 )
  5361. 605.07 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 )
  5362. 605.16 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 )
  5363. 612.39 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 )
  5364. 632.63 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 )
  5365. 632.67 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 )
  5366. 632.67 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 )
  5367. 632.67 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 )
  5368. 632.67 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 )
  5369. 632.67 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 )
  5370. 632.67 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 )
  5371. 633.34 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  5372. 634.65 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  5373. 634.66 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  5374. 634.78 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 )
  5375. 634.93 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 )
  5376. 636.08 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 )
  5377. 636.08 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 )
  5378. 636.98 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 )
  5379. 637.11 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 )
  5380. 637.11 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 )
  5381. 637.11 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 )
  5382. 637.11 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 )
  5383. 637.11 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 )
  5384. 637.11 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 )
  5385. 637.11 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 )
  5386. 637.55 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  5387. 638.79 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  5388. 638.86 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  5389. 638.94 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  5390. 639.49 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 )
  5391. 639.49 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  5392. 640.82 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  5393. 641.72 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  5394. 642.97 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  5395. 642.97 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  5396. 643.04 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  5397. 643.40 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  5398. 647.85 s [vector] buildPhase completed in 2 minutes 55 seconds
  5399. 647.85 s [vector] Phase: checkPhase
  5400. 647.93 s [vector] Running 2 test suites...
  5401. 647.93 s [vector] Test suite vector-tests-O0: RUNNING...
  5402. 648.01 s [vector] toplevel
  5403. 648.01 s [vector] Data.Vector.Fusion.Bundle
  5404. 648.01 s [vector] fromList.toList == id: OK
  5405. 648.01 s [vector] +++ OK, passed 100 tests.
  5406. 648.01 s [vector] toList.fromList == id: OK
  5407. 648.01 s [vector] +++ OK, passed 100 tests.
  5408. 648.01 s [vector] eq: OK
  5409. 648.01 s [vector] +++ OK, passed 100 tests.
  5410. 648.01 s [vector] length: OK
  5411. 648.01 s [vector] +++ OK, passed 100 tests.
  5412. 648.01 s [vector] null: OK
  5413. 648.01 s [vector] +++ OK, passed 100 tests.
  5414. 648.01 s [vector] empty: OK
  5415. 648.01 s [vector] +++ OK, passed 100 tests.
  5416. 648.01 s [vector] singleton: OK
  5417. 648.01 s [vector] +++ OK, passed 100 tests.
  5418. 648.01 s [vector] replicate: OK
  5419. 648.01 s [vector] +++ OK, passed 100 tests.
  5420. 648.01 s [vector] cons: OK (0.02s)
  5421. 648.01 s [vector] +++ OK, passed 100 tests.
  5422. 648.02 s [vector] snoc: OK
  5423. 648.02 s [vector] +++ OK, passed 100 tests.
  5424. 648.02 s [vector] append: OK
  5425. 648.02 s [vector] +++ OK, passed 100 tests.
  5426. 648.02 s [vector] head: OK
  5427. 648.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5428. 648.02 s [vector] last: OK
  5429. 648.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5430. 648.02 s [vector] index: OK
  5431. 648.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5432. 648.02 s [vector] extract: OK
  5433. 648.02 s [vector] +++ OK, passed 100 tests.
  5434. 648.02 s [vector] init: OK
  5435. 648.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5436. 648.02 s [vector] tail: OK
  5437. 648.02 s [vector] +++ OK, passed 100 tests; 25 discarded.
  5438. 648.02 s [vector] take: OK
  5439. 648.02 s [vector] +++ OK, passed 100 tests.
  5440. 648.02 s [vector] drop: OK
  5441. 648.02 s [vector] +++ OK, passed 100 tests.
  5442. 648.02 s [vector] map: OK
  5443. 648.02 s [vector] +++ OK, passed 100 tests.
  5444. 648.02 s [vector] zipWith: OK
  5445. 648.02 s [vector] +++ OK, passed 100 tests.
  5446. 648.02 s [vector] zipWith3: OK
  5447. 648.02 s [vector] +++ OK, passed 100 tests.
  5448. 648.02 s [vector] filter: OK
  5449. 648.02 s [vector] +++ OK, passed 100 tests.
  5450. 648.02 s [vector] takeWhile: OK
  5451. 648.02 s [vector] +++ OK, passed 100 tests.
  5452. 648.03 s [vector] dropWhile: OK
  5453. 648.03 s [vector] +++ OK, passed 100 tests.
  5454. 648.03 s [vector] elem: OK
  5455. 648.03 s [vector] +++ OK, passed 100 tests.
  5456. 648.03 s [vector] notElem: OK
  5457. 648.03 s [vector] +++ OK, passed 100 tests.
  5458. 648.03 s [vector] find: OK
  5459. 648.03 s [vector] +++ OK, passed 100 tests.
  5460. 648.03 s [vector] findIndex: OK
  5461. 648.03 s [vector] +++ OK, passed 100 tests.
  5462. 648.03 s [vector] foldl: OK
  5463. 648.03 s [vector] +++ OK, passed 100 tests.
  5464. 648.03 s [vector] foldl1: OK
  5465. 648.03 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5466. 648.04 s [vector] foldl': OK
  5467. 648.04 s [vector] +++ OK, passed 100 tests.
  5468. 648.04 s [vector] foldl1': OK
  5469. 648.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5470. 648.04 s [vector] foldr: OK
  5471. 648.04 s [vector] +++ OK, passed 100 tests.
  5472. 648.04 s [vector] foldr1: OK
  5473. 648.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5474. 648.04 s [vector] prescanl: OK
  5475. 648.04 s [vector] +++ OK, passed 100 tests.
  5476. 648.05 s [vector] prescanl': OK
  5477. 648.05 s [vector] +++ OK, passed 100 tests.
  5478. 648.05 s [vector] postscanl: OK
  5479. 648.05 s [vector] +++ OK, passed 100 tests.
  5480. 648.05 s [vector] postscanl': OK
  5481. 648.05 s [vector] +++ OK, passed 100 tests.
  5482. 648.06 s [vector] scanl: OK
  5483. 648.06 s [vector] +++ OK, passed 100 tests.
  5484. 648.06 s [vector] scanl': OK
  5485. 648.06 s [vector] +++ OK, passed 100 tests.
  5486. 648.06 s [vector] scanl1: OK
  5487. 648.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5488. 648.08 s [vector] scanl1': OK
  5489. 648.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5490. 648.08 s [vector] concatMap: OK (0.01s)
  5491. 648.08 s [vector] +++ OK, passed 100 tests.
  5492. 648.08 s [vector] unfoldr: OK
  5493. 648.08 s [vector] +++ OK, passed 100 tests.
  5494. 648.08 s [vector] and: OK
  5495. 648.08 s [vector] +++ OK, passed 100 tests.
  5496. 648.08 s [vector] or: OK
  5497. 648.08 s [vector] +++ OK, passed 100 tests.
  5498. 648.08 s [vector] Tests.Vector.Boxed
  5499. 648.08 s [vector] Bool
  5500. 648.08 s [vector] fromList.toList == id: OK
  5501. 648.08 s [vector] +++ OK, passed 100 tests.
  5502. 648.08 s [vector] toList.fromList == id: OK
  5503. 648.08 s [vector] +++ OK, passed 100 tests.
  5504. 648.08 s [vector] unstream.stream == id: OK
  5505. 648.08 s [vector] +++ OK, passed 100 tests.
  5506. 648.08 s [vector] stream.unstream == id: OK
  5507. 648.08 s [vector] +++ OK, passed 100 tests.
  5508. 648.08 s [vector] eq: OK
  5509. 648.08 s [vector] +++ OK, passed 100 tests.
  5510. 648.08 s [vector] length: OK
  5511. 648.08 s [vector] +++ OK, passed 100 tests.
  5512. 648.08 s [vector] null: OK
  5513. 648.08 s [vector] +++ OK, passed 100 tests.
  5514. 648.08 s [vector] index: OK
  5515. 648.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5516. 648.08 s [vector] safeIndex: OK
  5517. 648.08 s [vector] +++ OK, passed 100 tests.
  5518. 648.08 s [vector] head: OK
  5519. 648.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5520. 648.08 s [vector] last: OK
  5521. 648.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5522. 648.08 s [vector] unsafeIndex: OK
  5523. 648.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5524. 648.08 s [vector] unsafeHead: OK
  5525. 648.08 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5526. 648.08 s [vector] unsafeLast: OK
  5527. 648.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5528. 648.08 s [vector] slice: OK
  5529. 648.08 s [vector] +++ OK, passed 100 tests.
  5530. 648.08 s [vector] init: OK
  5531. 648.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5532. 648.08 s [vector] tail: OK
  5533. 648.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5534. 648.08 s [vector] take: OK
  5535. 648.08 s [vector] +++ OK, passed 100 tests.
  5536. 648.08 s [vector] drop: OK
  5537. 648.08 s [vector] +++ OK, passed 100 tests.
  5538. 648.09 s [vector] splitAt: OK
  5539. 648.09 s [vector] +++ OK, passed 100 tests.
  5540. 648.09 s [vector] empty: OK
  5541. 648.09 s [vector] +++ OK, passed 100 tests.
  5542. 648.09 s [vector] singleton: OK
  5543. 648.09 s [vector] +++ OK, passed 100 tests.
  5544. 648.09 s [vector] replicate: OK
  5545. 648.09 s [vector] +++ OK, passed 100 tests.
  5546. 648.09 s [vector] generate: OK
  5547. 648.09 s [vector] +++ OK, passed 100 tests.
  5548. 648.11 s [vector] iterateN: OK
  5549. 648.11 s [vector] +++ OK, passed 100 tests.
  5550. 648.14 s [vector] iterateNM: OK (0.04s)
  5551. 648.15 s [vector] +++ OK, passed 100 tests.
  5552. 648.15 s [vector] generateM: OK (0.01s)
  5553. 648.15 s [vector] +++ OK, passed 100 tests.
  5554. 648.15 s [vector] replicateM: OK
  5555. 648.15 s [vector] +++ OK, passed 100 tests.
  5556. 648.15 s [vector] create: OK
  5557. 648.15 s [vector] +++ OK, passed 100 tests.
  5558. 648.15 s [vector] createT: OK
  5559. 648.15 s [vector] +++ OK, passed 100 tests.
  5560. 648.15 s [vector] unfoldr: OK
  5561. 648.15 s [vector] +++ OK, passed 100 tests.
  5562. 648.15 s [vector] unfoldrN: OK
  5563. 648.16 s [vector] +++ OK, passed 100 tests.
  5564. 648.16 s [vector] unfoldrExactN: OK
  5565. 648.16 s [vector] +++ OK, passed 100 tests.
  5566. 648.16 s [vector] unfoldrM: OK
  5567. 648.16 s [vector] +++ OK, passed 100 tests.
  5568. 648.16 s [vector] unfoldrNM: OK
  5569. 648.17 s [vector] +++ OK, passed 100 tests.
  5570. 648.19 s [vector] unfoldrExactNM: OK (0.03s)
  5571. 648.19 s [vector] +++ OK, passed 100 tests.
  5572. 648.20 s [vector] constructN: OK
  5573. 648.20 s [vector] +++ OK, passed 100 tests.
  5574. 648.20 s [vector] constructrN: OK
  5575. 648.20 s [vector] +++ OK, passed 100 tests.
  5576. 648.20 s [vector] cons: OK
  5577. 648.20 s [vector] +++ OK, passed 100 tests.
  5578. 648.20 s [vector] snoc: OK
  5579. 648.20 s [vector] +++ OK, passed 100 tests.
  5580. 648.20 s [vector] append: OK
  5581. 648.20 s [vector] +++ OK, passed 100 tests.
  5582. 648.21 s [vector] concat: OK
  5583. 648.21 s [vector] +++ OK, passed 100 tests.
  5584. 648.21 s [vector] force: OK
  5585. 648.21 s [vector] +++ OK, passed 100 tests.
  5586. 648.21 s [vector] upd: OK
  5587. 648.21 s [vector] +++ OK, passed 100 tests.
  5588. 648.21 s [vector] accum: OK
  5589. 648.21 s [vector] +++ OK, passed 100 tests.
  5590. 648.22 s [vector] reverse: OK
  5591. 648.22 s [vector] +++ OK, passed 100 tests.
  5592. 648.22 s [vector] backpermute: OK
  5593. 648.22 s [vector] +++ OK, passed 100 tests.
  5594. 648.22 s [vector] map: OK
  5595. 648.22 s [vector] +++ OK, passed 100 tests.
  5596. 648.22 s [vector] imap: OK
  5597. 648.22 s [vector] +++ OK, passed 100 tests.
  5598. 648.22 s [vector] concatMap: OK
  5599. 648.22 s [vector] +++ OK, passed 100 tests.
  5600. 648.22 s [vector] mapM: OK
  5601. 648.23 s [vector] +++ OK, passed 100 tests.
  5602. 648.23 s [vector] mapM_: OK (0.01s)
  5603. 648.23 s [vector] +++ OK, passed 100 tests.
  5604. 648.23 s [vector] forM: OK
  5605. 648.25 s [vector] +++ OK, passed 100 tests.
  5606. 648.25 s [vector] forM_: OK (0.01s)
  5607. 648.25 s [vector] +++ OK, passed 100 tests.
  5608. 648.25 s [vector] imapM: OK
  5609. 648.25 s [vector] +++ OK, passed 100 tests.
  5610. 648.26 s [vector] imapM_: OK (0.01s)
  5611. 648.26 s [vector] +++ OK, passed 100 tests.
  5612. 648.26 s [vector] zipWith: OK
  5613. 648.26 s [vector] +++ OK, passed 100 tests.
  5614. 648.26 s [vector] zipWith3: OK
  5615. 648.26 s [vector] +++ OK, passed 100 tests.
  5616. 648.26 s [vector] izipWith: OK
  5617. 648.26 s [vector] +++ OK, passed 100 tests.
  5618. 648.26 s [vector] izipWith3: OK
  5619. 648.26 s [vector] +++ OK, passed 100 tests.
  5620. 648.27 s [vector] izipWithM: OK
  5621. 648.27 s [vector] +++ OK, passed 100 tests.
  5622. 648.27 s [vector] izipWithM_: OK
  5623. 648.28 s [vector] +++ OK, passed 100 tests.
  5624. 648.28 s [vector] zipWithM: OK
  5625. 648.28 s [vector] +++ OK, passed 100 tests.
  5626. 648.29 s [vector] zipWithM_: OK
  5627. 648.29 s [vector] +++ OK, passed 100 tests.
  5628. 648.29 s [vector] filter: OK
  5629. 648.29 s [vector] +++ OK, passed 100 tests.
  5630. 648.29 s [vector] ifilter: OK
  5631. 648.29 s [vector] +++ OK, passed 100 tests.
  5632. 648.31 s [vector] filterM: OK
  5633. 648.31 s [vector] +++ OK, passed 100 tests.
  5634. 648.31 s [vector] uniq: OK
  5635. 648.31 s [vector] +++ OK, passed 100 tests.
  5636. 648.31 s [vector] mapMaybe: OK
  5637. 648.31 s [vector] +++ OK, passed 100 tests.
  5638. 648.32 s [vector] imapMaybe: OK
  5639. 648.32 s [vector] +++ OK, passed 100 tests.
  5640. 648.32 s [vector] takeWhile: OK
  5641. 648.32 s [vector] +++ OK, passed 100 tests.
  5642. 648.32 s [vector] dropWhile: OK
  5643. 648.32 s [vector] +++ OK, passed 100 tests.
  5644. 648.32 s [vector] partition: OK
  5645. 648.32 s [vector] +++ OK, passed 100 tests.
  5646. 648.32 s [vector] partitionWith: OK
  5647. 648.32 s [vector] +++ OK, passed 100 tests.
  5648. 648.32 s [vector] span: OK
  5649. 648.32 s [vector] +++ OK, passed 100 tests.
  5650. 648.32 s [vector] break: OK
  5651. 648.32 s [vector] +++ OK, passed 100 tests.
  5652. 648.32 s [vector] spanR: OK
  5653. 648.32 s [vector] +++ OK, passed 100 tests.
  5654. 648.32 s [vector] breakR: OK
  5655. 648.32 s [vector] +++ OK, passed 100 tests.
  5656. 648.32 s [vector] groupBy: OK
  5657. 648.32 s [vector] +++ OK, passed 100 tests.
  5658. 648.32 s [vector] elem: OK
  5659. 648.32 s [vector] +++ OK, passed 100 tests.
  5660. 648.32 s [vector] notElem: OK
  5661. 648.32 s [vector] +++ OK, passed 100 tests.
  5662. 648.32 s [vector] find: OK
  5663. 648.32 s [vector] +++ OK, passed 100 tests.
  5664. 648.32 s [vector] findIndex: OK
  5665. 648.32 s [vector] +++ OK, passed 100 tests.
  5666. 648.32 s [vector] findIndexR: OK
  5667. 648.32 s [vector] +++ OK, passed 100 tests.
  5668. 648.32 s [vector] findIndices: OK
  5669. 648.32 s [vector] +++ OK, passed 100 tests.
  5670. 648.32 s [vector] elemIndex: OK
  5671. 648.32 s [vector] +++ OK, passed 100 tests.
  5672. 648.32 s [vector] elemIndices: OK
  5673. 648.33 s [vector] +++ OK, passed 100 tests.
  5674. 648.33 s [vector] foldl: OK
  5675. 648.33 s [vector] +++ OK, passed 100 tests.
  5676. 648.33 s [vector] foldl1: OK
  5677. 648.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5678. 648.33 s [vector] foldl': OK
  5679. 648.33 s [vector] +++ OK, passed 100 tests.
  5680. 648.33 s [vector] foldl1': OK
  5681. 648.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5682. 648.33 s [vector] foldr: OK
  5683. 648.33 s [vector] +++ OK, passed 100 tests.
  5684. 648.33 s [vector] foldr1: OK
  5685. 648.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5686. 648.34 s [vector] foldr': OK
  5687. 648.34 s [vector] +++ OK, passed 100 tests.
  5688. 648.34 s [vector] foldr1': OK
  5689. 648.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5690. 648.34 s [vector] ifoldl: OK
  5691. 648.34 s [vector] +++ OK, passed 100 tests.
  5692. 648.34 s [vector] ifoldl': OK
  5693. 648.34 s [vector] +++ OK, passed 100 tests.
  5694. 648.34 s [vector] ifoldr: OK
  5695. 648.34 s [vector] +++ OK, passed 100 tests.
  5696. 648.34 s [vector] ifoldr': OK
  5697. 648.34 s [vector] +++ OK, passed 100 tests.
  5698. 648.35 s [vector] ifoldM: OK
  5699. 648.36 s [vector] +++ OK, passed 100 tests.
  5700. 648.37 s [vector] ifoldM': OK (0.01s)
  5701. 648.37 s [vector] +++ OK, passed 100 tests.
  5702. 648.38 s [vector] ifoldM_: OK (0.01s)
  5703. 648.38 s [vector] +++ OK, passed 100 tests.
  5704. 648.38 s [vector] ifoldM'_: OK (0.01s)
  5705. 648.39 s [vector] +++ OK, passed 100 tests.
  5706. 648.39 s [vector] all: OK
  5707. 648.39 s [vector] +++ OK, passed 100 tests.
  5708. 648.39 s [vector] any: OK
  5709. 648.39 s [vector] +++ OK, passed 100 tests.
  5710. 648.39 s [vector] prescanl: OK
  5711. 648.39 s [vector] +++ OK, passed 100 tests.
  5712. 648.39 s [vector] prescanl': OK
  5713. 648.39 s [vector] +++ OK, passed 100 tests.
  5714. 648.39 s [vector] postscanl: OK
  5715. 648.39 s [vector] +++ OK, passed 100 tests.
  5716. 648.39 s [vector] postscanl': OK
  5717. 648.39 s [vector] +++ OK, passed 100 tests.
  5718. 648.39 s [vector] scanl: OK
  5719. 648.39 s [vector] +++ OK, passed 100 tests.
  5720. 648.40 s [vector] scanl': OK
  5721. 648.40 s [vector] +++ OK, passed 100 tests.
  5722. 648.40 s [vector] scanl1: OK
  5723. 648.40 s [vector] +++ OK, passed 100 tests.
  5724. 648.40 s [vector] scanl1': OK
  5725. 648.40 s [vector] +++ OK, passed 100 tests.
  5726. 648.40 s [vector] iscanl: OK
  5727. 648.40 s [vector] +++ OK, passed 100 tests.
  5728. 648.40 s [vector] iscanl': OK
  5729. 648.40 s [vector] +++ OK, passed 100 tests.
  5730. 648.41 s [vector] prescanr: OK
  5731. 648.41 s [vector] +++ OK, passed 100 tests.
  5732. 648.41 s [vector] prescanr': OK
  5733. 648.41 s [vector] +++ OK, passed 100 tests.
  5734. 648.41 s [vector] postscanr: OK
  5735. 648.41 s [vector] +++ OK, passed 100 tests.
  5736. 648.41 s [vector] postscanr': OK
  5737. 648.41 s [vector] +++ OK, passed 100 tests.
  5738. 648.41 s [vector] scanr: OK
  5739. 648.41 s [vector] +++ OK, passed 100 tests.
  5740. 648.41 s [vector] scanr': OK
  5741. 648.41 s [vector] +++ OK, passed 100 tests.
  5742. 648.41 s [vector] scanr1: OK
  5743. 648.41 s [vector] +++ OK, passed 100 tests.
  5744. 648.41 s [vector] scanr1': OK
  5745. 648.41 s [vector] +++ OK, passed 100 tests.
  5746. 648.41 s [vector] iscanr: OK
  5747. 648.42 s [vector] +++ OK, passed 100 tests.
  5748. 648.42 s [vector] iscanr': OK
  5749. 648.42 s [vector] +++ OK, passed 100 tests.
  5750. 648.42 s [vector] mut_read: OK
  5751. 648.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5752. 648.42 s [vector] mut_write: OK
  5753. 648.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5754. 648.42 s [vector] mut_modify: OK
  5755. 648.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5756. 648.43 s [vector] mut_generate: OK
  5757. 648.43 s [vector] +++ OK, passed 100 tests.
  5758. 648.43 s [vector] mut_generateM: OK
  5759. 648.43 s [vector] +++ OK, passed 100 tests.
  5760. 648.45 s [vector] mut_mapM_: OK
  5761. 648.45 s [vector] +++ OK, passed 100 tests.
  5762. 648.46 s [vector] mut_imapM_: OK (0.01s)
  5763. 648.46 s [vector] +++ OK, passed 100 tests.
  5764. 648.46 s [vector] mut_forM_: OK (0.01s)
  5765. 648.46 s [vector] +++ OK, passed 100 tests.
  5766. 648.47 s [vector] mut_iforM_: OK (0.01s)
  5767. 648.47 s [vector] +++ OK, passed 100 tests.
  5768. 648.48 s [vector] mut_foldr: OK
  5769. 648.48 s [vector] +++ OK, passed 100 tests.
  5770. 648.48 s [vector] mut_foldr': OK
  5771. 648.48 s [vector] +++ OK, passed 100 tests.
  5772. 648.48 s [vector] mut_foldl: OK
  5773. 648.48 s [vector] +++ OK, passed 100 tests.
  5774. 648.48 s [vector] mut_foldl': OK
  5775. 648.48 s [vector] +++ OK, passed 100 tests.
  5776. 648.48 s [vector] mut_ifoldr: OK
  5777. 648.48 s [vector] +++ OK, passed 100 tests.
  5778. 648.49 s [vector] mut_ifoldr': OK
  5779. 648.49 s [vector] +++ OK, passed 100 tests.
  5780. 648.49 s [vector] mut_ifoldl: OK
  5781. 648.49 s [vector] +++ OK, passed 100 tests.
  5782. 648.49 s [vector] mut_ifoldl': OK
  5783. 648.49 s [vector] +++ OK, passed 100 tests.
  5784. 648.49 s [vector] mut_foldM: OK
  5785. 648.49 s [vector] +++ OK, passed 100 tests.
  5786. 648.50 s [vector] mut_foldM': OK
  5787. 648.50 s [vector] +++ OK, passed 100 tests.
  5788. 648.50 s [vector] mut_foldrM: OK
  5789. 648.50 s [vector] +++ OK, passed 100 tests.
  5790. 648.51 s [vector] mut_foldrM': OK
  5791. 648.51 s [vector] +++ OK, passed 100 tests.
  5792. 648.51 s [vector] mut_ifoldM: OK
  5793. 648.51 s [vector] +++ OK, passed 100 tests.
  5794. 648.51 s [vector] mut_ifoldM': OK
  5795. 648.51 s [vector] +++ OK, passed 100 tests.
  5796. 648.51 s [vector] mut_ifoldrM: OK
  5797. 648.51 s [vector] +++ OK, passed 100 tests.
  5798. 648.51 s [vector] mut_ifoldrM': OK
  5799. 648.51 s [vector] +++ OK, passed 100 tests.
  5800. 648.51 s [vector] compare: OK
  5801. 648.51 s [vector] +++ OK, passed 100 tests.
  5802. 648.51 s [vector] maximum: OK
  5803. 648.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5804. 648.51 s [vector] minimum: OK
  5805. 648.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5806. 648.51 s [vector] minIndex: OK
  5807. 648.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5808. 648.51 s [vector] maxIndex: OK
  5809. 648.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5810. 648.51 s [vector] maximumBy: OK
  5811. 648.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5812. 648.51 s [vector] minimumBy: OK
  5813. 648.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5814. 648.51 s [vector] maximumOn: OK
  5815. 648.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5816. 648.51 s [vector] minimumOn: OK
  5817. 648.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5818. 648.51 s [vector] maxIndexBy: OK
  5819. 648.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5820. 648.51 s [vector] minIndexBy: OK
  5821. 648.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5822. 648.51 s [vector] ListFirstMaxIndexWins: OK
  5823. 648.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5824. 648.51 s [vector] FalseListFirstMaxIndexWins: OK
  5825. 648.51 s [vector] +++ OK, failed as expected. (after 1 test):
  5826. 648.51 s [vector] Exception:
  5827. 648.51 s [vector] Prelude.foldr1: empty list
  5828. 648.51 s [vector] CallStack (from HasCallStack):
  5829. 648.51 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  5830. 648.51 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  5831. 648.51 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5832. 648.51 s [vector] []
  5833. 648.51 s [vector] zip: OK
  5834. 648.51 s [vector] +++ OK, passed 100 tests.
  5835. 648.51 s [vector] zip3: OK
  5836. 648.51 s [vector] +++ OK, passed 100 tests.
  5837. 648.51 s [vector] unzip: OK
  5838. 648.51 s [vector] +++ OK, passed 100 tests.
  5839. 648.51 s [vector] unzip3: OK
  5840. 648.51 s [vector] +++ OK, passed 100 tests.
  5841. 648.52 s [vector] indexed: OK
  5842. 648.52 s [vector] +++ OK, passed 100 tests.
  5843. 648.53 s [vector] update: OK
  5844. 648.53 s [vector] +++ OK, passed 100 tests.
  5845. 648.53 s [vector] concat: OK
  5846. 648.53 s [vector] +++ OK, passed 100 tests.
  5847. 648.53 s [vector] mempty: OK
  5848. 648.53 s [vector] +++ OK, passed 100 tests.
  5849. 648.53 s [vector] mappend: OK
  5850. 648.54 s [vector] +++ OK, passed 100 tests.
  5851. 648.54 s [vector] mconcat: OK (0.01s)
  5852. 648.54 s [vector] +++ OK, passed 100 tests.
  5853. 648.54 s [vector] fmap: OK
  5854. 648.54 s [vector] +++ OK, passed 100 tests.
  5855. 648.54 s [vector] return: OK
  5856. 648.55 s [vector] +++ OK, passed 100 tests.
  5857. 648.56 s [vector] bind: OK (0.02s)
  5858. 648.56 s [vector] +++ OK, passed 100 tests.
  5859. 648.56 s [vector] mzip: OK
  5860. 648.56 s [vector] +++ OK, passed 100 tests.
  5861. 648.56 s [vector] munzip: OK
  5862. 648.56 s [vector] +++ OK, passed 100 tests.
  5863. 648.56 s [vector] applicative_pure: OK
  5864. 648.56 s [vector] +++ OK, passed 100 tests.
  5865. 648.58 s [vector] applicative_appl: OK (0.01s)
  5866. 648.58 s [vector] +++ OK, passed 100 tests.
  5867. 648.58 s [vector] alternative_empty: OK
  5868. 648.58 s [vector] +++ OK, passed 100 tests.
  5869. 648.59 s [vector] alternative_or: OK
  5870. 648.59 s [vector] +++ OK, passed 100 tests.
  5871. 648.61 s [vector] sequence: OK (0.02s)
  5872. 648.61 s [vector] +++ OK, passed 100 tests.
  5873. 648.61 s [vector] sequence_: OK
  5874. 648.61 s [vector] +++ OK, passed 100 tests.
  5875. 648.62 s [vector] glength: OK
  5876. 648.62 s [vector] +++ OK, passed 100 tests.
  5877. 648.62 s [vector] and: OK
  5878. 648.62 s [vector] +++ OK, passed 100 tests.
  5879. 648.62 s [vector] or: OK
  5880. 648.62 s [vector] +++ OK, passed 100 tests.
  5881. 648.62 s [vector] Int
  5882. 648.62 s [vector] fromList.toList == id: OK
  5883. 648.62 s [vector] +++ OK, passed 100 tests.
  5884. 648.62 s [vector] toList.fromList == id: OK
  5885. 648.62 s [vector] +++ OK, passed 100 tests.
  5886. 648.62 s [vector] unstream.stream == id: OK
  5887. 648.62 s [vector] +++ OK, passed 100 tests.
  5888. 648.62 s [vector] stream.unstream == id: OK
  5889. 648.62 s [vector] +++ OK, passed 100 tests.
  5890. 648.62 s [vector] eq: OK
  5891. 648.62 s [vector] +++ OK, passed 100 tests.
  5892. 648.62 s [vector] length: OK
  5893. 648.62 s [vector] +++ OK, passed 100 tests.
  5894. 648.62 s [vector] null: OK
  5895. 648.62 s [vector] +++ OK, passed 100 tests.
  5896. 648.62 s [vector] index: OK
  5897. 648.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5898. 648.62 s [vector] safeIndex: OK
  5899. 648.62 s [vector] +++ OK, passed 100 tests.
  5900. 648.62 s [vector] head: OK
  5901. 648.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5902. 648.62 s [vector] last: OK
  5903. 648.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5904. 648.62 s [vector] unsafeIndex: OK
  5905. 648.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5906. 648.62 s [vector] unsafeHead: OK
  5907. 648.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5908. 648.62 s [vector] unsafeLast: OK
  5909. 648.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5910. 648.62 s [vector] slice: OK
  5911. 648.62 s [vector] +++ OK, passed 100 tests.
  5912. 648.62 s [vector] init: OK
  5913. 648.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5914. 648.62 s [vector] tail: OK
  5915. 648.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5916. 648.62 s [vector] take: OK
  5917. 648.62 s [vector] +++ OK, passed 100 tests.
  5918. 648.62 s [vector] drop: OK
  5919. 648.62 s [vector] +++ OK, passed 100 tests.
  5920. 648.62 s [vector] splitAt: OK
  5921. 648.62 s [vector] +++ OK, passed 100 tests.
  5922. 648.62 s [vector] empty: OK
  5923. 648.62 s [vector] +++ OK, passed 100 tests.
  5924. 648.62 s [vector] singleton: OK
  5925. 648.62 s [vector] +++ OK, passed 100 tests.
  5926. 648.62 s [vector] replicate: OK
  5927. 648.62 s [vector] +++ OK, passed 100 tests.
  5928. 648.62 s [vector] generate: OK
  5929. 648.62 s [vector] +++ OK, passed 100 tests.
  5930. 648.62 s [vector] iterateN: OK
  5931. 648.63 s [vector] +++ OK, passed 100 tests.
  5932. 648.67 s [vector] iterateNM: OK (0.04s)
  5933. 648.67 s [vector] +++ OK, passed 100 tests.
  5934. 648.69 s [vector] generateM: OK (0.02s)
  5935. 648.69 s [vector] +++ OK, passed 100 tests.
  5936. 648.69 s [vector] replicateM: OK
  5937. 648.69 s [vector] +++ OK, passed 100 tests.
  5938. 648.69 s [vector] create: OK
  5939. 648.69 s [vector] +++ OK, passed 100 tests.
  5940. 648.69 s [vector] createT: OK
  5941. 648.69 s [vector] +++ OK, passed 100 tests.
  5942. 648.69 s [vector] unfoldr: OK
  5943. 648.69 s [vector] +++ OK, passed 100 tests.
  5944. 648.69 s [vector] unfoldrN: OK
  5945. 648.69 s [vector] +++ OK, passed 100 tests.
  5946. 648.69 s [vector] unfoldrExactN: OK
  5947. 648.69 s [vector] +++ OK, passed 100 tests.
  5948. 648.69 s [vector] unfoldrM: OK
  5949. 648.69 s [vector] +++ OK, passed 100 tests.
  5950. 648.69 s [vector] unfoldrNM: OK
  5951. 648.71 s [vector] +++ OK, passed 100 tests.
  5952. 648.75 s [vector] unfoldrExactNM: OK (0.05s)
  5953. 648.75 s [vector] +++ OK, passed 100 tests.
  5954. 648.75 s [vector] constructN: OK
  5955. 648.75 s [vector] +++ OK, passed 100 tests.
  5956. 648.75 s [vector] constructrN: OK
  5957. 648.75 s [vector] +++ OK, passed 100 tests.
  5958. 648.75 s [vector] cons: OK
  5959. 648.75 s [vector] +++ OK, passed 100 tests.
  5960. 648.75 s [vector] snoc: OK
  5961. 648.75 s [vector] +++ OK, passed 100 tests.
  5962. 648.76 s [vector] append: OK
  5963. 648.76 s [vector] +++ OK, passed 100 tests.
  5964. 648.76 s [vector] concat: OK (0.01s)
  5965. 648.76 s [vector] +++ OK, passed 100 tests.
  5966. 648.77 s [vector] force: OK
  5967. 648.77 s [vector] +++ OK, passed 100 tests.
  5968. 648.77 s [vector] upd: OK
  5969. 648.77 s [vector] +++ OK, passed 100 tests.
  5970. 648.77 s [vector] accum: OK
  5971. 648.77 s [vector] +++ OK, passed 100 tests.
  5972. 648.77 s [vector] reverse: OK
  5973. 648.77 s [vector] +++ OK, passed 100 tests.
  5974. 648.77 s [vector] backpermute: OK
  5975. 648.77 s [vector] +++ OK, passed 100 tests.
  5976. 648.77 s [vector] map: OK
  5977. 648.78 s [vector] +++ OK, passed 100 tests.
  5978. 648.78 s [vector] imap: OK
  5979. 648.78 s [vector] +++ OK, passed 100 tests.
  5980. 648.78 s [vector] concatMap: OK
  5981. 648.78 s [vector] +++ OK, passed 100 tests.
  5982. 648.79 s [vector] mapM: OK
  5983. 648.79 s [vector] +++ OK, passed 100 tests.
  5984. 648.80 s [vector] mapM_: OK (0.02s)
  5985. 648.80 s [vector] +++ OK, passed 100 tests.
  5986. 648.81 s [vector] forM: OK
  5987. 648.81 s [vector] +++ OK, passed 100 tests.
  5988. 648.82 s [vector] forM_: OK (0.02s)
  5989. 648.82 s [vector] +++ OK, passed 100 tests.
  5990. 648.83 s [vector] imapM: OK
  5991. 648.83 s [vector] +++ OK, passed 100 tests.
  5992. 648.84 s [vector] imapM_: OK (0.02s)
  5993. 648.84 s [vector] +++ OK, passed 100 tests.
  5994. 648.84 s [vector] zipWith: OK
  5995. 648.84 s [vector] +++ OK, passed 100 tests.
  5996. 648.84 s [vector] zipWith3: OK
  5997. 648.85 s [vector] +++ OK, passed 100 tests.
  5998. 648.85 s [vector] izipWith: OK
  5999. 648.85 s [vector] +++ OK, passed 100 tests.
  6000. 648.85 s [vector] izipWith3: OK
  6001. 648.85 s [vector] +++ OK, passed 100 tests.
  6002. 648.85 s [vector] izipWithM: OK
  6003. 648.87 s [vector] +++ OK, passed 100 tests.
  6004. 648.87 s [vector] izipWithM_: OK (0.01s)
  6005. 648.87 s [vector] +++ OK, passed 100 tests.
  6006. 648.87 s [vector] zipWithM: OK
  6007. 648.89 s [vector] +++ OK, passed 100 tests.
  6008. 648.89 s [vector] zipWithM_: OK (0.01s)
  6009. 648.89 s [vector] +++ OK, passed 100 tests.
  6010. 648.89 s [vector] filter: OK
  6011. 648.89 s [vector] +++ OK, passed 100 tests.
  6012. 648.91 s [vector] ifilter: OK
  6013. 648.91 s [vector] +++ OK, passed 100 tests.
  6014. 648.92 s [vector] filterM: OK (0.03s)
  6015. 648.92 s [vector] +++ OK, passed 100 tests.
  6016. 648.92 s [vector] uniq: OK
  6017. 648.92 s [vector] +++ OK, passed 100 tests.
  6018. 648.92 s [vector] mapMaybe: OK
  6019. 648.93 s [vector] +++ OK, passed 100 tests.
  6020. 648.93 s [vector] imapMaybe: OK
  6021. 648.93 s [vector] +++ OK, passed 100 tests.
  6022. 648.93 s [vector] takeWhile: OK
  6023. 648.93 s [vector] +++ OK, passed 100 tests.
  6024. 648.93 s [vector] dropWhile: OK
  6025. 648.93 s [vector] +++ OK, passed 100 tests.
  6026. 648.93 s [vector] partition: OK
  6027. 648.93 s [vector] +++ OK, passed 100 tests.
  6028. 648.93 s [vector] partitionWith: OK
  6029. 648.93 s [vector] +++ OK, passed 100 tests.
  6030. 648.93 s [vector] span: OK
  6031. 648.93 s [vector] +++ OK, passed 100 tests.
  6032. 648.93 s [vector] break: OK
  6033. 648.93 s [vector] +++ OK, passed 100 tests.
  6034. 648.93 s [vector] spanR: OK
  6035. 648.93 s [vector] +++ OK, passed 100 tests.
  6036. 648.93 s [vector] breakR: OK
  6037. 648.93 s [vector] +++ OK, passed 100 tests.
  6038. 648.93 s [vector] groupBy: OK
  6039. 648.93 s [vector] +++ OK, passed 100 tests.
  6040. 648.93 s [vector] elem: OK
  6041. 648.93 s [vector] +++ OK, passed 100 tests.
  6042. 648.93 s [vector] notElem: OK
  6043. 648.94 s [vector] +++ OK, passed 100 tests.
  6044. 648.94 s [vector] find: OK
  6045. 648.94 s [vector] +++ OK, passed 100 tests.
  6046. 648.94 s [vector] findIndex: OK
  6047. 648.94 s [vector] +++ OK, passed 100 tests.
  6048. 648.94 s [vector] findIndexR: OK
  6049. 648.94 s [vector] +++ OK, passed 100 tests.
  6050. 648.94 s [vector] findIndices: OK
  6051. 648.94 s [vector] +++ OK, passed 100 tests.
  6052. 648.94 s [vector] elemIndex: OK
  6053. 648.94 s [vector] +++ OK, passed 100 tests.
  6054. 648.94 s [vector] elemIndices: OK
  6055. 648.94 s [vector] +++ OK, passed 100 tests.
  6056. 648.94 s [vector] foldl: OK
  6057. 648.94 s [vector] +++ OK, passed 100 tests.
  6058. 648.95 s [vector] foldl1: OK
  6059. 648.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6060. 648.95 s [vector] foldl': OK
  6061. 648.95 s [vector] +++ OK, passed 100 tests.
  6062. 648.95 s [vector] foldl1': OK
  6063. 648.95 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6064. 648.95 s [vector] foldr: OK
  6065. 648.95 s [vector] +++ OK, passed 100 tests.
  6066. 648.96 s [vector] foldr1: OK
  6067. 648.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6068. 648.96 s [vector] foldr': OK
  6069. 648.96 s [vector] +++ OK, passed 100 tests.
  6070. 648.96 s [vector] foldr1': OK
  6071. 648.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6072. 648.96 s [vector] ifoldl: OK
  6073. 648.97 s [vector] +++ OK, passed 100 tests.
  6074. 648.97 s [vector] ifoldl': OK
  6075. 648.97 s [vector] +++ OK, passed 100 tests.
  6076. 648.97 s [vector] ifoldr: OK
  6077. 648.97 s [vector] +++ OK, passed 100 tests.
  6078. 648.97 s [vector] ifoldr': OK
  6079. 648.97 s [vector] +++ OK, passed 100 tests.
  6080. 648.98 s [vector] ifoldM: OK
  6081. 648.98 s [vector] +++ OK, passed 100 tests.
  6082. 648.99 s [vector] ifoldM': OK
  6083. 648.99 s [vector] +++ OK, passed 100 tests.
  6084. 649.00 s [vector] ifoldM_: OK (0.02s)
  6085. 649.00 s [vector] +++ OK, passed 100 tests.
  6086. 649.02 s [vector] ifoldM'_: OK (0.01s)
  6087. 649.02 s [vector] +++ OK, passed 100 tests.
  6088. 649.02 s [vector] all: OK
  6089. 649.02 s [vector] +++ OK, passed 100 tests.
  6090. 649.02 s [vector] any: OK
  6091. 649.02 s [vector] +++ OK, passed 100 tests.
  6092. 649.03 s [vector] prescanl: OK
  6093. 649.03 s [vector] +++ OK, passed 100 tests.
  6094. 649.03 s [vector] prescanl': OK
  6095. 649.03 s [vector] +++ OK, passed 100 tests.
  6096. 649.03 s [vector] postscanl: OK
  6097. 649.03 s [vector] +++ OK, passed 100 tests.
  6098. 649.03 s [vector] postscanl': OK
  6099. 649.03 s [vector] +++ OK, passed 100 tests.
  6100. 649.04 s [vector] scanl: OK
  6101. 649.04 s [vector] +++ OK, passed 100 tests.
  6102. 649.04 s [vector] scanl': OK
  6103. 649.04 s [vector] +++ OK, passed 100 tests.
  6104. 649.04 s [vector] scanl1: OK
  6105. 649.04 s [vector] +++ OK, passed 100 tests.
  6106. 649.05 s [vector] scanl1': OK
  6107. 649.05 s [vector] +++ OK, passed 100 tests.
  6108. 649.05 s [vector] iscanl: OK
  6109. 649.05 s [vector] +++ OK, passed 100 tests.
  6110. 649.05 s [vector] iscanl': OK
  6111. 649.05 s [vector] +++ OK, passed 100 tests.
  6112. 649.05 s [vector] prescanr: OK
  6113. 649.05 s [vector] +++ OK, passed 100 tests.
  6114. 649.05 s [vector] prescanr': OK
  6115. 649.06 s [vector] +++ OK, passed 100 tests.
  6116. 649.06 s [vector] postscanr: OK
  6117. 649.06 s [vector] +++ OK, passed 100 tests.
  6118. 649.06 s [vector] postscanr': OK
  6119. 649.06 s [vector] +++ OK, passed 100 tests.
  6120. 649.07 s [vector] scanr: OK
  6121. 649.07 s [vector] +++ OK, passed 100 tests.
  6122. 649.07 s [vector] scanr': OK
  6123. 649.07 s [vector] +++ OK, passed 100 tests.
  6124. 649.07 s [vector] scanr1: OK
  6125. 649.07 s [vector] +++ OK, passed 100 tests.
  6126. 649.08 s [vector] scanr1': OK
  6127. 649.08 s [vector] +++ OK, passed 100 tests.
  6128. 649.08 s [vector] iscanr: OK
  6129. 649.08 s [vector] +++ OK, passed 100 tests.
  6130. 649.08 s [vector] iscanr': OK
  6131. 649.08 s [vector] +++ OK, passed 100 tests.
  6132. 649.08 s [vector] mut_read: OK
  6133. 649.08 s [vector] +++ OK, passed 100 tests; 26 discarded.
  6134. 649.08 s [vector] mut_write: OK
  6135. 649.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6136. 649.09 s [vector] mut_modify: OK
  6137. 649.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6138. 649.09 s [vector] mut_generate: OK
  6139. 649.09 s [vector] +++ OK, passed 100 tests.
  6140. 649.10 s [vector] mut_generateM: OK (0.01s)
  6141. 649.10 s [vector] +++ OK, passed 100 tests.
  6142. 649.13 s [vector] mut_mapM_: OK (0.01s)
  6143. 649.13 s [vector] +++ OK, passed 100 tests.
  6144. 649.15 s [vector] mut_imapM_: OK (0.02s)
  6145. 649.15 s [vector] +++ OK, passed 100 tests.
  6146. 649.15 s [vector] mut_forM_: OK (0.02s)
  6147. 649.15 s [vector] +++ OK, passed 100 tests.
  6148. 649.18 s [vector] mut_iforM_: OK
  6149. 649.18 s [vector] +++ OK, passed 100 tests.
  6150. 649.18 s [vector] mut_foldr: OK
  6151. 649.18 s [vector] +++ OK, passed 100 tests.
  6152. 649.18 s [vector] mut_foldr': OK
  6153. 649.18 s [vector] +++ OK, passed 100 tests.
  6154. 649.18 s [vector] mut_foldl: OK
  6155. 649.18 s [vector] +++ OK, passed 100 tests.
  6156. 649.18 s [vector] mut_foldl': OK
  6157. 649.19 s [vector] +++ OK, passed 100 tests.
  6158. 649.19 s [vector] mut_ifoldr: OK
  6159. 649.19 s [vector] +++ OK, passed 100 tests.
  6160. 649.19 s [vector] mut_ifoldr': OK
  6161. 649.19 s [vector] +++ OK, passed 100 tests.
  6162. 649.19 s [vector] mut_ifoldl: OK
  6163. 649.20 s [vector] +++ OK, passed 100 tests.
  6164. 649.20 s [vector] mut_ifoldl': OK
  6165. 649.20 s [vector] +++ OK, passed 100 tests.
  6166. 649.20 s [vector] mut_foldM: OK
  6167. 649.20 s [vector] +++ OK, passed 100 tests.
  6168. 649.21 s [vector] mut_foldM': OK
  6169. 649.21 s [vector] +++ OK, passed 100 tests.
  6170. 649.21 s [vector] mut_foldrM: OK
  6171. 649.21 s [vector] +++ OK, passed 100 tests.
  6172. 649.21 s [vector] mut_foldrM': OK
  6173. 649.21 s [vector] +++ OK, passed 100 tests.
  6174. 649.22 s [vector] mut_ifoldM: OK
  6175. 649.22 s [vector] +++ OK, passed 100 tests.
  6176. 649.22 s [vector] mut_ifoldM': OK
  6177. 649.22 s [vector] +++ OK, passed 100 tests.
  6178. 649.23 s [vector] mut_ifoldrM: OK
  6179. 649.23 s [vector] +++ OK, passed 100 tests.
  6180. 649.23 s [vector] mut_ifoldrM': OK
  6181. 649.23 s [vector] +++ OK, passed 100 tests.
  6182. 649.23 s [vector] compare: OK
  6183. 649.23 s [vector] +++ OK, passed 100 tests.
  6184. 649.23 s [vector] maximum: OK
  6185. 649.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6186. 649.23 s [vector] minimum: OK
  6187. 649.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6188. 649.23 s [vector] minIndex: OK
  6189. 649.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6190. 649.23 s [vector] maxIndex: OK
  6191. 649.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6192. 649.23 s [vector] maximumBy: OK
  6193. 649.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6194. 649.23 s [vector] minimumBy: OK
  6195. 649.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6196. 649.23 s [vector] maximumOn: OK
  6197. 649.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6198. 649.23 s [vector] minimumOn: OK
  6199. 649.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6200. 649.23 s [vector] maxIndexBy: OK
  6201. 649.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6202. 649.23 s [vector] minIndexBy: OK
  6203. 649.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6204. 649.23 s [vector] ListFirstMaxIndexWins: OK
  6205. 649.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6206. 649.23 s [vector] FalseListFirstMaxIndexWins: OK
  6207. 649.23 s [vector] +++ OK, failed as expected. (after 1 test):
  6208. 649.23 s [vector] Exception:
  6209. 649.23 s [vector] Prelude.foldr1: empty list
  6210. 649.24 s [vector] CallStack (from HasCallStack):
  6211. 649.24 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6212. 649.24 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6213. 649.24 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6214. 649.24 s [vector] []
  6215. 649.24 s [vector] zip: OK
  6216. 649.24 s [vector] +++ OK, passed 100 tests.
  6217. 649.24 s [vector] zip3: OK
  6218. 649.24 s [vector] +++ OK, passed 100 tests.
  6219. 649.24 s [vector] unzip: OK
  6220. 649.24 s [vector] +++ OK, passed 100 tests.
  6221. 649.24 s [vector] unzip3: OK
  6222. 649.24 s [vector] +++ OK, passed 100 tests.
  6223. 649.24 s [vector] indexed: OK
  6224. 649.25 s [vector] +++ OK, passed 100 tests.
  6225. 649.25 s [vector] update: OK (0.01s)
  6226. 649.25 s [vector] +++ OK, passed 100 tests.
  6227. 649.27 s [vector] concat: OK
  6228. 649.27 s [vector] +++ OK, passed 100 tests.
  6229. 649.27 s [vector] mempty: OK
  6230. 649.27 s [vector] +++ OK, passed 100 tests.
  6231. 649.28 s [vector] mappend: OK
  6232. 649.28 s [vector] +++ OK, passed 100 tests.
  6233. 649.28 s [vector] mconcat: OK (0.01s)
  6234. 649.28 s [vector] +++ OK, passed 100 tests.
  6235. 649.28 s [vector] fmap: OK
  6236. 649.28 s [vector] +++ OK, passed 100 tests.
  6237. 649.28 s [vector] return: OK
  6238. 649.29 s [vector] +++ OK, passed 100 tests.
  6239. 649.30 s [vector] bind: OK (0.02s)
  6240. 649.30 s [vector] +++ OK, passed 100 tests.
  6241. 649.30 s [vector] mzip: OK
  6242. 649.30 s [vector] +++ OK, passed 100 tests.
  6243. 649.30 s [vector] munzip: OK
  6244. 649.30 s [vector] +++ OK, passed 100 tests.
  6245. 649.31 s [vector] applicative_pure: OK
  6246. 649.31 s [vector] +++ OK, passed 100 tests.
  6247. 649.34 s [vector] applicative_appl: OK (0.04s)
  6248. 649.34 s [vector] +++ OK, passed 100 tests.
  6249. 649.34 s [vector] alternative_empty: OK
  6250. 649.34 s [vector] +++ OK, passed 100 tests.
  6251. 649.34 s [vector] alternative_or: OK
  6252. 649.34 s [vector] +++ OK, passed 100 tests.
  6253. 649.37 s [vector] sequence: OK (0.02s)
  6254. 649.37 s [vector] +++ OK, passed 100 tests.
  6255. 649.38 s [vector] sequence_: OK (0.01s)
  6256. 649.38 s [vector] +++ OK, passed 100 tests.
  6257. 649.38 s [vector] glength: OK
  6258. 649.38 s [vector] +++ OK, passed 100 tests.
  6259. 649.38 s [vector] sum: OK
  6260. 649.38 s [vector] +++ OK, passed 100 tests.
  6261. 649.38 s [vector] product: OK
  6262. 649.38 s [vector] +++ OK, passed 100 tests.
  6263. 649.38 s [vector] enumFromN: OK
  6264. 649.38 s [vector] +++ OK, passed 100 tests.
  6265. 649.38 s [vector] enumFromThenN: OK
  6266. 649.38 s [vector] +++ OK, passed 100 tests.
  6267. 649.38 s [vector] enumFromTo: OK
  6268. 649.38 s [vector] +++ OK, passed 100 tests.
  6269. 649.38 s [vector] enumFromThenTo: OK
  6270. 649.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6271. 649.38 s [vector] unstream
  6272. 649.38 s [vector] unstream == vunstream (exact): OK
  6273. 649.38 s [vector] +++ OK, passed 100 tests.
  6274. 649.38 s [vector] unstream == vunstream (unknown): OK
  6275. 649.38 s [vector] +++ OK, passed 100 tests.
  6276. 649.38 s [vector] unstreamR ~= vunstream (exact): OK
  6277. 649.39 s [vector] +++ OK, passed 100 tests.
  6278. 649.39 s [vector] unstreamR ~= vunstream (unknown): OK
  6279. 649.39 s [vector] +++ OK, passed 100 tests.
  6280. 649.39 s [vector] Tests.Vector.Primitive
  6281. 649.39 s [vector] Int
  6282. 649.39 s [vector] fromList.toList == id: OK
  6283. 649.39 s [vector] +++ OK, passed 100 tests.
  6284. 649.39 s [vector] toList.fromList == id: OK
  6285. 649.39 s [vector] +++ OK, passed 100 tests.
  6286. 649.39 s [vector] unstream.stream == id: OK
  6287. 649.39 s [vector] +++ OK, passed 100 tests.
  6288. 649.39 s [vector] stream.unstream == id: OK
  6289. 649.39 s [vector] +++ OK, passed 100 tests.
  6290. 649.39 s [vector] eq: OK
  6291. 649.39 s [vector] +++ OK, passed 100 tests.
  6292. 649.39 s [vector] length: OK
  6293. 649.39 s [vector] +++ OK, passed 100 tests.
  6294. 649.39 s [vector] null: OK
  6295. 649.39 s [vector] +++ OK, passed 100 tests.
  6296. 649.39 s [vector] index: OK
  6297. 649.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6298. 649.39 s [vector] safeIndex: OK
  6299. 649.39 s [vector] +++ OK, passed 100 tests.
  6300. 649.39 s [vector] head: OK
  6301. 649.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6302. 649.39 s [vector] last: OK
  6303. 649.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6304. 649.40 s [vector] unsafeIndex: OK
  6305. 649.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6306. 649.40 s [vector] unsafeHead: OK
  6307. 649.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6308. 649.40 s [vector] unsafeLast: OK
  6309. 649.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6310. 649.41 s [vector] slice: OK
  6311. 649.42 s [vector] +++ OK, passed 100 tests.
  6312. 649.42 s [vector] init: OK
  6313. 649.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6314. 649.42 s [vector] tail: OK
  6315. 649.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6316. 649.43 s [vector] take: OK
  6317. 649.43 s [vector] +++ OK, passed 100 tests.
  6318. 649.43 s [vector] drop: OK
  6319. 649.43 s [vector] +++ OK, passed 100 tests.
  6320. 649.43 s [vector] splitAt: OK
  6321. 649.44 s [vector] +++ OK, passed 100 tests.
  6322. 649.44 s [vector] empty: OK
  6323. 649.44 s [vector] +++ OK, passed 100 tests.
  6324. 649.44 s [vector] singleton: OK
  6325. 649.44 s [vector] +++ OK, passed 100 tests.
  6326. 649.44 s [vector] replicate: OK
  6327. 649.44 s [vector] +++ OK, passed 100 tests.
  6328. 649.44 s [vector] generate: OK
  6329. 649.44 s [vector] +++ OK, passed 100 tests.
  6330. 649.45 s [vector] iterateN: OK
  6331. 649.45 s [vector] +++ OK, passed 100 tests.
  6332. 649.48 s [vector] iterateNM: OK (0.03s)
  6333. 649.48 s [vector] +++ OK, passed 100 tests.
  6334. 649.51 s [vector] generateM: OK (0.02s)
  6335. 649.51 s [vector] +++ OK, passed 100 tests.
  6336. 649.51 s [vector] replicateM: OK (0.01s)
  6337. 649.51 s [vector] +++ OK, passed 100 tests.
  6338. 649.52 s [vector] create: OK
  6339. 649.52 s [vector] +++ OK, passed 100 tests.
  6340. 649.52 s [vector] createT: OK
  6341. 649.52 s [vector] +++ OK, passed 100 tests.
  6342. 649.52 s [vector] unfoldr: OK
  6343. 649.52 s [vector] +++ OK, passed 100 tests.
  6344. 649.52 s [vector] unfoldrN: OK
  6345. 649.52 s [vector] +++ OK, passed 100 tests.
  6346. 649.52 s [vector] unfoldrExactN: OK
  6347. 649.53 s [vector] +++ OK, passed 100 tests.
  6348. 649.53 s [vector] unfoldrM: OK
  6349. 649.53 s [vector] +++ OK, passed 100 tests.
  6350. 649.53 s [vector] unfoldrNM: OK
  6351. 649.53 s [vector] +++ OK, passed 100 tests.
  6352. 649.60 s [vector] unfoldrExactNM: OK (0.04s)
  6353. 649.60 s [vector] +++ OK, passed 100 tests.
  6354. 649.60 s [vector] constructN: OK
  6355. 649.60 s [vector] +++ OK, passed 100 tests.
  6356. 649.60 s [vector] constructrN: OK
  6357. 649.60 s [vector] +++ OK, passed 100 tests.
  6358. 649.60 s [vector] cons: OK
  6359. 649.60 s [vector] +++ OK, passed 100 tests.
  6360. 649.60 s [vector] snoc: OK
  6361. 649.60 s [vector] +++ OK, passed 100 tests.
  6362. 649.62 s [vector] append: OK
  6363. 649.62 s [vector] +++ OK, passed 100 tests.
  6364. 649.62 s [vector] concat: OK (0.02s)
  6365. 649.62 s [vector] +++ OK, passed 100 tests.
  6366. 649.62 s [vector] force: OK
  6367. 649.63 s [vector] +++ OK, passed 100 tests.
  6368. 649.63 s [vector] upd: OK
  6369. 649.63 s [vector] +++ OK, passed 100 tests.
  6370. 649.63 s [vector] accum: OK
  6371. 649.63 s [vector] +++ OK, passed 100 tests.
  6372. 649.63 s [vector] reverse: OK
  6373. 649.63 s [vector] +++ OK, passed 100 tests.
  6374. 649.64 s [vector] backpermute: OK
  6375. 649.64 s [vector] +++ OK, passed 100 tests.
  6376. 649.64 s [vector] map: OK
  6377. 649.64 s [vector] +++ OK, passed 100 tests.
  6378. 649.64 s [vector] imap: OK
  6379. 649.64 s [vector] +++ OK, passed 100 tests.
  6380. 649.64 s [vector] concatMap: OK
  6381. 649.64 s [vector] +++ OK, passed 100 tests.
  6382. 649.64 s [vector] mapM: OK
  6383. 649.65 s [vector] +++ OK, passed 100 tests.
  6384. 649.66 s [vector] mapM_: OK (0.02s)
  6385. 649.66 s [vector] +++ OK, passed 100 tests.
  6386. 649.66 s [vector] forM: OK
  6387. 649.67 s [vector] +++ OK, passed 100 tests.
  6388. 649.68 s [vector] forM_: OK (0.01s)
  6389. 649.68 s [vector] +++ OK, passed 100 tests.
  6390. 649.68 s [vector] imapM: OK
  6391. 649.69 s [vector] +++ OK, passed 100 tests.
  6392. 649.70 s [vector] imapM_: OK (0.02s)
  6393. 649.70 s [vector] +++ OK, passed 100 tests.
  6394. 649.70 s [vector] zipWith: OK
  6395. 649.70 s [vector] +++ OK, passed 100 tests.
  6396. 649.71 s [vector] zipWith3: OK
  6397. 649.71 s [vector] +++ OK, passed 100 tests.
  6398. 649.71 s [vector] izipWith: OK
  6399. 649.71 s [vector] +++ OK, passed 100 tests.
  6400. 649.71 s [vector] izipWith3: OK
  6401. 649.71 s [vector] +++ OK, passed 100 tests.
  6402. 649.72 s [vector] izipWithM: OK
  6403. 649.72 s [vector] +++ OK, passed 100 tests.
  6404. 649.73 s [vector] izipWithM_: OK (0.01s)
  6405. 649.73 s [vector] +++ OK, passed 100 tests.
  6406. 649.74 s [vector] zipWithM: OK
  6407. 649.74 s [vector] +++ OK, passed 100 tests.
  6408. 649.74 s [vector] zipWithM_: OK (0.01s)
  6409. 649.74 s [vector] +++ OK, passed 100 tests.
  6410. 649.74 s [vector] filter: OK
  6411. 649.74 s [vector] +++ OK, passed 100 tests.
  6412. 649.75 s [vector] ifilter: OK
  6413. 649.77 s [vector] +++ OK, passed 100 tests.
  6414. 649.78 s [vector] filterM: OK (0.03s)
  6415. 649.78 s [vector] +++ OK, passed 100 tests.
  6416. 649.78 s [vector] uniq: OK
  6417. 649.78 s [vector] +++ OK, passed 100 tests.
  6418. 649.78 s [vector] mapMaybe: OK
  6419. 649.78 s [vector] +++ OK, passed 100 tests.
  6420. 649.78 s [vector] imapMaybe: OK
  6421. 649.78 s [vector] +++ OK, passed 100 tests.
  6422. 649.78 s [vector] takeWhile: OK
  6423. 649.78 s [vector] +++ OK, passed 100 tests.
  6424. 649.79 s [vector] dropWhile: OK
  6425. 649.79 s [vector] +++ OK, passed 100 tests.
  6426. 649.79 s [vector] partition: OK
  6427. 649.79 s [vector] +++ OK, passed 100 tests.
  6428. 649.79 s [vector] partitionWith: OK
  6429. 649.79 s [vector] +++ OK, passed 100 tests.
  6430. 649.79 s [vector] span: OK
  6431. 649.79 s [vector] +++ OK, passed 100 tests.
  6432. 649.79 s [vector] break: OK
  6433. 649.79 s [vector] +++ OK, passed 100 tests.
  6434. 649.79 s [vector] spanR: OK
  6435. 649.79 s [vector] +++ OK, passed 100 tests.
  6436. 649.79 s [vector] breakR: OK
  6437. 649.79 s [vector] +++ OK, passed 100 tests.
  6438. 649.79 s [vector] groupBy: OK
  6439. 649.79 s [vector] +++ OK, passed 100 tests.
  6440. 649.79 s [vector] elem: OK
  6441. 649.79 s [vector] +++ OK, passed 100 tests.
  6442. 649.80 s [vector] notElem: OK
  6443. 649.80 s [vector] +++ OK, passed 100 tests.
  6444. 649.80 s [vector] find: OK
  6445. 649.80 s [vector] +++ OK, passed 100 tests.
  6446. 649.80 s [vector] findIndex: OK
  6447. 649.80 s [vector] +++ OK, passed 100 tests.
  6448. 649.80 s [vector] findIndexR: OK
  6449. 649.80 s [vector] +++ OK, passed 100 tests.
  6450. 649.80 s [vector] findIndices: OK
  6451. 649.80 s [vector] +++ OK, passed 100 tests.
  6452. 649.80 s [vector] elemIndex: OK
  6453. 649.80 s [vector] +++ OK, passed 100 tests.
  6454. 649.80 s [vector] elemIndices: OK
  6455. 649.80 s [vector] +++ OK, passed 100 tests.
  6456. 649.80 s [vector] foldl: OK
  6457. 649.80 s [vector] +++ OK, passed 100 tests.
  6458. 649.81 s [vector] foldl1: OK
  6459. 649.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6460. 649.81 s [vector] foldl': OK
  6461. 649.81 s [vector] +++ OK, passed 100 tests.
  6462. 649.82 s [vector] foldl1': OK
  6463. 649.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6464. 649.82 s [vector] foldr: OK
  6465. 649.82 s [vector] +++ OK, passed 100 tests.
  6466. 649.82 s [vector] foldr1: OK
  6467. 649.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6468. 649.82 s [vector] foldr': OK
  6469. 649.82 s [vector] +++ OK, passed 100 tests.
  6470. 649.82 s [vector] foldr1': OK
  6471. 649.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6472. 649.83 s [vector] ifoldl: OK
  6473. 649.83 s [vector] +++ OK, passed 100 tests.
  6474. 649.83 s [vector] ifoldl': OK
  6475. 649.83 s [vector] +++ OK, passed 100 tests.
  6476. 649.84 s [vector] ifoldr: OK
  6477. 649.84 s [vector] +++ OK, passed 100 tests.
  6478. 649.84 s [vector] ifoldr': OK
  6479. 649.84 s [vector] +++ OK, passed 100 tests.
  6480. 649.84 s [vector] ifoldM: OK
  6481. 649.84 s [vector] +++ OK, passed 100 tests.
  6482. 649.86 s [vector] ifoldM': OK
  6483. 649.86 s [vector] +++ OK, passed 100 tests.
  6484. 649.89 s [vector] ifoldM_: OK (0.02s)
  6485. 649.89 s [vector] +++ OK, passed 100 tests.
  6486. 649.89 s [vector] ifoldM'_: OK (0.02s)
  6487. 649.89 s [vector] +++ OK, passed 100 tests.
  6488. 649.89 s [vector] all: OK
  6489. 649.89 s [vector] +++ OK, passed 100 tests.
  6490. 649.89 s [vector] any: OK
  6491. 649.89 s [vector] +++ OK, passed 100 tests.
  6492. 649.90 s [vector] prescanl: OK
  6493. 649.90 s [vector] +++ OK, passed 100 tests.
  6494. 649.90 s [vector] prescanl': OK
  6495. 649.90 s [vector] +++ OK, passed 100 tests.
  6496. 649.90 s [vector] postscanl: OK
  6497. 649.90 s [vector] +++ OK, passed 100 tests.
  6498. 649.91 s [vector] postscanl': OK
  6499. 649.91 s [vector] +++ OK, passed 100 tests.
  6500. 649.91 s [vector] scanl: OK
  6501. 649.91 s [vector] +++ OK, passed 100 tests.
  6502. 649.91 s [vector] scanl': OK
  6503. 649.91 s [vector] +++ OK, passed 100 tests.
  6504. 649.91 s [vector] scanl1: OK
  6505. 649.92 s [vector] +++ OK, passed 100 tests.
  6506. 649.92 s [vector] scanl1': OK
  6507. 649.92 s [vector] +++ OK, passed 100 tests.
  6508. 649.92 s [vector] iscanl: OK
  6509. 649.92 s [vector] +++ OK, passed 100 tests.
  6510. 649.93 s [vector] iscanl': OK
  6511. 649.93 s [vector] +++ OK, passed 100 tests.
  6512. 649.93 s [vector] prescanr: OK
  6513. 649.93 s [vector] +++ OK, passed 100 tests.
  6514. 649.93 s [vector] prescanr': OK
  6515. 649.93 s [vector] +++ OK, passed 100 tests.
  6516. 649.94 s [vector] postscanr: OK
  6517. 649.94 s [vector] +++ OK, passed 100 tests.
  6518. 649.94 s [vector] postscanr': OK
  6519. 649.94 s [vector] +++ OK, passed 100 tests.
  6520. 649.94 s [vector] scanr: OK
  6521. 649.94 s [vector] +++ OK, passed 100 tests.
  6522. 649.94 s [vector] scanr': OK
  6523. 649.94 s [vector] +++ OK, passed 100 tests.
  6524. 649.95 s [vector] scanr1: OK
  6525. 649.95 s [vector] +++ OK, passed 100 tests.
  6526. 649.95 s [vector] scanr1': OK
  6527. 649.95 s [vector] +++ OK, passed 100 tests.
  6528. 649.95 s [vector] iscanr: OK
  6529. 649.96 s [vector] +++ OK, passed 100 tests.
  6530. 649.96 s [vector] iscanr': OK
  6531. 649.96 s [vector] +++ OK, passed 100 tests.
  6532. 649.96 s [vector] mut_read: OK
  6533. 649.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6534. 649.96 s [vector] mut_write: OK
  6535. 649.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6536. 649.96 s [vector] mut_modify: OK
  6537. 649.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6538. 649.96 s [vector] mut_generate: OK
  6539. 649.97 s [vector] +++ OK, passed 100 tests.
  6540. 649.99 s [vector] mut_generateM: OK (0.01s)
  6541. 649.99 s [vector] +++ OK, passed 100 tests.
  6542. 650.01 s [vector] mut_mapM_: OK (0.02s)
  6543. 650.01 s [vector] +++ OK, passed 100 tests.
  6544. 650.03 s [vector] mut_imapM_: OK (0.02s)
  6545. 650.03 s [vector] +++ OK, passed 100 tests.
  6546. 650.05 s [vector] mut_forM_: OK (0.02s)
  6547. 650.05 s [vector] +++ OK, passed 100 tests.
  6548. 650.07 s [vector] mut_iforM_: OK (0.02s)
  6549. 650.07 s [vector] +++ OK, passed 100 tests.
  6550. 650.07 s [vector] mut_foldr: OK
  6551. 650.07 s [vector] +++ OK, passed 100 tests.
  6552. 650.07 s [vector] mut_foldr': OK
  6553. 650.07 s [vector] +++ OK, passed 100 tests.
  6554. 650.07 s [vector] mut_foldl: OK
  6555. 650.08 s [vector] +++ OK, passed 100 tests.
  6556. 650.08 s [vector] mut_foldl': OK
  6557. 650.08 s [vector] +++ OK, passed 100 tests.
  6558. 650.08 s [vector] mut_ifoldr: OK
  6559. 650.08 s [vector] +++ OK, passed 100 tests.
  6560. 650.09 s [vector] mut_ifoldr': OK
  6561. 650.09 s [vector] +++ OK, passed 100 tests.
  6562. 650.09 s [vector] mut_ifoldl: OK
  6563. 650.09 s [vector] +++ OK, passed 100 tests.
  6564. 650.10 s [vector] mut_ifoldl': OK
  6565. 650.10 s [vector] +++ OK, passed 100 tests.
  6566. 650.10 s [vector] mut_foldM: OK
  6567. 650.10 s [vector] +++ OK, passed 100 tests.
  6568. 650.10 s [vector] mut_foldM': OK
  6569. 650.10 s [vector] +++ OK, passed 100 tests.
  6570. 650.10 s [vector] mut_foldrM: OK
  6571. 650.11 s [vector] +++ OK, passed 100 tests.
  6572. 650.11 s [vector] mut_foldrM': OK
  6573. 650.11 s [vector] +++ OK, passed 100 tests.
  6574. 650.12 s [vector] mut_ifoldM: OK
  6575. 650.12 s [vector] +++ OK, passed 100 tests.
  6576. 650.12 s [vector] mut_ifoldM': OK
  6577. 650.12 s [vector] +++ OK, passed 100 tests.
  6578. 650.13 s [vector] mut_ifoldrM: OK
  6579. 650.13 s [vector] +++ OK, passed 100 tests.
  6580. 650.13 s [vector] mut_ifoldrM': OK
  6581. 650.13 s [vector] +++ OK, passed 100 tests.
  6582. 650.13 s [vector] compare: OK
  6583. 650.13 s [vector] +++ OK, passed 100 tests.
  6584. 650.13 s [vector] maximum: OK
  6585. 650.13 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6586. 650.13 s [vector] minimum: OK
  6587. 650.13 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6588. 650.13 s [vector] minIndex: OK
  6589. 650.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6590. 650.13 s [vector] maxIndex: OK
  6591. 650.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6592. 650.13 s [vector] maximumBy: OK
  6593. 650.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6594. 650.13 s [vector] minimumBy: OK
  6595. 650.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6596. 650.14 s [vector] maximumOn: OK
  6597. 650.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6598. 650.14 s [vector] minimumOn: OK
  6599. 650.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6600. 650.14 s [vector] maxIndexBy: OK
  6601. 650.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6602. 650.14 s [vector] minIndexBy: OK
  6603. 650.14 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6604. 650.14 s [vector] ListFirstMaxIndexWins: OK
  6605. 650.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6606. 650.14 s [vector] FalseListFirstMaxIndexWins: OK
  6607. 650.14 s [vector] +++ OK, failed as expected. (after 1 test):
  6608. 650.14 s [vector] Exception:
  6609. 650.14 s [vector] Prelude.foldr1: empty list
  6610. 650.14 s [vector] CallStack (from HasCallStack):
  6611. 650.14 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6612. 650.14 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6613. 650.14 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6614. 650.14 s [vector] []
  6615. 650.14 s [vector] mempty: OK
  6616. 650.14 s [vector] +++ OK, passed 100 tests.
  6617. 650.15 s [vector] mappend: OK
  6618. 650.15 s [vector] +++ OK, passed 100 tests.
  6619. 650.16 s [vector] mconcat: OK (0.02s)
  6620. 650.16 s [vector] +++ OK, passed 100 tests.
  6621. 650.16 s [vector] glength: OK
  6622. 650.16 s [vector] +++ OK, passed 100 tests.
  6623. 650.16 s [vector] sum: OK
  6624. 650.16 s [vector] +++ OK, passed 100 tests.
  6625. 650.16 s [vector] product: OK
  6626. 650.16 s [vector] +++ OK, passed 100 tests.
  6627. 650.16 s [vector] enumFromN: OK
  6628. 650.16 s [vector] +++ OK, passed 100 tests.
  6629. 650.16 s [vector] enumFromThenN: OK
  6630. 650.16 s [vector] +++ OK, passed 100 tests.
  6631. 650.16 s [vector] enumFromTo: OK
  6632. 650.16 s [vector] +++ OK, passed 100 tests.
  6633. 650.16 s [vector] enumFromThenTo: OK
  6634. 650.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6635. 650.16 s [vector] Double
  6636. 650.16 s [vector] fromList.toList == id: OK
  6637. 650.16 s [vector] +++ OK, passed 100 tests.
  6638. 650.16 s [vector] toList.fromList == id: OK
  6639. 650.16 s [vector] +++ OK, passed 100 tests.
  6640. 650.16 s [vector] unstream.stream == id: OK
  6641. 650.16 s [vector] +++ OK, passed 100 tests.
  6642. 650.16 s [vector] stream.unstream == id: OK
  6643. 650.16 s [vector] +++ OK, passed 100 tests.
  6644. 650.16 s [vector] eq: OK
  6645. 650.16 s [vector] +++ OK, passed 100 tests.
  6646. 650.17 s [vector] length: OK
  6647. 650.17 s [vector] +++ OK, passed 100 tests.
  6648. 650.17 s [vector] null: OK
  6649. 650.17 s [vector] +++ OK, passed 100 tests.
  6650. 650.17 s [vector] index: OK
  6651. 650.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6652. 650.17 s [vector] safeIndex: OK
  6653. 650.17 s [vector] +++ OK, passed 100 tests.
  6654. 650.17 s [vector] head: OK
  6655. 650.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6656. 650.17 s [vector] last: OK
  6657. 650.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6658. 650.17 s [vector] unsafeIndex: OK
  6659. 650.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6660. 650.17 s [vector] unsafeHead: OK
  6661. 650.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6662. 650.17 s [vector] unsafeLast: OK
  6663. 650.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6664. 650.17 s [vector] slice: OK
  6665. 650.17 s [vector] +++ OK, passed 100 tests.
  6666. 650.18 s [vector] init: OK
  6667. 650.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6668. 650.18 s [vector] tail: OK
  6669. 650.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6670. 650.18 s [vector] take: OK
  6671. 650.18 s [vector] +++ OK, passed 100 tests.
  6672. 650.18 s [vector] drop: OK
  6673. 650.18 s [vector] +++ OK, passed 100 tests.
  6674. 650.18 s [vector] splitAt: OK
  6675. 650.18 s [vector] +++ OK, passed 100 tests.
  6676. 650.18 s [vector] empty: OK
  6677. 650.18 s [vector] +++ OK, passed 100 tests.
  6678. 650.18 s [vector] singleton: OK
  6679. 650.18 s [vector] +++ OK, passed 100 tests.
  6680. 650.18 s [vector] replicate: OK
  6681. 650.18 s [vector] +++ OK, passed 100 tests.
  6682. 650.18 s [vector] generate: OK
  6683. 650.18 s [vector] +++ OK, passed 100 tests.
  6684. 650.18 s [vector] iterateN: OK
  6685. 650.19 s [vector] +++ OK, passed 100 tests.
  6686. 650.23 s [vector] iterateNM: OK (0.03s)
  6687. 650.23 s [vector] +++ OK, passed 100 tests.
  6688. 650.25 s [vector] generateM: OK (0.03s)
  6689. 650.25 s [vector] +++ OK, passed 100 tests.
  6690. 650.25 s [vector] replicateM: OK
  6691. 650.25 s [vector] +++ OK, passed 100 tests.
  6692. 650.25 s [vector] create: OK
  6693. 650.25 s [vector] +++ OK, passed 100 tests.
  6694. 650.25 s [vector] createT: OK
  6695. 650.25 s [vector] +++ OK, passed 100 tests.
  6696. 650.25 s [vector] unfoldr: OK
  6697. 650.25 s [vector] +++ OK, passed 100 tests.
  6698. 650.25 s [vector] unfoldrN: OK
  6699. 650.26 s [vector] +++ OK, passed 100 tests.
  6700. 650.26 s [vector] unfoldrExactN: OK
  6701. 650.26 s [vector] +++ OK, passed 100 tests.
  6702. 650.26 s [vector] unfoldrM: OK
  6703. 650.26 s [vector] +++ OK, passed 100 tests.
  6704. 650.26 s [vector] unfoldrNM: OK
  6705. 650.27 s [vector] +++ OK, passed 100 tests.
  6706. 650.31 s [vector] unfoldrExactNM: OK (0.03s)
  6707. 650.31 s [vector] +++ OK, passed 100 tests.
  6708. 650.33 s [vector] constructN: OK (0.02s)
  6709. 650.33 s [vector] +++ OK, passed 100 tests.
  6710. 650.33 s [vector] constructrN: OK (0.01s)
  6711. 650.33 s [vector] +++ OK, passed 100 tests.
  6712. 650.33 s [vector] cons: OK
  6713. 650.33 s [vector] +++ OK, passed 100 tests.
  6714. 650.33 s [vector] snoc: OK
  6715. 650.33 s [vector] +++ OK, passed 100 tests.
  6716. 650.35 s [vector] append: OK
  6717. 650.35 s [vector] +++ OK, passed 100 tests.
  6718. 650.35 s [vector] concat: OK (0.02s)
  6719. 650.35 s [vector] +++ OK, passed 100 tests.
  6720. 650.35 s [vector] force: OK
  6721. 650.36 s [vector] +++ OK, passed 100 tests.
  6722. 650.37 s [vector] upd: OK
  6723. 650.37 s [vector] +++ OK, passed 100 tests.
  6724. 650.37 s [vector] accum: OK (0.01s)
  6725. 650.37 s [vector] +++ OK, passed 100 tests.
  6726. 650.37 s [vector] reverse: OK
  6727. 650.38 s [vector] +++ OK, passed 100 tests.
  6728. 650.38 s [vector] backpermute: OK
  6729. 650.38 s [vector] +++ OK, passed 100 tests.
  6730. 650.38 s [vector] map: OK
  6731. 650.38 s [vector] +++ OK, passed 100 tests.
  6732. 650.39 s [vector] imap: OK
  6733. 650.40 s [vector] +++ OK, passed 100 tests.
  6734. 650.40 s [vector] concatMap: OK
  6735. 650.40 s [vector] +++ OK, passed 100 tests.
  6736. 650.41 s [vector] mapM: OK
  6737. 650.43 s [vector] +++ OK, passed 100 tests.
  6738. 650.45 s [vector] mapM_: OK (0.03s)
  6739. 650.45 s [vector] +++ OK, passed 100 tests.
  6740. 650.47 s [vector] forM: OK
  6741. 650.47 s [vector] +++ OK, passed 100 tests.
  6742. 650.49 s [vector] forM_: OK (0.03s)
  6743. 650.49 s [vector] +++ OK, passed 100 tests.
  6744. 650.51 s [vector] imapM: OK
  6745. 650.51 s [vector] +++ OK, passed 100 tests.
  6746. 650.54 s [vector] imapM_: OK (0.04s)
  6747. 650.54 s [vector] +++ OK, passed 100 tests.
  6748. 650.55 s [vector] zipWith: OK
  6749. 650.55 s [vector] +++ OK, passed 100 tests.
  6750. 650.56 s [vector] zipWith3: OK (0.01s)
  6751. 650.56 s [vector] +++ OK, passed 100 tests.
  6752. 650.57 s [vector] izipWith: OK (0.01s)
  6753. 650.57 s [vector] +++ OK, passed 100 tests.
  6754. 650.59 s [vector] izipWith3: OK (0.01s)
  6755. 650.59 s [vector] +++ OK, passed 100 tests.
  6756. 650.59 s [vector] izipWithM: OK (0.01s)
  6757. 650.59 s [vector] +++ OK, passed 100 tests.
  6758. 650.62 s [vector] izipWithM_: OK (0.03s)
  6759. 650.62 s [vector] +++ OK, passed 100 tests.
  6760. 650.62 s [vector] zipWithM: OK (0.01s)
  6761. 650.62 s [vector] +++ OK, passed 100 tests.
  6762. 650.66 s [vector] zipWithM_: OK (0.03s)
  6763. 650.66 s [vector] +++ OK, passed 100 tests.
  6764. 650.67 s [vector] filter: OK
  6765. 650.67 s [vector] +++ OK, passed 100 tests.
  6766. 650.69 s [vector] ifilter: OK
  6767. 650.69 s [vector] +++ OK, passed 100 tests.
  6768. 650.72 s [vector] filterM: OK (0.05s)
  6769. 650.72 s [vector] +++ OK, passed 100 tests.
  6770. 650.73 s [vector] uniq: OK
  6771. 650.73 s [vector] +++ OK, passed 100 tests.
  6772. 650.74 s [vector] mapMaybe: OK
  6773. 650.74 s [vector] +++ OK, passed 100 tests.
  6774. 650.75 s [vector] imapMaybe: OK
  6775. 650.75 s [vector] +++ OK, passed 100 tests.
  6776. 650.75 s [vector] takeWhile: OK
  6777. 650.75 s [vector] +++ OK, passed 100 tests.
  6778. 650.75 s [vector] dropWhile: OK
  6779. 650.75 s [vector] +++ OK, passed 100 tests.
  6780. 650.76 s [vector] partition: OK
  6781. 650.76 s [vector] +++ OK, passed 100 tests.
  6782. 650.76 s [vector] partitionWith: OK
  6783. 650.76 s [vector] +++ OK, passed 100 tests.
  6784. 650.76 s [vector] span: OK
  6785. 650.76 s [vector] +++ OK, passed 100 tests.
  6786. 650.76 s [vector] break: OK
  6787. 650.76 s [vector] +++ OK, passed 100 tests.
  6788. 650.76 s [vector] spanR: OK
  6789. 650.76 s [vector] +++ OK, passed 100 tests.
  6790. 650.76 s [vector] breakR: OK
  6791. 650.76 s [vector] +++ OK, passed 100 tests.
  6792. 650.78 s [vector] groupBy: OK
  6793. 650.78 s [vector] +++ OK, passed 100 tests.
  6794. 650.78 s [vector] elem: OK
  6795. 650.78 s [vector] +++ OK, passed 100 tests.
  6796. 650.78 s [vector] notElem: OK
  6797. 650.78 s [vector] +++ OK, passed 100 tests.
  6798. 650.78 s [vector] find: OK
  6799. 650.78 s [vector] +++ OK, passed 100 tests.
  6800. 650.78 s [vector] findIndex: OK
  6801. 650.79 s [vector] +++ OK, passed 100 tests.
  6802. 650.79 s [vector] findIndexR: OK
  6803. 650.79 s [vector] +++ OK, passed 100 tests.
  6804. 650.79 s [vector] findIndices: OK
  6805. 650.79 s [vector] +++ OK, passed 100 tests.
  6806. 650.80 s [vector] elemIndex: OK
  6807. 650.80 s [vector] +++ OK, passed 100 tests.
  6808. 650.80 s [vector] elemIndices: OK
  6809. 650.80 s [vector] +++ OK, passed 100 tests.
  6810. 650.83 s [vector] foldl: OK
  6811. 650.83 s [vector] +++ OK, passed 100 tests.
  6812. 650.84 s [vector] foldl1: OK (0.02s)
  6813. 650.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6814. 650.84 s [vector] foldl': OK (0.02s)
  6815. 650.84 s [vector] +++ OK, passed 100 tests.
  6816. 650.86 s [vector] foldl1': OK (0.01s)
  6817. 650.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6818. 650.89 s [vector] foldr: OK (0.01s)
  6819. 650.89 s [vector] +++ OK, passed 100 tests.
  6820. 650.90 s [vector] foldr1: OK (0.01s)
  6821. 650.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6822. 650.91 s [vector] foldr': OK (0.01s)
  6823. 650.91 s [vector] +++ OK, passed 100 tests.
  6824. 650.93 s [vector] foldr1': OK (0.02s)
  6825. 650.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6826. 650.95 s [vector] ifoldl: OK (0.02s)
  6827. 650.95 s [vector] +++ OK, passed 100 tests.
  6828. 650.97 s [vector] ifoldl': OK (0.02s)
  6829. 650.97 s [vector] +++ OK, passed 100 tests.
  6830. 650.99 s [vector] ifoldr: OK (0.02s)
  6831. 650.99 s [vector] +++ OK, passed 100 tests.
  6832. 650.99 s [vector] ifoldr': OK (0.02s)
  6833. 650.99 s [vector] +++ OK, passed 100 tests.
  6834. 651.00 s [vector] ifoldM: OK (0.01s)
  6835. 651.00 s [vector] +++ OK, passed 100 tests.
  6836. 651.03 s [vector] ifoldM': OK (0.02s)
  6837. 651.03 s [vector] +++ OK, passed 100 tests.
  6838. 651.07 s [vector] ifoldM_: OK (0.04s)
  6839. 651.07 s [vector] +++ OK, passed 100 tests.
  6840. 651.10 s [vector] ifoldM'_: OK (0.04s)
  6841. 651.10 s [vector] +++ OK, passed 100 tests.
  6842. 651.10 s [vector] all: OK
  6843. 651.10 s [vector] +++ OK, passed 100 tests.
  6844. 651.10 s [vector] any: OK
  6845. 651.10 s [vector] +++ OK, passed 100 tests.
  6846. 651.12 s [vector] prescanl: OK (0.01s)
  6847. 651.12 s [vector] +++ OK, passed 100 tests.
  6848. 651.15 s [vector] prescanl': OK (0.01s)
  6849. 651.15 s [vector] +++ OK, passed 100 tests.
  6850. 651.15 s [vector] postscanl: OK (0.02s)
  6851. 651.15 s [vector] +++ OK, passed 100 tests.
  6852. 651.19 s [vector] postscanl': OK
  6853. 651.19 s [vector] +++ OK, passed 100 tests.
  6854. 651.21 s [vector] scanl: OK (0.02s)
  6855. 651.21 s [vector] +++ OK, passed 100 tests.
  6856. 651.22 s [vector] scanl': OK (0.02s)
  6857. 651.23 s [vector] +++ OK, passed 100 tests.
  6858. 651.24 s [vector] scanl1: OK (0.01s)
  6859. 651.24 s [vector] +++ OK, passed 100 tests.
  6860. 651.24 s [vector] scanl1': OK (0.01s)
  6861. 651.24 s [vector] +++ OK, passed 100 tests.
  6862. 651.27 s [vector] iscanl: OK (0.02s)
  6863. 651.27 s [vector] +++ OK, passed 100 tests.
  6864. 651.29 s [vector] iscanl': OK (0.02s)
  6865. 651.29 s [vector] +++ OK, passed 100 tests.
  6866. 651.31 s [vector] prescanr: OK (0.02s)
  6867. 651.31 s [vector] +++ OK, passed 100 tests.
  6868. 651.33 s [vector] prescanr': OK (0.02s)
  6869. 651.33 s [vector] +++ OK, passed 100 tests.
  6870. 651.34 s [vector] postscanr: OK (0.02s)
  6871. 651.34 s [vector] +++ OK, passed 100 tests.
  6872. 651.34 s [vector] postscanr': OK (0.02s)
  6873. 651.34 s [vector] +++ OK, passed 100 tests.
  6874. 651.37 s [vector] scanr: OK (0.01s)
  6875. 651.37 s [vector] +++ OK, passed 100 tests.
  6876. 651.39 s [vector] scanr': OK (0.01s)
  6877. 651.39 s [vector] +++ OK, passed 100 tests.
  6878. 651.41 s [vector] scanr1: OK (0.02s)
  6879. 651.41 s [vector] +++ OK, passed 100 tests.
  6880. 651.43 s [vector] scanr1': OK (0.02s)
  6881. 651.43 s [vector] +++ OK, passed 100 tests.
  6882. 651.43 s [vector] iscanr: OK (0.02s)
  6883. 651.43 s [vector] +++ OK, passed 100 tests.
  6884. 651.45 s [vector] iscanr': OK
  6885. 651.45 s [vector] +++ OK, passed 100 tests.
  6886. 651.45 s [vector] mut_read: OK
  6887. 651.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6888. 651.45 s [vector] mut_write: OK
  6889. 651.45 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6890. 651.45 s [vector] mut_modify: OK
  6891. 651.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6892. 651.47 s [vector] mut_generate: OK
  6893. 651.47 s [vector] +++ OK, passed 100 tests.
  6894. 651.49 s [vector] mut_generateM: OK (0.02s)
  6895. 651.49 s [vector] +++ OK, passed 100 tests.
  6896. 651.53 s [vector] mut_mapM_: OK (0.04s)
  6897. 651.53 s [vector] +++ OK, passed 100 tests.
  6898. 651.57 s [vector] mut_imapM_: OK (0.04s)
  6899. 651.57 s [vector] +++ OK, passed 100 tests.
  6900. 651.61 s [vector] mut_forM_: OK (0.04s)
  6901. 651.61 s [vector] +++ OK, passed 100 tests.
  6902. 651.64 s [vector] mut_iforM_: OK (0.04s)
  6903. 651.64 s [vector] +++ OK, passed 100 tests.
  6904. 651.65 s [vector] mut_foldr: OK (0.01s)
  6905. 651.65 s [vector] +++ OK, passed 100 tests.
  6906. 651.67 s [vector] mut_foldr': OK (0.02s)
  6907. 651.67 s [vector] +++ OK, passed 100 tests.
  6908. 651.69 s [vector] mut_foldl: OK (0.02s)
  6909. 651.69 s [vector] +++ OK, passed 100 tests.
  6910. 651.71 s [vector] mut_foldl': OK (0.02s)
  6911. 651.71 s [vector] +++ OK, passed 100 tests.
  6912. 651.73 s [vector] mut_ifoldr: OK (0.02s)
  6913. 651.73 s [vector] +++ OK, passed 100 tests.
  6914. 651.75 s [vector] mut_ifoldr': OK (0.01s)
  6915. 651.75 s [vector] +++ OK, passed 100 tests.
  6916. 651.77 s [vector] mut_ifoldl: OK (0.01s)
  6917. 651.77 s [vector] +++ OK, passed 100 tests.
  6918. 651.77 s [vector] mut_ifoldl': OK (0.02s)
  6919. 651.77 s [vector] +++ OK, passed 100 tests.
  6920. 651.79 s [vector] mut_foldM: OK (0.02s)
  6921. 651.79 s [vector] +++ OK, passed 100 tests.
  6922. 651.81 s [vector] mut_foldM': OK (0.02s)
  6923. 651.81 s [vector] +++ OK, passed 100 tests.
  6924. 651.83 s [vector] mut_foldrM: OK (0.02s)
  6925. 651.83 s [vector] +++ OK, passed 100 tests.
  6926. 651.85 s [vector] mut_foldrM': OK (0.02s)
  6927. 651.85 s [vector] +++ OK, passed 100 tests.
  6928. 651.87 s [vector] mut_ifoldM: OK (0.03s)
  6929. 651.87 s [vector] +++ OK, passed 100 tests.
  6930. 651.91 s [vector] mut_ifoldM': OK (0.04s)
  6931. 651.91 s [vector] +++ OK, passed 100 tests.
  6932. 651.95 s [vector] mut_ifoldrM: OK (0.04s)
  6933. 651.95 s [vector] +++ OK, passed 100 tests.
  6934. 651.95 s [vector] mut_ifoldrM': OK (0.02s)
  6935. 651.95 s [vector] +++ OK, passed 100 tests.
  6936. 651.95 s [vector] compare: OK
  6937. 651.95 s [vector] +++ OK, passed 100 tests.
  6938. 651.95 s [vector] maximum: OK
  6939. 651.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6940. 651.95 s [vector] minimum: OK
  6941. 651.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6942. 651.98 s [vector] minIndex: OK
  6943. 651.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6944. 651.98 s [vector] maxIndex: OK
  6945. 651.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6946. 651.98 s [vector] maximumBy: OK
  6947. 651.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6948. 651.98 s [vector] minimumBy: OK
  6949. 651.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6950. 651.98 s [vector] maximumOn: OK
  6951. 651.98 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6952. 651.98 s [vector] minimumOn: OK
  6953. 651.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6954. 651.98 s [vector] maxIndexBy: OK
  6955. 651.98 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6956. 651.98 s [vector] minIndexBy: OK
  6957. 651.98 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6958. 651.98 s [vector] ListFirstMaxIndexWins: OK
  6959. 651.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6960. 651.98 s [vector] FalseListFirstMaxIndexWins: OK
  6961. 651.98 s [vector] +++ OK, failed as expected. (after 1 test):
  6962. 651.98 s [vector] Exception:
  6963. 651.98 s [vector] Prelude.foldr1: empty list
  6964. 651.98 s [vector] CallStack (from HasCallStack):
  6965. 651.98 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  6966. 651.98 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  6967. 651.98 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6968. 651.98 s [vector] []
  6969. 651.98 s [vector] mempty: OK
  6970. 651.98 s [vector] +++ OK, passed 100 tests.
  6971. 651.98 s [vector] mappend: OK
  6972. 651.98 s [vector] +++ OK, passed 100 tests.
  6973. 651.99 s [vector] mconcat: OK (0.02s)
  6974. 651.99 s [vector] +++ OK, passed 100 tests.
  6975. 651.99 s [vector] glength: OK
  6976. 651.99 s [vector] +++ OK, passed 100 tests.
  6977. 651.99 s [vector] sum: OK
  6978. 651.99 s [vector] +++ OK, passed 100 tests.
  6979. 651.99 s [vector] product: OK
  6980. 651.99 s [vector] +++ OK, passed 100 tests.
  6981. 651.99 s [vector] enumFromN: OK
  6982. 651.99 s [vector] +++ OK, passed 100 tests.
  6983. 652.00 s [vector] enumFromThenN: OK
  6984. 652.00 s [vector] +++ OK, passed 100 tests.
  6985. 652.00 s [vector] enumFromTo: OK
  6986. 652.00 s [vector] +++ OK, passed 100 tests.
  6987. 652.00 s [vector] enumFromThenTo: OK
  6988. 652.00 s [vector] +++ OK, passed 100 tests; 7 discarded.
  6989. 652.00 s [vector] unstream
  6990. 652.00 s [vector] unstream == vunstream (exact): OK
  6991. 652.00 s [vector] +++ OK, passed 100 tests.
  6992. 652.00 s [vector] unstream == vunstream (unknown): OK
  6993. 652.00 s [vector] +++ OK, passed 100 tests.
  6994. 652.00 s [vector] unstreamR ~= vunstream (exact): OK
  6995. 652.00 s [vector] +++ OK, passed 100 tests.
  6996. 652.01 s [vector] unstreamR ~= vunstream (unknown): OK
  6997. 652.01 s [vector] +++ OK, passed 100 tests.
  6998. 652.01 s [vector] Tests.Vector.Storable
  6999. 652.01 s [vector] Data.Vector.Storable.Vector (Int)
  7000. 652.01 s [vector] fromList.toList == id: OK
  7001. 652.01 s [vector] +++ OK, passed 100 tests.
  7002. 652.01 s [vector] toList.fromList == id: OK
  7003. 652.01 s [vector] +++ OK, passed 100 tests.
  7004. 652.01 s [vector] unstream.stream == id: OK
  7005. 652.01 s [vector] +++ OK, passed 100 tests.
  7006. 652.01 s [vector] stream.unstream == id: OK
  7007. 652.01 s [vector] +++ OK, passed 100 tests.
  7008. 652.01 s [vector] eq: OK
  7009. 652.01 s [vector] +++ OK, passed 100 tests.
  7010. 652.01 s [vector] length: OK
  7011. 652.01 s [vector] +++ OK, passed 100 tests.
  7012. 652.01 s [vector] null: OK
  7013. 652.01 s [vector] +++ OK, passed 100 tests.
  7014. 652.01 s [vector] index: OK
  7015. 652.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7016. 652.01 s [vector] safeIndex: OK
  7017. 652.01 s [vector] +++ OK, passed 100 tests.
  7018. 652.01 s [vector] head: OK
  7019. 652.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7020. 652.01 s [vector] last: OK
  7021. 652.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7022. 652.01 s [vector] unsafeIndex: OK
  7023. 652.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7024. 652.01 s [vector] unsafeHead: OK
  7025. 652.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7026. 652.01 s [vector] unsafeLast: OK
  7027. 652.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7028. 652.01 s [vector] slice: OK
  7029. 652.01 s [vector] +++ OK, passed 100 tests.
  7030. 652.02 s [vector] init: OK
  7031. 652.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7032. 652.02 s [vector] tail: OK
  7033. 652.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7034. 652.02 s [vector] take: OK
  7035. 652.02 s [vector] +++ OK, passed 100 tests.
  7036. 652.02 s [vector] drop: OK
  7037. 652.02 s [vector] +++ OK, passed 100 tests.
  7038. 652.02 s [vector] splitAt: OK
  7039. 652.02 s [vector] +++ OK, passed 100 tests.
  7040. 652.02 s [vector] empty: OK
  7041. 652.02 s [vector] +++ OK, passed 100 tests.
  7042. 652.02 s [vector] singleton: OK
  7043. 652.02 s [vector] +++ OK, passed 100 tests.
  7044. 652.02 s [vector] replicate: OK
  7045. 652.02 s [vector] +++ OK, passed 100 tests.
  7046. 652.02 s [vector] generate: OK
  7047. 652.02 s [vector] +++ OK, passed 100 tests.
  7048. 652.02 s [vector] iterateN: OK
  7049. 652.02 s [vector] +++ OK, passed 100 tests.
  7050. 652.09 s [vector] iterateNM: OK (0.06s)
  7051. 652.09 s [vector] +++ OK, passed 100 tests.
  7052. 652.11 s [vector] generateM: OK (0.02s)
  7053. 652.11 s [vector] +++ OK, passed 100 tests.
  7054. 652.11 s [vector] replicateM: OK
  7055. 652.11 s [vector] +++ OK, passed 100 tests.
  7056. 652.11 s [vector] create: OK
  7057. 652.12 s [vector] +++ OK, passed 100 tests.
  7058. 652.12 s [vector] createT: OK
  7059. 652.12 s [vector] +++ OK, passed 100 tests.
  7060. 652.12 s [vector] unfoldr: OK
  7061. 652.12 s [vector] +++ OK, passed 100 tests.
  7062. 652.12 s [vector] unfoldrN: OK
  7063. 652.12 s [vector] +++ OK, passed 100 tests.
  7064. 652.12 s [vector] unfoldrExactN: OK
  7065. 652.12 s [vector] +++ OK, passed 100 tests.
  7066. 652.12 s [vector] unfoldrM: OK
  7067. 652.12 s [vector] +++ OK, passed 100 tests.
  7068. 652.12 s [vector] unfoldrNM: OK
  7069. 652.12 s [vector] +++ OK, passed 100 tests.
  7070. 652.17 s [vector] unfoldrExactNM: OK (0.04s)
  7071. 652.17 s [vector] +++ OK, passed 100 tests.
  7072. 652.17 s [vector] constructN: OK
  7073. 652.17 s [vector] +++ OK, passed 100 tests.
  7074. 652.17 s [vector] constructrN: OK
  7075. 652.17 s [vector] +++ OK, passed 100 tests.
  7076. 652.17 s [vector] cons: OK
  7077. 652.17 s [vector] +++ OK, passed 100 tests.
  7078. 652.17 s [vector] snoc: OK
  7079. 652.17 s [vector] +++ OK, passed 100 tests.
  7080. 652.17 s [vector] append: OK
  7081. 652.18 s [vector] +++ OK, passed 100 tests.
  7082. 652.19 s [vector] concat: OK (0.02s)
  7083. 652.19 s [vector] +++ OK, passed 100 tests.
  7084. 652.19 s [vector] force: OK
  7085. 652.19 s [vector] +++ OK, passed 100 tests.
  7086. 652.19 s [vector] upd: OK
  7087. 652.20 s [vector] +++ OK, passed 100 tests.
  7088. 652.20 s [vector] accum: OK
  7089. 652.20 s [vector] +++ OK, passed 100 tests.
  7090. 652.20 s [vector] reverse: OK
  7091. 652.20 s [vector] +++ OK, passed 100 tests.
  7092. 652.20 s [vector] backpermute: OK
  7093. 652.20 s [vector] +++ OK, passed 100 tests.
  7094. 652.20 s [vector] map: OK
  7095. 652.20 s [vector] +++ OK, passed 100 tests.
  7096. 652.21 s [vector] imap: OK
  7097. 652.21 s [vector] +++ OK, passed 100 tests.
  7098. 652.21 s [vector] concatMap: OK
  7099. 652.22 s [vector] +++ OK, passed 100 tests.
  7100. 652.22 s [vector] mapM: OK
  7101. 652.22 s [vector] +++ OK, passed 100 tests.
  7102. 652.24 s [vector] mapM_: OK
  7103. 652.24 s [vector] +++ OK, passed 100 tests.
  7104. 652.25 s [vector] forM: OK
  7105. 652.25 s [vector] +++ OK, passed 100 tests.
  7106. 652.26 s [vector] forM_: OK (0.02s)
  7107. 652.26 s [vector] +++ OK, passed 100 tests.
  7108. 652.26 s [vector] imapM: OK
  7109. 652.27 s [vector] +++ OK, passed 100 tests.
  7110. 652.29 s [vector] imapM_: OK (0.02s)
  7111. 652.29 s [vector] +++ OK, passed 100 tests.
  7112. 652.29 s [vector] zipWith: OK
  7113. 652.29 s [vector] +++ OK, passed 100 tests.
  7114. 652.29 s [vector] zipWith3: OK
  7115. 652.29 s [vector] +++ OK, passed 100 tests.
  7116. 652.30 s [vector] izipWith: OK
  7117. 652.30 s [vector] +++ OK, passed 100 tests.
  7118. 652.30 s [vector] izipWith3: OK
  7119. 652.30 s [vector] +++ OK, passed 100 tests.
  7120. 652.31 s [vector] izipWithM: OK
  7121. 652.31 s [vector] +++ OK, passed 100 tests.
  7122. 652.32 s [vector] izipWithM_: OK (0.02s)
  7123. 652.32 s [vector] +++ OK, passed 100 tests.
  7124. 652.32 s [vector] zipWithM: OK
  7125. 652.33 s [vector] +++ OK, passed 100 tests.
  7126. 652.33 s [vector] zipWithM_: OK (0.01s)
  7127. 652.33 s [vector] +++ OK, passed 100 tests.
  7128. 652.33 s [vector] filter: OK
  7129. 652.33 s [vector] +++ OK, passed 100 tests.
  7130. 652.33 s [vector] ifilter: OK
  7131. 652.35 s [vector] +++ OK, passed 100 tests.
  7132. 652.38 s [vector] filterM: OK (0.04s)
  7133. 652.38 s [vector] +++ OK, passed 100 tests.
  7134. 652.38 s [vector] uniq: OK
  7135. 652.38 s [vector] +++ OK, passed 100 tests.
  7136. 652.38 s [vector] mapMaybe: OK
  7137. 652.38 s [vector] +++ OK, passed 100 tests.
  7138. 652.38 s [vector] imapMaybe: OK
  7139. 652.38 s [vector] +++ OK, passed 100 tests.
  7140. 652.39 s [vector] takeWhile: OK
  7141. 652.39 s [vector] +++ OK, passed 100 tests.
  7142. 652.39 s [vector] dropWhile: OK
  7143. 652.39 s [vector] +++ OK, passed 100 tests.
  7144. 652.39 s [vector] partition: OK
  7145. 652.39 s [vector] +++ OK, passed 100 tests.
  7146. 652.39 s [vector] partitionWith: OK
  7147. 652.39 s [vector] +++ OK, passed 100 tests.
  7148. 652.39 s [vector] span: OK
  7149. 652.39 s [vector] +++ OK, passed 100 tests.
  7150. 652.39 s [vector] break: OK
  7151. 652.39 s [vector] +++ OK, passed 100 tests.
  7152. 652.39 s [vector] spanR: OK
  7153. 652.39 s [vector] +++ OK, passed 100 tests.
  7154. 652.40 s [vector] breakR: OK
  7155. 652.40 s [vector] +++ OK, passed 100 tests.
  7156. 652.40 s [vector] groupBy: OK
  7157. 652.40 s [vector] +++ OK, passed 100 tests.
  7158. 652.40 s [vector] elem: OK
  7159. 652.40 s [vector] +++ OK, passed 100 tests.
  7160. 652.40 s [vector] notElem: OK
  7161. 652.40 s [vector] +++ OK, passed 100 tests.
  7162. 652.40 s [vector] find: OK
  7163. 652.40 s [vector] +++ OK, passed 100 tests.
  7164. 652.40 s [vector] findIndex: OK
  7165. 652.40 s [vector] +++ OK, passed 100 tests.
  7166. 652.40 s [vector] findIndexR: OK
  7167. 652.40 s [vector] +++ OK, passed 100 tests.
  7168. 652.40 s [vector] findIndices: OK
  7169. 652.40 s [vector] +++ OK, passed 100 tests.
  7170. 652.40 s [vector] elemIndex: OK
  7171. 652.40 s [vector] +++ OK, passed 100 tests.
  7172. 652.40 s [vector] elemIndices: OK
  7173. 652.40 s [vector] +++ OK, passed 100 tests.
  7174. 652.41 s [vector] foldl: OK
  7175. 652.41 s [vector] +++ OK, passed 100 tests.
  7176. 652.41 s [vector] foldl1: OK
  7177. 652.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7178. 652.42 s [vector] foldl': OK
  7179. 652.42 s [vector] +++ OK, passed 100 tests.
  7180. 652.42 s [vector] foldl1': OK
  7181. 652.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7182. 652.42 s [vector] foldr: OK
  7183. 652.42 s [vector] +++ OK, passed 100 tests.
  7184. 652.42 s [vector] foldr1: OK
  7185. 652.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7186. 652.43 s [vector] foldr': OK
  7187. 652.43 s [vector] +++ OK, passed 100 tests.
  7188. 652.43 s [vector] foldr1': OK
  7189. 652.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7190. 652.43 s [vector] ifoldl: OK
  7191. 652.44 s [vector] +++ OK, passed 100 tests.
  7192. 652.44 s [vector] ifoldl': OK
  7193. 652.44 s [vector] +++ OK, passed 100 tests.
  7194. 652.44 s [vector] ifoldr: OK
  7195. 652.44 s [vector] +++ OK, passed 100 tests.
  7196. 652.44 s [vector] ifoldr': OK
  7197. 652.44 s [vector] +++ OK, passed 100 tests.
  7198. 652.45 s [vector] ifoldM: OK
  7199. 652.45 s [vector] +++ OK, passed 100 tests.
  7200. 652.46 s [vector] ifoldM': OK
  7201. 652.46 s [vector] +++ OK, passed 100 tests.
  7202. 652.48 s [vector] ifoldM_: OK (0.02s)
  7203. 652.48 s [vector] +++ OK, passed 100 tests.
  7204. 652.50 s [vector] ifoldM'_: OK (0.02s)
  7205. 652.50 s [vector] +++ OK, passed 100 tests.
  7206. 652.50 s [vector] all: OK
  7207. 652.50 s [vector] +++ OK, passed 100 tests.
  7208. 652.50 s [vector] any: OK
  7209. 652.50 s [vector] +++ OK, passed 100 tests.
  7210. 652.50 s [vector] prescanl: OK
  7211. 652.50 s [vector] +++ OK, passed 100 tests.
  7212. 652.50 s [vector] prescanl': OK
  7213. 652.51 s [vector] +++ OK, passed 100 tests.
  7214. 652.51 s [vector] postscanl: OK
  7215. 652.51 s [vector] +++ OK, passed 100 tests.
  7216. 652.52 s [vector] postscanl': OK
  7217. 652.52 s [vector] +++ OK, passed 100 tests.
  7218. 652.52 s [vector] scanl: OK
  7219. 652.52 s [vector] +++ OK, passed 100 tests.
  7220. 652.52 s [vector] scanl': OK
  7221. 652.52 s [vector] +++ OK, passed 100 tests.
  7222. 652.52 s [vector] scanl1: OK
  7223. 652.52 s [vector] +++ OK, passed 100 tests.
  7224. 652.53 s [vector] scanl1': OK
  7225. 652.53 s [vector] +++ OK, passed 100 tests.
  7226. 652.54 s [vector] iscanl: OK
  7227. 652.54 s [vector] +++ OK, passed 100 tests.
  7228. 652.54 s [vector] iscanl': OK
  7229. 652.54 s [vector] +++ OK, passed 100 tests.
  7230. 652.55 s [vector] prescanr: OK
  7231. 652.55 s [vector] +++ OK, passed 100 tests.
  7232. 652.55 s [vector] prescanr': OK
  7233. 652.55 s [vector] +++ OK, passed 100 tests.
  7234. 652.55 s [vector] postscanr: OK
  7235. 652.55 s [vector] +++ OK, passed 100 tests.
  7236. 652.55 s [vector] postscanr': OK
  7237. 652.55 s [vector] +++ OK, passed 100 tests.
  7238. 652.56 s [vector] scanr: OK
  7239. 652.56 s [vector] +++ OK, passed 100 tests.
  7240. 652.56 s [vector] scanr': OK
  7241. 652.56 s [vector] +++ OK, passed 100 tests.
  7242. 652.57 s [vector] scanr1: OK
  7243. 652.57 s [vector] +++ OK, passed 100 tests.
  7244. 652.57 s [vector] scanr1': OK
  7245. 652.57 s [vector] +++ OK, passed 100 tests.
  7246. 652.57 s [vector] iscanr: OK
  7247. 652.57 s [vector] +++ OK, passed 100 tests.
  7248. 652.57 s [vector] iscanr': OK
  7249. 652.58 s [vector] +++ OK, passed 100 tests.
  7250. 652.58 s [vector] mut_read: OK
  7251. 652.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7252. 652.58 s [vector] mut_write: OK
  7253. 652.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7254. 652.58 s [vector] mut_modify: OK
  7255. 652.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7256. 652.58 s [vector] mut_generate: OK
  7257. 652.58 s [vector] +++ OK, passed 100 tests.
  7258. 652.61 s [vector] mut_generateM: OK (0.01s)
  7259. 652.61 s [vector] +++ OK, passed 100 tests.
  7260. 652.62 s [vector] mut_mapM_: OK (0.02s)
  7261. 652.62 s [vector] +++ OK, passed 100 tests.
  7262. 652.65 s [vector] mut_imapM_: OK (0.02s)
  7263. 652.65 s [vector] +++ OK, passed 100 tests.
  7264. 652.66 s [vector] mut_forM_: OK (0.02s)
  7265. 652.66 s [vector] +++ OK, passed 100 tests.
  7266. 652.66 s [vector] mut_iforM_: OK (0.02s)
  7267. 652.66 s [vector] +++ OK, passed 100 tests.
  7268. 652.67 s [vector] mut_foldr: OK
  7269. 652.67 s [vector] +++ OK, passed 100 tests.
  7270. 652.67 s [vector] mut_foldr': OK
  7271. 652.67 s [vector] +++ OK, passed 100 tests.
  7272. 652.67 s [vector] mut_foldl: OK
  7273. 652.67 s [vector] +++ OK, passed 100 tests.
  7274. 652.68 s [vector] mut_foldl': OK
  7275. 652.68 s [vector] +++ OK, passed 100 tests.
  7276. 652.68 s [vector] mut_ifoldr: OK
  7277. 652.68 s [vector] +++ OK, passed 100 tests.
  7278. 652.68 s [vector] mut_ifoldr': OK
  7279. 652.68 s [vector] +++ OK, passed 100 tests.
  7280. 652.69 s [vector] mut_ifoldl: OK
  7281. 652.69 s [vector] +++ OK, passed 100 tests.
  7282. 652.70 s [vector] mut_ifoldl': OK
  7283. 652.70 s [vector] +++ OK, passed 100 tests.
  7284. 652.70 s [vector] mut_foldM: OK
  7285. 652.70 s [vector] +++ OK, passed 100 tests.
  7286. 652.70 s [vector] mut_foldM': OK
  7287. 652.70 s [vector] +++ OK, passed 100 tests.
  7288. 652.70 s [vector] mut_foldrM: OK
  7289. 652.70 s [vector] +++ OK, passed 100 tests.
  7290. 652.71 s [vector] mut_foldrM': OK
  7291. 652.71 s [vector] +++ OK, passed 100 tests.
  7292. 652.72 s [vector] mut_ifoldM: OK
  7293. 652.72 s [vector] +++ OK, passed 100 tests.
  7294. 652.72 s [vector] mut_ifoldM': OK
  7295. 652.72 s [vector] +++ OK, passed 100 tests.
  7296. 652.72 s [vector] mut_ifoldrM: OK
  7297. 652.72 s [vector] +++ OK, passed 100 tests.
  7298. 652.72 s [vector] mut_ifoldrM': OK
  7299. 652.72 s [vector] +++ OK, passed 100 tests.
  7300. 652.72 s [vector] compare: OK
  7301. 652.72 s [vector] +++ OK, passed 100 tests.
  7302. 652.73 s [vector] maximum: OK
  7303. 652.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7304. 652.73 s [vector] minimum: OK
  7305. 652.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7306. 652.73 s [vector] minIndex: OK
  7307. 652.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7308. 652.73 s [vector] maxIndex: OK
  7309. 652.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7310. 652.73 s [vector] maximumBy: OK
  7311. 652.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7312. 652.73 s [vector] minimumBy: OK
  7313. 652.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7314. 652.73 s [vector] maximumOn: OK
  7315. 652.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7316. 652.73 s [vector] minimumOn: OK
  7317. 652.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7318. 652.73 s [vector] maxIndexBy: OK
  7319. 652.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7320. 652.73 s [vector] minIndexBy: OK
  7321. 652.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7322. 652.73 s [vector] ListFirstMaxIndexWins: OK
  7323. 652.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7324. 652.73 s [vector] FalseListFirstMaxIndexWins: OK
  7325. 652.73 s [vector] +++ OK, failed as expected. (after 1 test):
  7326. 652.73 s [vector] Exception:
  7327. 652.73 s [vector] Prelude.foldr1: empty list
  7328. 652.73 s [vector] CallStack (from HasCallStack):
  7329. 652.73 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7330. 652.73 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7331. 652.73 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7332. 652.73 s [vector] []
  7333. 652.73 s [vector] mempty: OK
  7334. 652.74 s [vector] +++ OK, passed 100 tests.
  7335. 652.74 s [vector] mappend: OK
  7336. 652.75 s [vector] +++ OK, passed 100 tests.
  7337. 652.75 s [vector] mconcat: OK (0.02s)
  7338. 652.75 s [vector] +++ OK, passed 100 tests.
  7339. 652.75 s [vector] glength: OK
  7340. 652.75 s [vector] +++ OK, passed 100 tests.
  7341. 652.75 s [vector] sum: OK
  7342. 652.76 s [vector] +++ OK, passed 100 tests.
  7343. 652.76 s [vector] product: OK
  7344. 652.76 s [vector] +++ OK, passed 100 tests.
  7345. 652.76 s [vector] enumFromN: OK
  7346. 652.76 s [vector] +++ OK, passed 100 tests.
  7347. 652.76 s [vector] enumFromThenN: OK
  7348. 652.76 s [vector] +++ OK, passed 100 tests.
  7349. 652.76 s [vector] enumFromTo: OK
  7350. 652.76 s [vector] +++ OK, passed 100 tests.
  7351. 652.76 s [vector] enumFromThenTo: OK
  7352. 652.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7353. 652.76 s [vector] Data.Vector.Storable.Vector (Double)
  7354. 652.76 s [vector] fromList.toList == id: OK
  7355. 652.76 s [vector] +++ OK, passed 100 tests.
  7356. 652.76 s [vector] toList.fromList == id: OK
  7357. 652.76 s [vector] +++ OK, passed 100 tests.
  7358. 652.76 s [vector] unstream.stream == id: OK
  7359. 652.76 s [vector] +++ OK, passed 100 tests.
  7360. 652.76 s [vector] stream.unstream == id: OK
  7361. 652.76 s [vector] +++ OK, passed 100 tests.
  7362. 652.76 s [vector] eq: OK
  7363. 652.76 s [vector] +++ OK, passed 100 tests.
  7364. 652.76 s [vector] length: OK
  7365. 652.76 s [vector] +++ OK, passed 100 tests.
  7366. 652.76 s [vector] null: OK
  7367. 652.76 s [vector] +++ OK, passed 100 tests.
  7368. 652.77 s [vector] index: OK
  7369. 652.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7370. 652.77 s [vector] safeIndex: OK
  7371. 652.77 s [vector] +++ OK, passed 100 tests.
  7372. 652.77 s [vector] head: OK
  7373. 652.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7374. 652.77 s [vector] last: OK
  7375. 652.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7376. 652.77 s [vector] unsafeIndex: OK
  7377. 652.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7378. 652.77 s [vector] unsafeHead: OK
  7379. 652.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7380. 652.77 s [vector] unsafeLast: OK
  7381. 652.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7382. 652.77 s [vector] slice: OK
  7383. 652.77 s [vector] +++ OK, passed 100 tests.
  7384. 652.77 s [vector] init: OK
  7385. 652.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7386. 652.77 s [vector] tail: OK
  7387. 652.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7388. 652.77 s [vector] take: OK
  7389. 652.77 s [vector] +++ OK, passed 100 tests.
  7390. 652.77 s [vector] drop: OK
  7391. 652.77 s [vector] +++ OK, passed 100 tests.
  7392. 652.78 s [vector] splitAt: OK
  7393. 652.78 s [vector] +++ OK, passed 100 tests.
  7394. 652.78 s [vector] empty: OK
  7395. 652.78 s [vector] +++ OK, passed 100 tests.
  7396. 652.78 s [vector] singleton: OK
  7397. 652.78 s [vector] +++ OK, passed 100 tests.
  7398. 652.78 s [vector] replicate: OK
  7399. 652.78 s [vector] +++ OK, passed 100 tests.
  7400. 652.78 s [vector] generate: OK
  7401. 652.78 s [vector] +++ OK, passed 100 tests.
  7402. 652.78 s [vector] iterateN: OK
  7403. 652.78 s [vector] +++ OK, passed 100 tests.
  7404. 652.82 s [vector] iterateNM: OK (0.03s)
  7405. 652.83 s [vector] +++ OK, passed 100 tests.
  7406. 652.84 s [vector] generateM: OK (0.03s)
  7407. 652.84 s [vector] +++ OK, passed 100 tests.
  7408. 652.85 s [vector] replicateM: OK
  7409. 652.85 s [vector] +++ OK, passed 100 tests.
  7410. 652.85 s [vector] create: OK
  7411. 652.85 s [vector] +++ OK, passed 100 tests.
  7412. 652.85 s [vector] createT: OK
  7413. 652.85 s [vector] +++ OK, passed 100 tests.
  7414. 652.85 s [vector] unfoldr: OK
  7415. 652.85 s [vector] +++ OK, passed 100 tests.
  7416. 652.86 s [vector] unfoldrN: OK
  7417. 652.86 s [vector] +++ OK, passed 100 tests.
  7418. 652.86 s [vector] unfoldrExactN: OK
  7419. 652.86 s [vector] +++ OK, passed 100 tests.
  7420. 652.86 s [vector] unfoldrM: OK
  7421. 652.86 s [vector] +++ OK, passed 100 tests.
  7422. 652.87 s [vector] unfoldrNM: OK
  7423. 652.87 s [vector] +++ OK, passed 100 tests.
  7424. 652.91 s [vector] unfoldrExactNM: OK (0.03s)
  7425. 652.91 s [vector] +++ OK, passed 100 tests.
  7426. 652.92 s [vector] constructN: OK (0.02s)
  7427. 652.92 s [vector] +++ OK, passed 100 tests.
  7428. 652.92 s [vector] constructrN: OK (0.02s)
  7429. 652.92 s [vector] +++ OK, passed 100 tests.
  7430. 652.93 s [vector] cons: OK
  7431. 652.93 s [vector] +++ OK, passed 100 tests.
  7432. 652.93 s [vector] snoc: OK
  7433. 652.93 s [vector] +++ OK, passed 100 tests.
  7434. 652.94 s [vector] append: OK
  7435. 653.29 s [vector] +++ OK, passed 100 tests.
  7436. 653.29 s [vector] concat: OK (0.02s)
  7437. 653.29 s [vector] +++ OK, passed 100 tests.
  7438. 653.29 s [vector] force: OK
  7439. 653.29 s [vector] +++ OK, passed 100 tests.
  7440. 653.29 s [vector] upd: OK
  7441. 653.29 s [vector] +++ OK, passed 100 tests.
  7442. 653.29 s [vector] accum: OK (0.02s)
  7443. 653.29 s [vector] +++ OK, passed 100 tests.
  7444. 653.29 s [vector] reverse: OK
  7445. 653.29 s [vector] +++ OK, passed 100 tests.
  7446. 653.29 s [vector] backpermute: OK
  7447. 653.29 s [vector] +++ OK, passed 100 tests.
  7448. 653.29 s [vector] map: OK
  7449. 653.29 s [vector] +++ OK, passed 100 tests.
  7450. 653.29 s [vector] imap: OK
  7451. 653.29 s [vector] +++ OK, passed 100 tests.
  7452. 653.29 s [vector] concatMap: OK (0.01s)
  7453. 653.29 s [vector] +++ OK, passed 100 tests.
  7454. 653.29 s [vector] mapM: OK (0.01s)
  7455. 653.29 s [vector] +++ OK, passed 100 tests.
  7456. 653.29 s [vector] mapM_: OK (0.04s)
  7457. 653.29 s [vector] +++ OK, passed 100 tests.
  7458. 653.29 s [vector] forM: OK
  7459. 653.29 s [vector] +++ OK, passed 100 tests.
  7460. 653.29 s [vector] forM_: OK (0.03s)
  7461. 653.29 s [vector] +++ OK, passed 100 tests.
  7462. 653.29 s [vector] imapM: OK (0.01s)
  7463. 653.29 s [vector] +++ OK, passed 100 tests.
  7464. 653.29 s [vector] imapM_: OK (0.04s)
  7465. 653.29 s [vector] +++ OK, passed 100 tests.
  7466. 653.29 s [vector] zipWith: OK (0.01s)
  7467. 653.29 s [vector] +++ OK, passed 100 tests.
  7468. 653.29 s [vector] zipWith3: OK (0.01s)
  7469. 653.29 s [vector] +++ OK, passed 100 tests.
  7470. 653.29 s [vector] izipWith: OK (0.01s)
  7471. 653.29 s [vector] +++ OK, passed 100 tests.
  7472. 653.29 s [vector] izipWith3: OK (0.01s)
  7473. 653.29 s [vector] +++ OK, passed 100 tests.
  7474. 653.29 s [vector] izipWithM: OK (0.01s)
  7475. 653.29 s [vector] +++ OK, passed 100 tests.
  7476. 653.29 s [vector] izipWithM_: OK (0.02s)
  7477. 653.29 s [vector] +++ OK, passed 100 tests.
  7478. 653.29 s [vector] zipWithM: OK (0.01s)
  7479. 653.29 s [vector] +++ OK, passed 100 tests.
  7480. 653.32 s [vector] zipWithM_: OK (0.03s)
  7481. 653.32 s [vector] +++ OK, passed 100 tests.
  7482. 653.33 s [vector] filter: OK
  7483. 653.33 s [vector] +++ OK, passed 100 tests.
  7484. 653.33 s [vector] ifilter: OK
  7485. 653.35 s [vector] +++ OK, passed 100 tests.
  7486. 653.38 s [vector] filterM: OK (0.05s)
  7487. 653.38 s [vector] +++ OK, passed 100 tests.
  7488. 653.39 s [vector] uniq: OK
  7489. 653.39 s [vector] +++ OK, passed 100 tests.
  7490. 653.40 s [vector] mapMaybe: OK
  7491. 653.40 s [vector] +++ OK, passed 100 tests.
  7492. 653.41 s [vector] imapMaybe: OK (0.01s)
  7493. 653.41 s [vector] +++ OK, passed 100 tests.
  7494. 653.41 s [vector] takeWhile: OK
  7495. 653.41 s [vector] +++ OK, passed 100 tests.
  7496. 653.42 s [vector] dropWhile: OK
  7497. 653.42 s [vector] +++ OK, passed 100 tests.
  7498. 653.42 s [vector] partition: OK
  7499. 653.43 s [vector] +++ OK, passed 100 tests.
  7500. 653.43 s [vector] partitionWith: OK
  7501. 653.43 s [vector] +++ OK, passed 100 tests.
  7502. 653.43 s [vector] span: OK
  7503. 653.43 s [vector] +++ OK, passed 100 tests.
  7504. 653.43 s [vector] break: OK
  7505. 653.43 s [vector] +++ OK, passed 100 tests.
  7506. 653.43 s [vector] spanR: OK
  7507. 653.43 s [vector] +++ OK, passed 100 tests.
  7508. 653.44 s [vector] breakR: OK
  7509. 653.44 s [vector] +++ OK, passed 100 tests.
  7510. 653.44 s [vector] groupBy: OK (0.01s)
  7511. 653.44 s [vector] +++ OK, passed 100 tests.
  7512. 653.44 s [vector] elem: OK
  7513. 653.44 s [vector] +++ OK, passed 100 tests.
  7514. 653.44 s [vector] notElem: OK
  7515. 653.44 s [vector] +++ OK, passed 100 tests.
  7516. 653.44 s [vector] find: OK
  7517. 653.44 s [vector] +++ OK, passed 100 tests.
  7518. 653.45 s [vector] findIndex: OK
  7519. 653.45 s [vector] +++ OK, passed 100 tests.
  7520. 653.45 s [vector] findIndexR: OK
  7521. 653.45 s [vector] +++ OK, passed 100 tests.
  7522. 653.46 s [vector] findIndices: OK
  7523. 653.46 s [vector] +++ OK, passed 100 tests.
  7524. 653.46 s [vector] elemIndex: OK
  7525. 653.46 s [vector] +++ OK, passed 100 tests.
  7526. 653.46 s [vector] elemIndices: OK
  7527. 653.47 s [vector] +++ OK, passed 100 tests.
  7528. 653.49 s [vector] foldl: OK (0.01s)
  7529. 653.49 s [vector] +++ OK, passed 100 tests.
  7530. 653.50 s [vector] foldl1: OK (0.02s)
  7531. 653.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7532. 653.50 s [vector] foldl': OK (0.02s)
  7533. 653.50 s [vector] +++ OK, passed 100 tests.
  7534. 653.52 s [vector] foldl1': OK (0.02s)
  7535. 653.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7536. 653.55 s [vector] foldr: OK (0.02s)
  7537. 653.55 s [vector] +++ OK, passed 100 tests.
  7538. 653.57 s [vector] foldr1: OK (0.02s)
  7539. 653.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7540. 653.61 s [vector] foldr': OK (0.02s)
  7541. 653.61 s [vector] +++ OK, passed 100 tests.
  7542. 653.61 s [vector] foldr1': OK (0.02s)
  7543. 653.61 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7544. 653.63 s [vector] ifoldl: OK (0.02s)
  7545. 653.63 s [vector] +++ OK, passed 100 tests.
  7546. 653.65 s [vector] ifoldl': OK (0.02s)
  7547. 653.65 s [vector] +++ OK, passed 100 tests.
  7548. 653.67 s [vector] ifoldr: OK (0.02s)
  7549. 653.67 s [vector] +++ OK, passed 100 tests.
  7550. 653.69 s [vector] ifoldr': OK (0.02s)
  7551. 653.69 s [vector] +++ OK, passed 100 tests.
  7552. 653.71 s [vector] ifoldM: OK (0.02s)
  7553. 653.71 s [vector] +++ OK, passed 100 tests.
  7554. 653.73 s [vector] ifoldM': OK (0.02s)
  7555. 653.73 s [vector] +++ OK, passed 100 tests.
  7556. 653.77 s [vector] ifoldM_: OK (0.05s)
  7557. 653.77 s [vector] +++ OK, passed 100 tests.
  7558. 653.81 s [vector] ifoldM'_: OK (0.05s)
  7559. 653.81 s [vector] +++ OK, passed 100 tests.
  7560. 653.81 s [vector] all: OK
  7561. 653.81 s [vector] +++ OK, passed 100 tests.
  7562. 653.83 s [vector] any: OK
  7563. 653.83 s [vector] +++ OK, passed 100 tests.
  7564. 653.84 s [vector] prescanl: OK (0.02s)
  7565. 653.84 s [vector] +++ OK, passed 100 tests.
  7566. 653.84 s [vector] prescanl': OK (0.01s)
  7567. 653.84 s [vector] +++ OK, passed 100 tests.
  7568. 653.85 s [vector] postscanl: OK (0.01s)
  7569. 653.85 s [vector] +++ OK, passed 100 tests.
  7570. 653.87 s [vector] postscanl': OK
  7571. 653.88 s [vector] +++ OK, passed 100 tests.
  7572. 653.88 s [vector] scanl: OK (0.01s)
  7573. 653.88 s [vector] +++ OK, passed 100 tests.
  7574. 653.91 s [vector] scanl': OK (0.02s)
  7575. 653.91 s [vector] +++ OK, passed 100 tests.
  7576. 653.92 s [vector] scanl1: OK (0.02s)
  7577. 653.92 s [vector] +++ OK, passed 100 tests.
  7578. 653.95 s [vector] scanl1': OK (0.01s)
  7579. 653.95 s [vector] +++ OK, passed 100 tests.
  7580. 653.96 s [vector] iscanl: OK (0.02s)
  7581. 653.96 s [vector] +++ OK, passed 100 tests.
  7582. 653.98 s [vector] iscanl': OK (0.02s)
  7583. 653.99 s [vector] +++ OK, passed 100 tests.
  7584. 654.00 s [vector] prescanr: OK (0.02s)
  7585. 654.01 s [vector] +++ OK, passed 100 tests.
  7586. 654.02 s [vector] prescanr': OK (0.02s)
  7587. 654.02 s [vector] +++ OK, passed 100 tests.
  7588. 654.04 s [vector] postscanr: OK (0.01s)
  7589. 654.04 s [vector] +++ OK, passed 100 tests.
  7590. 654.07 s [vector] postscanr': OK (0.01s)
  7591. 654.07 s [vector] +++ OK, passed 100 tests.
  7592. 654.07 s [vector] scanr: OK (0.01s)
  7593. 654.07 s [vector] +++ OK, passed 100 tests.
  7594. 654.09 s [vector] scanr': OK (0.02s)
  7595. 654.09 s [vector] +++ OK, passed 100 tests.
  7596. 654.10 s [vector] scanr1: OK (0.01s)
  7597. 654.10 s [vector] +++ OK, passed 100 tests.
  7598. 654.10 s [vector] scanr1': OK (0.01s)
  7599. 654.10 s [vector] +++ OK, passed 100 tests.
  7600. 654.12 s [vector] iscanr: OK (0.02s)
  7601. 654.12 s [vector] +++ OK, passed 100 tests.
  7602. 654.14 s [vector] iscanr': OK (0.01s)
  7603. 654.14 s [vector] +++ OK, passed 100 tests.
  7604. 654.14 s [vector] mut_read: OK
  7605. 654.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7606. 654.14 s [vector] mut_write: OK
  7607. 654.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7608. 654.14 s [vector] mut_modify: OK
  7609. 654.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7610. 654.15 s [vector] mut_generate: OK
  7611. 654.15 s [vector] +++ OK, passed 100 tests.
  7612. 654.17 s [vector] mut_generateM: OK (0.02s)
  7613. 654.17 s [vector] +++ OK, passed 100 tests.
  7614. 654.21 s [vector] mut_mapM_: OK (0.04s)
  7615. 654.21 s [vector] +++ OK, passed 100 tests.
  7616. 654.25 s [vector] mut_imapM_: OK (0.04s)
  7617. 654.25 s [vector] +++ OK, passed 100 tests.
  7618. 654.29 s [vector] mut_forM_: OK (0.04s)
  7619. 654.29 s [vector] +++ OK, passed 100 tests.
  7620. 654.33 s [vector] mut_iforM_: OK (0.04s)
  7621. 654.33 s [vector] +++ OK, passed 100 tests.
  7622. 654.35 s [vector] mut_foldr: OK (0.01s)
  7623. 654.35 s [vector] +++ OK, passed 100 tests.
  7624. 654.37 s [vector] mut_foldr': OK (0.02s)
  7625. 654.37 s [vector] +++ OK, passed 100 tests.
  7626. 654.38 s [vector] mut_foldl: OK (0.01s)
  7627. 654.38 s [vector] +++ OK, passed 100 tests.
  7628. 654.39 s [vector] mut_foldl': OK (0.01s)
  7629. 654.39 s [vector] +++ OK, passed 100 tests.
  7630. 654.42 s [vector] mut_ifoldr: OK (0.02s)
  7631. 654.42 s [vector] +++ OK, passed 100 tests.
  7632. 654.43 s [vector] mut_ifoldr': OK (0.02s)
  7633. 654.43 s [vector] +++ OK, passed 100 tests.
  7634. 654.45 s [vector] mut_ifoldl: OK (0.02s)
  7635. 654.45 s [vector] +++ OK, passed 100 tests.
  7636. 654.45 s [vector] mut_ifoldl': OK (0.02s)
  7637. 654.45 s [vector] +++ OK, passed 100 tests.
  7638. 654.47 s [vector] mut_foldM: OK (0.02s)
  7639. 654.47 s [vector] +++ OK, passed 100 tests.
  7640. 654.49 s [vector] mut_foldM': OK (0.02s)
  7641. 654.49 s [vector] +++ OK, passed 100 tests.
  7642. 654.51 s [vector] mut_foldrM: OK (0.01s)
  7643. 654.51 s [vector] +++ OK, passed 100 tests.
  7644. 654.52 s [vector] mut_foldrM': OK (0.02s)
  7645. 654.53 s [vector] +++ OK, passed 100 tests.
  7646. 654.53 s [vector] mut_ifoldM: OK (0.02s)
  7647. 654.53 s [vector] +++ OK, passed 100 tests.
  7648. 654.54 s [vector] mut_ifoldM': OK (0.01s)
  7649. 654.55 s [vector] +++ OK, passed 100 tests.
  7650. 654.57 s [vector] mut_ifoldrM: OK (0.01s)
  7651. 654.57 s [vector] +++ OK, passed 100 tests.
  7652. 654.57 s [vector] mut_ifoldrM': OK (0.02s)
  7653. 654.57 s [vector] +++ OK, passed 100 tests.
  7654. 654.57 s [vector] compare: OK
  7655. 654.57 s [vector] +++ OK, passed 100 tests.
  7656. 654.57 s [vector] maximum: OK
  7657. 654.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7658. 654.57 s [vector] minimum: OK
  7659. 654.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7660. 654.58 s [vector] minIndex: OK
  7661. 654.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7662. 654.58 s [vector] maxIndex: OK
  7663. 654.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7664. 654.58 s [vector] maximumBy: OK
  7665. 654.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7666. 654.58 s [vector] minimumBy: OK
  7667. 654.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7668. 654.58 s [vector] maximumOn: OK
  7669. 654.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7670. 654.58 s [vector] minimumOn: OK
  7671. 654.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7672. 654.58 s [vector] maxIndexBy: OK
  7673. 654.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7674. 654.58 s [vector] minIndexBy: OK
  7675. 654.58 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7676. 654.58 s [vector] ListFirstMaxIndexWins: OK
  7677. 654.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7678. 654.58 s [vector] FalseListFirstMaxIndexWins: OK
  7679. 654.58 s [vector] +++ OK, failed as expected. (after 1 test):
  7680. 654.58 s [vector] Exception:
  7681. 654.58 s [vector] Prelude.foldr1: empty list
  7682. 654.58 s [vector] CallStack (from HasCallStack):
  7683. 654.58 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  7684. 654.58 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  7685. 654.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7686. 654.58 s [vector] []
  7687. 654.58 s [vector] mempty: OK
  7688. 654.58 s [vector] +++ OK, passed 100 tests.
  7689. 654.58 s [vector] mappend: OK
  7690. 654.58 s [vector] +++ OK, passed 100 tests.
  7691. 654.61 s [vector] mconcat: OK (0.02s)
  7692. 654.61 s [vector] +++ OK, passed 100 tests.
  7693. 654.61 s [vector] glength: OK
  7694. 654.61 s [vector] +++ OK, passed 100 tests.
  7695. 654.61 s [vector] sum: OK
  7696. 654.61 s [vector] +++ OK, passed 100 tests.
  7697. 654.61 s [vector] product: OK
  7698. 654.62 s [vector] +++ OK, passed 100 tests.
  7699. 654.62 s [vector] enumFromN: OK
  7700. 654.62 s [vector] +++ OK, passed 100 tests.
  7701. 654.62 s [vector] enumFromThenN: OK
  7702. 654.62 s [vector] +++ OK, passed 100 tests.
  7703. 654.62 s [vector] enumFromTo: OK
  7704. 654.62 s [vector] +++ OK, passed 100 tests.
  7705. 654.62 s [vector] enumFromThenTo: OK
  7706. 654.62 s [vector] +++ OK, passed 100 tests; 2 discarded.
  7707. 654.62 s [vector] unstream
  7708. 654.62 s [vector] unstream == vunstream (exact): OK
  7709. 654.62 s [vector] +++ OK, passed 100 tests.
  7710. 654.62 s [vector] unstream == vunstream (unknown): OK
  7711. 654.62 s [vector] +++ OK, passed 100 tests.
  7712. 654.62 s [vector] unstreamR ~= vunstream (exact): OK
  7713. 654.62 s [vector] +++ OK, passed 100 tests.
  7714. 654.62 s [vector] unstreamR ~= vunstream (unknown): OK
  7715. 654.63 s [vector] +++ OK, passed 100 tests.
  7716. 654.63 s [vector] Tests.Vector.Strict
  7717. 654.63 s [vector] Bool
  7718. 654.63 s [vector] fromList.toList == id: OK
  7719. 654.63 s [vector] +++ OK, passed 100 tests.
  7720. 654.63 s [vector] toList.fromList == id: OK
  7721. 654.63 s [vector] +++ OK, passed 100 tests.
  7722. 654.63 s [vector] unstream.stream == id: OK
  7723. 654.63 s [vector] +++ OK, passed 100 tests.
  7724. 654.63 s [vector] stream.unstream == id: OK
  7725. 654.63 s [vector] +++ OK, passed 100 tests.
  7726. 654.63 s [vector] eq: OK
  7727. 654.63 s [vector] +++ OK, passed 100 tests.
  7728. 654.63 s [vector] length: OK
  7729. 654.63 s [vector] +++ OK, passed 100 tests.
  7730. 654.63 s [vector] null: OK
  7731. 654.63 s [vector] +++ OK, passed 100 tests.
  7732. 654.63 s [vector] index: OK
  7733. 654.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7734. 654.63 s [vector] safeIndex: OK
  7735. 654.63 s [vector] +++ OK, passed 100 tests.
  7736. 654.63 s [vector] head: OK
  7737. 654.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7738. 654.63 s [vector] last: OK
  7739. 654.63 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7740. 654.63 s [vector] unsafeIndex: OK
  7741. 654.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7742. 654.63 s [vector] unsafeHead: OK
  7743. 654.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7744. 654.63 s [vector] unsafeLast: OK
  7745. 654.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7746. 654.63 s [vector] slice: OK
  7747. 654.63 s [vector] +++ OK, passed 100 tests.
  7748. 654.63 s [vector] init: OK
  7749. 654.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7750. 654.63 s [vector] tail: OK
  7751. 654.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7752. 654.63 s [vector] take: OK
  7753. 654.63 s [vector] +++ OK, passed 100 tests.
  7754. 654.63 s [vector] drop: OK
  7755. 654.63 s [vector] +++ OK, passed 100 tests.
  7756. 654.63 s [vector] splitAt: OK
  7757. 654.63 s [vector] +++ OK, passed 100 tests.
  7758. 654.63 s [vector] empty: OK
  7759. 654.63 s [vector] +++ OK, passed 100 tests.
  7760. 654.63 s [vector] singleton: OK
  7761. 654.63 s [vector] +++ OK, passed 100 tests.
  7762. 654.63 s [vector] replicate: OK
  7763. 654.63 s [vector] +++ OK, passed 100 tests.
  7764. 654.63 s [vector] generate: OK
  7765. 654.64 s [vector] +++ OK, passed 100 tests.
  7766. 654.65 s [vector] iterateN: OK
  7767. 654.65 s [vector] +++ OK, passed 100 tests.
  7768. 654.74 s [vector] iterateNM: OK (0.09s)
  7769. 654.74 s [vector] +++ OK, passed 100 tests.
  7770. 654.74 s [vector] generateM: OK (0.01s)
  7771. 654.74 s [vector] +++ OK, passed 100 tests.
  7772. 654.75 s [vector] replicateM: OK
  7773. 654.75 s [vector] +++ OK, passed 100 tests.
  7774. 654.75 s [vector] create: OK
  7775. 654.75 s [vector] +++ OK, passed 100 tests.
  7776. 654.75 s [vector] createT: OK
  7777. 654.75 s [vector] +++ OK, passed 100 tests.
  7778. 654.75 s [vector] unfoldr: OK
  7779. 654.75 s [vector] +++ OK, passed 100 tests.
  7780. 654.75 s [vector] unfoldrN: OK
  7781. 654.75 s [vector] +++ OK, passed 100 tests.
  7782. 654.75 s [vector] unfoldrExactN: OK
  7783. 654.75 s [vector] +++ OK, passed 100 tests.
  7784. 654.75 s [vector] unfoldrM: OK
  7785. 654.75 s [vector] +++ OK, passed 100 tests.
  7786. 654.76 s [vector] unfoldrNM: OK
  7787. 654.76 s [vector] +++ OK, passed 100 tests.
  7788. 654.82 s [vector] unfoldrExactNM: OK (0.07s)
  7789. 654.82 s [vector] +++ OK, passed 100 tests.
  7790. 654.82 s [vector] constructN: OK
  7791. 654.82 s [vector] +++ OK, passed 100 tests.
  7792. 654.82 s [vector] constructrN: OK
  7793. 654.82 s [vector] +++ OK, passed 100 tests.
  7794. 654.82 s [vector] cons: OK
  7795. 654.82 s [vector] +++ OK, passed 100 tests.
  7796. 654.83 s [vector] snoc: OK
  7797. 654.83 s [vector] +++ OK, passed 100 tests.
  7798. 654.83 s [vector] append: OK
  7799. 654.83 s [vector] +++ OK, passed 100 tests.
  7800. 654.83 s [vector] concat: OK
  7801. 654.83 s [vector] +++ OK, passed 100 tests.
  7802. 654.84 s [vector] force: OK
  7803. 654.84 s [vector] +++ OK, passed 100 tests.
  7804. 654.84 s [vector] upd: OK
  7805. 654.84 s [vector] +++ OK, passed 100 tests.
  7806. 654.84 s [vector] accum: OK
  7807. 654.84 s [vector] +++ OK, passed 100 tests.
  7808. 654.84 s [vector] reverse: OK
  7809. 654.84 s [vector] +++ OK, passed 100 tests.
  7810. 654.84 s [vector] backpermute: OK
  7811. 654.84 s [vector] +++ OK, passed 100 tests.
  7812. 654.84 s [vector] map: OK
  7813. 654.84 s [vector] +++ OK, passed 100 tests.
  7814. 654.84 s [vector] imap: OK
  7815. 654.84 s [vector] +++ OK, passed 100 tests.
  7816. 654.84 s [vector] concatMap: OK
  7817. 654.84 s [vector] +++ OK, passed 100 tests.
  7818. 654.85 s [vector] mapM: OK
  7819. 654.85 s [vector] +++ OK, passed 100 tests.
  7820. 654.86 s [vector] mapM_: OK
  7821. 654.86 s [vector] +++ OK, passed 100 tests.
  7822. 654.86 s [vector] forM: OK
  7823. 654.87 s [vector] +++ OK, passed 100 tests.
  7824. 654.87 s [vector] forM_: OK
  7825. 654.87 s [vector] +++ OK, passed 100 tests.
  7826. 654.88 s [vector] imapM: OK
  7827. 654.88 s [vector] +++ OK, passed 100 tests.
  7828. 654.89 s [vector] imapM_: OK (0.01s)
  7829. 654.89 s [vector] +++ OK, passed 100 tests.
  7830. 654.89 s [vector] zipWith: OK
  7831. 654.89 s [vector] +++ OK, passed 100 tests.
  7832. 654.89 s [vector] zipWith3: OK
  7833. 654.89 s [vector] +++ OK, passed 100 tests.
  7834. 654.89 s [vector] izipWith: OK
  7835. 654.89 s [vector] +++ OK, passed 100 tests.
  7836. 654.89 s [vector] izipWith3: OK
  7837. 654.89 s [vector] +++ OK, passed 100 tests.
  7838. 654.90 s [vector] izipWithM: OK
  7839. 654.90 s [vector] +++ OK, passed 100 tests.
  7840. 654.90 s [vector] izipWithM_: OK
  7841. 654.91 s [vector] +++ OK, passed 100 tests.
  7842. 654.91 s [vector] zipWithM: OK
  7843. 654.91 s [vector] +++ OK, passed 100 tests.
  7844. 654.92 s [vector] zipWithM_: OK
  7845. 654.92 s [vector] +++ OK, passed 100 tests.
  7846. 654.92 s [vector] filter: OK
  7847. 654.92 s [vector] +++ OK, passed 100 tests.
  7848. 654.93 s [vector] ifilter: OK
  7849. 654.93 s [vector] +++ OK, passed 100 tests.
  7850. 654.94 s [vector] filterM: OK (0.02s)
  7851. 654.94 s [vector] +++ OK, passed 100 tests.
  7852. 654.94 s [vector] uniq: OK
  7853. 654.94 s [vector] +++ OK, passed 100 tests.
  7854. 654.94 s [vector] mapMaybe: OK
  7855. 654.94 s [vector] +++ OK, passed 100 tests.
  7856. 654.94 s [vector] imapMaybe: OK
  7857. 654.94 s [vector] +++ OK, passed 100 tests.
  7858. 654.94 s [vector] takeWhile: OK
  7859. 654.94 s [vector] +++ OK, passed 100 tests.
  7860. 654.94 s [vector] dropWhile: OK
  7861. 654.94 s [vector] +++ OK, passed 100 tests.
  7862. 654.94 s [vector] partition: OK
  7863. 654.94 s [vector] +++ OK, passed 100 tests.
  7864. 654.95 s [vector] partitionWith: OK
  7865. 654.95 s [vector] +++ OK, passed 100 tests.
  7866. 654.95 s [vector] span: OK
  7867. 654.95 s [vector] +++ OK, passed 100 tests.
  7868. 654.95 s [vector] break: OK
  7869. 654.95 s [vector] +++ OK, passed 100 tests.
  7870. 654.95 s [vector] spanR: OK
  7871. 654.95 s [vector] +++ OK, passed 100 tests.
  7872. 654.95 s [vector] breakR: OK
  7873. 654.95 s [vector] +++ OK, passed 100 tests.
  7874. 654.95 s [vector] groupBy: OK
  7875. 654.95 s [vector] +++ OK, passed 100 tests.
  7876. 654.95 s [vector] elem: OK
  7877. 654.95 s [vector] +++ OK, passed 100 tests.
  7878. 654.95 s [vector] notElem: OK
  7879. 654.95 s [vector] +++ OK, passed 100 tests.
  7880. 654.95 s [vector] find: OK
  7881. 654.95 s [vector] +++ OK, passed 100 tests.
  7882. 654.95 s [vector] findIndex: OK
  7883. 654.95 s [vector] +++ OK, passed 100 tests.
  7884. 654.95 s [vector] findIndexR: OK
  7885. 654.95 s [vector] +++ OK, passed 100 tests.
  7886. 654.95 s [vector] findIndices: OK
  7887. 654.95 s [vector] +++ OK, passed 100 tests.
  7888. 654.95 s [vector] elemIndex: OK
  7889. 654.95 s [vector] +++ OK, passed 100 tests.
  7890. 654.96 s [vector] elemIndices: OK
  7891. 654.96 s [vector] +++ OK, passed 100 tests.
  7892. 654.96 s [vector] foldl: OK
  7893. 654.96 s [vector] +++ OK, passed 100 tests.
  7894. 654.96 s [vector] foldl1: OK
  7895. 654.96 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7896. 654.96 s [vector] foldl': OK
  7897. 654.96 s [vector] +++ OK, passed 100 tests.
  7898. 654.96 s [vector] foldl1': OK
  7899. 654.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7900. 654.96 s [vector] foldr: OK
  7901. 654.96 s [vector] +++ OK, passed 100 tests.
  7902. 654.96 s [vector] foldr1: OK
  7903. 654.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7904. 654.97 s [vector] foldr': OK
  7905. 654.97 s [vector] +++ OK, passed 100 tests.
  7906. 654.97 s [vector] foldr1': OK
  7907. 654.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7908. 654.97 s [vector] ifoldl: OK
  7909. 654.97 s [vector] +++ OK, passed 100 tests.
  7910. 654.97 s [vector] ifoldl': OK
  7911. 654.97 s [vector] +++ OK, passed 100 tests.
  7912. 654.98 s [vector] ifoldr: OK
  7913. 654.98 s [vector] +++ OK, passed 100 tests.
  7914. 654.98 s [vector] ifoldr': OK
  7915. 654.98 s [vector] +++ OK, passed 100 tests.
  7916. 654.98 s [vector] ifoldM: OK
  7917. 654.98 s [vector] +++ OK, passed 100 tests.
  7918. 654.98 s [vector] ifoldM': OK
  7919. 654.99 s [vector] +++ OK, passed 100 tests.
  7920. 655.01 s [vector] ifoldM_: OK (0.01s)
  7921. 655.01 s [vector] +++ OK, passed 100 tests.
  7922. 655.01 s [vector] ifoldM'_: OK (0.01s)
  7923. 655.01 s [vector] +++ OK, passed 100 tests.
  7924. 655.01 s [vector] all: OK
  7925. 655.01 s [vector] +++ OK, passed 100 tests.
  7926. 655.01 s [vector] any: OK
  7927. 655.01 s [vector] +++ OK, passed 100 tests.
  7928. 655.01 s [vector] prescanl: OK
  7929. 655.01 s [vector] +++ OK, passed 100 tests.
  7930. 655.01 s [vector] prescanl': OK
  7931. 655.01 s [vector] +++ OK, passed 100 tests.
  7932. 655.01 s [vector] postscanl: OK
  7933. 655.02 s [vector] +++ OK, passed 100 tests.
  7934. 655.02 s [vector] postscanl': OK
  7935. 655.02 s [vector] +++ OK, passed 100 tests.
  7936. 655.02 s [vector] scanl: OK
  7937. 655.02 s [vector] +++ OK, passed 100 tests.
  7938. 655.02 s [vector] scanl': OK
  7939. 655.02 s [vector] +++ OK, passed 100 tests.
  7940. 655.02 s [vector] scanl1: OK
  7941. 655.02 s [vector] +++ OK, passed 100 tests.
  7942. 655.02 s [vector] scanl1': OK
  7943. 655.02 s [vector] +++ OK, passed 100 tests.
  7944. 655.02 s [vector] iscanl: OK
  7945. 655.03 s [vector] +++ OK, passed 100 tests.
  7946. 655.03 s [vector] iscanl': OK
  7947. 655.03 s [vector] +++ OK, passed 100 tests.
  7948. 655.03 s [vector] prescanr: OK
  7949. 655.03 s [vector] +++ OK, passed 100 tests.
  7950. 655.03 s [vector] prescanr': OK
  7951. 655.03 s [vector] +++ OK, passed 100 tests.
  7952. 655.03 s [vector] postscanr: OK
  7953. 655.03 s [vector] +++ OK, passed 100 tests.
  7954. 655.03 s [vector] postscanr': OK
  7955. 655.04 s [vector] +++ OK, passed 100 tests.
  7956. 655.04 s [vector] scanr: OK
  7957. 655.04 s [vector] +++ OK, passed 100 tests.
  7958. 655.04 s [vector] scanr': OK
  7959. 655.04 s [vector] +++ OK, passed 100 tests.
  7960. 655.04 s [vector] scanr1: OK
  7961. 655.04 s [vector] +++ OK, passed 100 tests.
  7962. 655.04 s [vector] scanr1': OK
  7963. 655.04 s [vector] +++ OK, passed 100 tests.
  7964. 655.04 s [vector] iscanr: OK
  7965. 655.04 s [vector] +++ OK, passed 100 tests.
  7966. 655.04 s [vector] iscanr': OK
  7967. 655.04 s [vector] +++ OK, passed 100 tests.
  7968. 655.04 s [vector] mut_read: OK
  7969. 655.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7970. 655.04 s [vector] mut_write: OK
  7971. 655.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7972. 655.05 s [vector] mut_modify: OK
  7973. 655.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7974. 655.05 s [vector] mut_generate: OK
  7975. 655.05 s [vector] +++ OK, passed 100 tests.
  7976. 655.06 s [vector] mut_generateM: OK
  7977. 655.06 s [vector] +++ OK, passed 100 tests.
  7978. 655.06 s [vector] mut_mapM_: OK (0.01s)
  7979. 655.06 s [vector] +++ OK, passed 100 tests.
  7980. 655.08 s [vector] mut_imapM_: OK
  7981. 655.08 s [vector] +++ OK, passed 100 tests.
  7982. 655.08 s [vector] mut_forM_: OK (0.01s)
  7983. 655.08 s [vector] +++ OK, passed 100 tests.
  7984. 655.10 s [vector] mut_iforM_: OK (0.01s)
  7985. 655.10 s [vector] +++ OK, passed 100 tests.
  7986. 655.10 s [vector] mut_foldr: OK
  7987. 655.10 s [vector] +++ OK, passed 100 tests.
  7988. 655.10 s [vector] mut_foldr': OK
  7989. 655.10 s [vector] +++ OK, passed 100 tests.
  7990. 655.10 s [vector] mut_foldl: OK
  7991. 655.10 s [vector] +++ OK, passed 100 tests.
  7992. 655.10 s [vector] mut_foldl': OK
  7993. 655.11 s [vector] +++ OK, passed 100 tests.
  7994. 655.11 s [vector] mut_ifoldr: OK
  7995. 655.11 s [vector] +++ OK, passed 100 tests.
  7996. 655.11 s [vector] mut_ifoldr': OK
  7997. 655.11 s [vector] +++ OK, passed 100 tests.
  7998. 655.11 s [vector] mut_ifoldl: OK
  7999. 655.11 s [vector] +++ OK, passed 100 tests.
  8000. 655.11 s [vector] mut_ifoldl': OK
  8001. 655.11 s [vector] +++ OK, passed 100 tests.
  8002. 655.12 s [vector] mut_foldM: OK
  8003. 655.12 s [vector] +++ OK, passed 100 tests.
  8004. 655.12 s [vector] mut_foldM': OK
  8005. 655.12 s [vector] +++ OK, passed 100 tests.
  8006. 655.12 s [vector] mut_foldrM: OK
  8007. 655.12 s [vector] +++ OK, passed 100 tests.
  8008. 655.12 s [vector] mut_foldrM': OK
  8009. 655.12 s [vector] +++ OK, passed 100 tests.
  8010. 655.12 s [vector] mut_ifoldM: OK
  8011. 655.12 s [vector] +++ OK, passed 100 tests.
  8012. 655.13 s [vector] mut_ifoldM': OK
  8013. 655.13 s [vector] +++ OK, passed 100 tests.
  8014. 655.13 s [vector] mut_ifoldrM: OK
  8015. 655.13 s [vector] +++ OK, passed 100 tests.
  8016. 655.13 s [vector] mut_ifoldrM': OK
  8017. 655.13 s [vector] +++ OK, passed 100 tests.
  8018. 655.13 s [vector] compare: OK
  8019. 655.13 s [vector] +++ OK, passed 100 tests.
  8020. 655.13 s [vector] maximum: OK
  8021. 655.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8022. 655.13 s [vector] minimum: OK
  8023. 655.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8024. 655.13 s [vector] minIndex: OK
  8025. 655.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8026. 655.13 s [vector] maxIndex: OK
  8027. 655.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8028. 655.13 s [vector] maximumBy: OK
  8029. 655.13 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8030. 655.13 s [vector] minimumBy: OK
  8031. 655.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8032. 655.13 s [vector] maximumOn: OK
  8033. 655.13 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8034. 655.13 s [vector] minimumOn: OK
  8035. 655.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8036. 655.13 s [vector] maxIndexBy: OK
  8037. 655.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8038. 655.14 s [vector] minIndexBy: OK
  8039. 655.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8040. 655.14 s [vector] ListFirstMaxIndexWins: OK
  8041. 655.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8042. 655.14 s [vector] FalseListFirstMaxIndexWins: OK
  8043. 655.14 s [vector] +++ OK, failed as expected. (after 1 test):
  8044. 655.14 s [vector] Exception:
  8045. 655.14 s [vector] Prelude.foldr1: empty list
  8046. 655.14 s [vector] CallStack (from HasCallStack):
  8047. 655.14 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8048. 655.14 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8049. 655.14 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8050. 655.14 s [vector] []
  8051. 655.14 s [vector] zip: OK
  8052. 655.14 s [vector] +++ OK, passed 100 tests.
  8053. 655.14 s [vector] zip3: OK
  8054. 655.14 s [vector] +++ OK, passed 100 tests.
  8055. 655.14 s [vector] unzip: OK
  8056. 655.14 s [vector] +++ OK, passed 100 tests.
  8057. 655.14 s [vector] unzip3: OK
  8058. 655.14 s [vector] +++ OK, passed 100 tests.
  8059. 655.14 s [vector] indexed: OK
  8060. 655.14 s [vector] +++ OK, passed 100 tests.
  8061. 655.14 s [vector] update: OK
  8062. 655.15 s [vector] +++ OK, passed 100 tests.
  8063. 655.15 s [vector] concat: OK
  8064. 655.15 s [vector] +++ OK, passed 100 tests.
  8065. 655.15 s [vector] mempty: OK
  8066. 655.15 s [vector] +++ OK, passed 100 tests.
  8067. 655.16 s [vector] mappend: OK
  8068. 655.16 s [vector] +++ OK, passed 100 tests.
  8069. 655.16 s [vector] mconcat: OK
  8070. 655.16 s [vector] +++ OK, passed 100 tests.
  8071. 655.16 s [vector] fmap: OK
  8072. 655.16 s [vector] +++ OK, passed 100 tests.
  8073. 655.17 s [vector] return: OK
  8074. 655.17 s [vector] +++ OK, passed 100 tests.
  8075. 655.17 s [vector] bind: OK (0.01s)
  8076. 655.17 s [vector] +++ OK, passed 100 tests.
  8077. 655.17 s [vector] mzip: OK
  8078. 655.17 s [vector] +++ OK, passed 100 tests.
  8079. 655.17 s [vector] munzip: OK
  8080. 655.17 s [vector] +++ OK, passed 100 tests.
  8081. 655.18 s [vector] applicative_pure: OK
  8082. 655.18 s [vector] +++ OK, passed 100 tests.
  8083. 655.18 s [vector] applicative_appl: OK (0.01s)
  8084. 655.18 s [vector] +++ OK, passed 100 tests.
  8085. 655.19 s [vector] alternative_empty: OK
  8086. 655.19 s [vector] +++ OK, passed 100 tests.
  8087. 655.19 s [vector] alternative_or: OK
  8088. 655.19 s [vector] +++ OK, passed 100 tests.
  8089. 655.22 s [vector] sequence: OK (0.04s)
  8090. 655.22 s [vector] +++ OK, passed 100 tests.
  8091. 655.23 s [vector] sequence_: OK
  8092. 655.23 s [vector] +++ OK, passed 100 tests.
  8093. 655.23 s [vector] glength: OK
  8094. 655.23 s [vector] +++ OK, passed 100 tests.
  8095. 655.23 s [vector] and: OK
  8096. 655.23 s [vector] +++ OK, passed 100 tests.
  8097. 655.23 s [vector] or: OK
  8098. 655.23 s [vector] +++ OK, passed 100 tests.
  8099. 655.23 s [vector] Int
  8100. 655.23 s [vector] fromList.toList == id: OK
  8101. 655.23 s [vector] +++ OK, passed 100 tests.
  8102. 655.23 s [vector] toList.fromList == id: OK
  8103. 655.23 s [vector] +++ OK, passed 100 tests.
  8104. 655.23 s [vector] unstream.stream == id: OK
  8105. 655.23 s [vector] +++ OK, passed 100 tests.
  8106. 655.23 s [vector] stream.unstream == id: OK
  8107. 655.23 s [vector] +++ OK, passed 100 tests.
  8108. 655.23 s [vector] eq: OK
  8109. 655.23 s [vector] +++ OK, passed 100 tests.
  8110. 655.23 s [vector] length: OK
  8111. 655.23 s [vector] +++ OK, passed 100 tests.
  8112. 655.23 s [vector] null: OK
  8113. 655.23 s [vector] +++ OK, passed 100 tests.
  8114. 655.23 s [vector] index: OK
  8115. 655.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8116. 655.23 s [vector] safeIndex: OK
  8117. 655.23 s [vector] +++ OK, passed 100 tests.
  8118. 655.23 s [vector] head: OK
  8119. 655.23 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8120. 655.23 s [vector] last: OK
  8121. 655.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8122. 655.23 s [vector] unsafeIndex: OK
  8123. 655.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8124. 655.24 s [vector] unsafeHead: OK
  8125. 655.24 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8126. 655.24 s [vector] unsafeLast: OK
  8127. 655.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8128. 655.24 s [vector] slice: OK
  8129. 655.24 s [vector] +++ OK, passed 100 tests.
  8130. 655.24 s [vector] init: OK
  8131. 655.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8132. 655.24 s [vector] tail: OK
  8133. 655.24 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8134. 655.24 s [vector] take: OK
  8135. 655.24 s [vector] +++ OK, passed 100 tests.
  8136. 655.24 s [vector] drop: OK
  8137. 655.24 s [vector] +++ OK, passed 100 tests.
  8138. 655.24 s [vector] splitAt: OK
  8139. 655.24 s [vector] +++ OK, passed 100 tests.
  8140. 655.24 s [vector] empty: OK
  8141. 655.24 s [vector] +++ OK, passed 100 tests.
  8142. 655.24 s [vector] singleton: OK
  8143. 655.24 s [vector] +++ OK, passed 100 tests.
  8144. 655.24 s [vector] replicate: OK
  8145. 655.24 s [vector] +++ OK, passed 100 tests.
  8146. 655.24 s [vector] generate: OK
  8147. 655.24 s [vector] +++ OK, passed 100 tests.
  8148. 655.24 s [vector] iterateN: OK
  8149. 655.24 s [vector] +++ OK, passed 100 tests.
  8150. 655.26 s [vector] iterateNM: OK (0.02s)
  8151. 655.26 s [vector] +++ OK, passed 100 tests.
  8152. 655.28 s [vector] generateM: OK (0.02s)
  8153. 655.28 s [vector] +++ OK, passed 100 tests.
  8154. 655.29 s [vector] replicateM: OK (0.01s)
  8155. 655.29 s [vector] +++ OK, passed 100 tests.
  8156. 655.29 s [vector] create: OK
  8157. 655.29 s [vector] +++ OK, passed 100 tests.
  8158. 655.29 s [vector] createT: OK
  8159. 655.29 s [vector] +++ OK, passed 100 tests.
  8160. 655.29 s [vector] unfoldr: OK
  8161. 655.29 s [vector] +++ OK, passed 100 tests.
  8162. 655.29 s [vector] unfoldrN: OK
  8163. 655.29 s [vector] +++ OK, passed 100 tests.
  8164. 655.30 s [vector] unfoldrExactN: OK
  8165. 655.30 s [vector] +++ OK, passed 100 tests.
  8166. 655.30 s [vector] unfoldrM: OK
  8167. 655.30 s [vector] +++ OK, passed 100 tests.
  8168. 655.30 s [vector] unfoldrNM: OK
  8169. 655.30 s [vector] +++ OK, passed 100 tests.
  8170. 655.33 s [vector] unfoldrExactNM: OK (0.03s)
  8171. 655.33 s [vector] +++ OK, passed 100 tests.
  8172. 655.33 s [vector] constructN: OK
  8173. 655.33 s [vector] +++ OK, passed 100 tests.
  8174. 655.33 s [vector] constructrN: OK
  8175. 655.33 s [vector] +++ OK, passed 100 tests.
  8176. 655.33 s [vector] cons: OK
  8177. 655.33 s [vector] +++ OK, passed 100 tests.
  8178. 655.34 s [vector] snoc: OK
  8179. 655.34 s [vector] +++ OK, passed 100 tests.
  8180. 655.34 s [vector] append: OK
  8181. 655.35 s [vector] +++ OK, passed 100 tests.
  8182. 655.35 s [vector] concat: OK (0.01s)
  8183. 655.35 s [vector] +++ OK, passed 100 tests.
  8184. 655.35 s [vector] force: OK
  8185. 655.35 s [vector] +++ OK, passed 100 tests.
  8186. 655.35 s [vector] upd: OK
  8187. 655.35 s [vector] +++ OK, passed 100 tests.
  8188. 655.35 s [vector] accum: OK
  8189. 655.35 s [vector] +++ OK, passed 100 tests.
  8190. 655.36 s [vector] reverse: OK
  8191. 655.36 s [vector] +++ OK, passed 100 tests.
  8192. 655.36 s [vector] backpermute: OK
  8193. 655.36 s [vector] +++ OK, passed 100 tests.
  8194. 655.36 s [vector] map: OK
  8195. 655.36 s [vector] +++ OK, passed 100 tests.
  8196. 655.36 s [vector] imap: OK
  8197. 655.36 s [vector] +++ OK, passed 100 tests.
  8198. 655.36 s [vector] concatMap: OK
  8199. 655.36 s [vector] +++ OK, passed 100 tests.
  8200. 655.37 s [vector] mapM: OK
  8201. 655.37 s [vector] +++ OK, passed 100 tests.
  8202. 655.39 s [vector] mapM_: OK (0.02s)
  8203. 655.39 s [vector] +++ OK, passed 100 tests.
  8204. 655.39 s [vector] forM: OK
  8205. 655.40 s [vector] +++ OK, passed 100 tests.
  8206. 655.41 s [vector] forM_: OK (0.02s)
  8207. 655.41 s [vector] +++ OK, passed 100 tests.
  8208. 655.41 s [vector] imapM: OK
  8209. 655.42 s [vector] +++ OK, passed 100 tests.
  8210. 655.43 s [vector] imapM_: OK (0.02s)
  8211. 655.43 s [vector] +++ OK, passed 100 tests.
  8212. 655.43 s [vector] zipWith: OK
  8213. 655.43 s [vector] +++ OK, passed 100 tests.
  8214. 655.43 s [vector] zipWith3: OK
  8215. 655.43 s [vector] +++ OK, passed 100 tests.
  8216. 655.43 s [vector] izipWith: OK
  8217. 655.43 s [vector] +++ OK, passed 100 tests.
  8218. 655.44 s [vector] izipWith3: OK
  8219. 655.44 s [vector] +++ OK, passed 100 tests.
  8220. 655.44 s [vector] izipWithM: OK
  8221. 655.45 s [vector] +++ OK, passed 100 tests.
  8222. 655.46 s [vector] izipWithM_: OK (0.01s)
  8223. 655.46 s [vector] +++ OK, passed 100 tests.
  8224. 655.47 s [vector] zipWithM: OK
  8225. 655.47 s [vector] +++ OK, passed 100 tests.
  8226. 655.47 s [vector] zipWithM_: OK (0.01s)
  8227. 655.47 s [vector] +++ OK, passed 100 tests.
  8228. 655.47 s [vector] filter: OK
  8229. 655.47 s [vector] +++ OK, passed 100 tests.
  8230. 655.49 s [vector] ifilter: OK
  8231. 655.49 s [vector] +++ OK, passed 100 tests.
  8232. 655.50 s [vector] filterM: OK (0.02s)
  8233. 655.50 s [vector] +++ OK, passed 100 tests.
  8234. 655.50 s [vector] uniq: OK
  8235. 655.50 s [vector] +++ OK, passed 100 tests.
  8236. 655.50 s [vector] mapMaybe: OK
  8237. 655.50 s [vector] +++ OK, passed 100 tests.
  8238. 655.50 s [vector] imapMaybe: OK
  8239. 655.50 s [vector] +++ OK, passed 100 tests.
  8240. 655.50 s [vector] takeWhile: OK
  8241. 655.50 s [vector] +++ OK, passed 100 tests.
  8242. 655.51 s [vector] dropWhile: OK
  8243. 655.51 s [vector] +++ OK, passed 100 tests.
  8244. 655.51 s [vector] partition: OK
  8245. 655.51 s [vector] +++ OK, passed 100 tests.
  8246. 655.51 s [vector] partitionWith: OK
  8247. 655.51 s [vector] +++ OK, passed 100 tests.
  8248. 655.51 s [vector] span: OK
  8249. 655.51 s [vector] +++ OK, passed 100 tests.
  8250. 655.51 s [vector] break: OK
  8251. 655.51 s [vector] +++ OK, passed 100 tests.
  8252. 655.51 s [vector] spanR: OK
  8253. 655.51 s [vector] +++ OK, passed 100 tests.
  8254. 655.51 s [vector] breakR: OK
  8255. 655.51 s [vector] +++ OK, passed 100 tests.
  8256. 655.51 s [vector] groupBy: OK
  8257. 655.51 s [vector] +++ OK, passed 100 tests.
  8258. 655.51 s [vector] elem: OK
  8259. 655.51 s [vector] +++ OK, passed 100 tests.
  8260. 655.51 s [vector] notElem: OK
  8261. 655.51 s [vector] +++ OK, passed 100 tests.
  8262. 655.51 s [vector] find: OK
  8263. 655.51 s [vector] +++ OK, passed 100 tests.
  8264. 655.51 s [vector] findIndex: OK
  8265. 655.51 s [vector] +++ OK, passed 100 tests.
  8266. 655.52 s [vector] findIndexR: OK
  8267. 655.52 s [vector] +++ OK, passed 100 tests.
  8268. 655.52 s [vector] findIndices: OK
  8269. 655.52 s [vector] +++ OK, passed 100 tests.
  8270. 655.52 s [vector] elemIndex: OK
  8271. 655.52 s [vector] +++ OK, passed 100 tests.
  8272. 655.52 s [vector] elemIndices: OK
  8273. 655.52 s [vector] +++ OK, passed 100 tests.
  8274. 655.52 s [vector] foldl: OK
  8275. 655.52 s [vector] +++ OK, passed 100 tests.
  8276. 655.52 s [vector] foldl1: OK
  8277. 655.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8278. 655.52 s [vector] foldl': OK
  8279. 655.52 s [vector] +++ OK, passed 100 tests.
  8280. 655.53 s [vector] foldl1': OK
  8281. 655.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8282. 655.53 s [vector] foldr: OK
  8283. 655.53 s [vector] +++ OK, passed 100 tests.
  8284. 655.54 s [vector] foldr1: OK
  8285. 655.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8286. 655.54 s [vector] foldr': OK
  8287. 655.54 s [vector] +++ OK, passed 100 tests.
  8288. 655.54 s [vector] foldr1': OK
  8289. 655.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8290. 655.54 s [vector] ifoldl: OK
  8291. 655.54 s [vector] +++ OK, passed 100 tests.
  8292. 655.55 s [vector] ifoldl': OK
  8293. 655.55 s [vector] +++ OK, passed 100 tests.
  8294. 655.55 s [vector] ifoldr: OK
  8295. 655.55 s [vector] +++ OK, passed 100 tests.
  8296. 655.56 s [vector] ifoldr': OK
  8297. 655.56 s [vector] +++ OK, passed 100 tests.
  8298. 655.56 s [vector] ifoldM: OK
  8299. 655.56 s [vector] +++ OK, passed 100 tests.
  8300. 655.57 s [vector] ifoldM': OK
  8301. 655.57 s [vector] +++ OK, passed 100 tests.
  8302. 655.59 s [vector] ifoldM_: OK (0.02s)
  8303. 655.59 s [vector] +++ OK, passed 100 tests.
  8304. 655.60 s [vector] ifoldM'_: OK (0.02s)
  8305. 655.60 s [vector] +++ OK, passed 100 tests.
  8306. 655.60 s [vector] all: OK
  8307. 655.60 s [vector] +++ OK, passed 100 tests.
  8308. 655.60 s [vector] any: OK
  8309. 655.60 s [vector] +++ OK, passed 100 tests.
  8310. 655.60 s [vector] prescanl: OK
  8311. 655.60 s [vector] +++ OK, passed 100 tests.
  8312. 655.60 s [vector] prescanl': OK
  8313. 655.60 s [vector] +++ OK, passed 100 tests.
  8314. 655.61 s [vector] postscanl: OK
  8315. 655.61 s [vector] +++ OK, passed 100 tests.
  8316. 655.61 s [vector] postscanl': OK
  8317. 655.61 s [vector] +++ OK, passed 100 tests.
  8318. 655.61 s [vector] scanl: OK
  8319. 655.61 s [vector] +++ OK, passed 100 tests.
  8320. 655.61 s [vector] scanl': OK
  8321. 655.62 s [vector] +++ OK, passed 100 tests.
  8322. 655.62 s [vector] scanl1: OK
  8323. 655.62 s [vector] +++ OK, passed 100 tests.
  8324. 655.62 s [vector] scanl1': OK
  8325. 655.62 s [vector] +++ OK, passed 100 tests.
  8326. 655.63 s [vector] iscanl: OK
  8327. 655.63 s [vector] +++ OK, passed 100 tests.
  8328. 655.63 s [vector] iscanl': OK
  8329. 655.63 s [vector] +++ OK, passed 100 tests.
  8330. 655.63 s [vector] prescanr: OK
  8331. 655.63 s [vector] +++ OK, passed 100 tests.
  8332. 655.63 s [vector] prescanr': OK
  8333. 655.63 s [vector] +++ OK, passed 100 tests.
  8334. 655.63 s [vector] postscanr: OK
  8335. 655.64 s [vector] +++ OK, passed 100 tests.
  8336. 655.64 s [vector] postscanr': OK
  8337. 655.64 s [vector] +++ OK, passed 100 tests.
  8338. 655.64 s [vector] scanr: OK
  8339. 655.64 s [vector] +++ OK, passed 100 tests.
  8340. 655.64 s [vector] scanr': OK
  8341. 655.64 s [vector] +++ OK, passed 100 tests.
  8342. 655.64 s [vector] scanr1: OK
  8343. 655.65 s [vector] +++ OK, passed 100 tests.
  8344. 655.65 s [vector] scanr1': OK
  8345. 655.65 s [vector] +++ OK, passed 100 tests.
  8346. 655.66 s [vector] iscanr: OK
  8347. 655.66 s [vector] +++ OK, passed 100 tests.
  8348. 655.66 s [vector] iscanr': OK
  8349. 655.66 s [vector] +++ OK, passed 100 tests.
  8350. 655.66 s [vector] mut_read: OK
  8351. 655.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8352. 655.66 s [vector] mut_write: OK
  8353. 655.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8354. 655.66 s [vector] mut_modify: OK
  8355. 655.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8356. 655.66 s [vector] mut_generate: OK
  8357. 655.67 s [vector] +++ OK, passed 100 tests.
  8358. 655.67 s [vector] mut_generateM: OK
  8359. 655.68 s [vector] +++ OK, passed 100 tests.
  8360. 655.70 s [vector] mut_mapM_: OK (0.02s)
  8361. 655.70 s [vector] +++ OK, passed 100 tests.
  8362. 655.72 s [vector] mut_imapM_: OK (0.02s)
  8363. 655.72 s [vector] +++ OK, passed 100 tests.
  8364. 655.73 s [vector] mut_forM_: OK (0.02s)
  8365. 655.73 s [vector] +++ OK, passed 100 tests.
  8366. 655.74 s [vector] mut_iforM_: OK (0.02s)
  8367. 655.74 s [vector] +++ OK, passed 100 tests.
  8368. 655.74 s [vector] mut_foldr: OK
  8369. 655.75 s [vector] +++ OK, passed 100 tests.
  8370. 655.75 s [vector] mut_foldr': OK
  8371. 655.75 s [vector] +++ OK, passed 100 tests.
  8372. 655.75 s [vector] mut_foldl: OK
  8373. 655.76 s [vector] +++ OK, passed 100 tests.
  8374. 655.76 s [vector] mut_foldl': OK
  8375. 655.76 s [vector] +++ OK, passed 100 tests.
  8376. 655.77 s [vector] mut_ifoldr: OK
  8377. 655.77 s [vector] +++ OK, passed 100 tests.
  8378. 655.77 s [vector] mut_ifoldr': OK
  8379. 655.77 s [vector] +++ OK, passed 100 tests.
  8380. 655.77 s [vector] mut_ifoldl: OK
  8381. 655.77 s [vector] +++ OK, passed 100 tests.
  8382. 655.77 s [vector] mut_ifoldl': OK
  8383. 655.77 s [vector] +++ OK, passed 100 tests.
  8384. 655.77 s [vector] mut_foldM: OK
  8385. 655.77 s [vector] +++ OK, passed 100 tests.
  8386. 655.78 s [vector] mut_foldM': OK
  8387. 655.78 s [vector] +++ OK, passed 100 tests.
  8388. 655.78 s [vector] mut_foldrM: OK
  8389. 655.79 s [vector] +++ OK, passed 100 tests.
  8390. 655.79 s [vector] mut_foldrM': OK
  8391. 655.79 s [vector] +++ OK, passed 100 tests.
  8392. 655.79 s [vector] mut_ifoldM: OK
  8393. 655.80 s [vector] +++ OK, passed 100 tests.
  8394. 655.80 s [vector] mut_ifoldM': OK
  8395. 655.80 s [vector] +++ OK, passed 100 tests.
  8396. 655.80 s [vector] mut_ifoldrM: OK
  8397. 655.80 s [vector] +++ OK, passed 100 tests.
  8398. 655.80 s [vector] mut_ifoldrM': OK
  8399. 655.80 s [vector] +++ OK, passed 100 tests.
  8400. 655.80 s [vector] compare: OK
  8401. 655.80 s [vector] +++ OK, passed 100 tests.
  8402. 655.81 s [vector] maximum: OK
  8403. 655.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8404. 655.81 s [vector] minimum: OK
  8405. 655.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8406. 655.81 s [vector] minIndex: OK
  8407. 655.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8408. 655.81 s [vector] maxIndex: OK
  8409. 655.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8410. 655.81 s [vector] maximumBy: OK
  8411. 655.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8412. 655.81 s [vector] minimumBy: OK
  8413. 655.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8414. 655.81 s [vector] maximumOn: OK
  8415. 655.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8416. 655.81 s [vector] minimumOn: OK
  8417. 655.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8418. 655.81 s [vector] maxIndexBy: OK
  8419. 655.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8420. 655.82 s [vector] minIndexBy: OK
  8421. 655.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8422. 655.82 s [vector] ListFirstMaxIndexWins: OK
  8423. 655.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8424. 655.82 s [vector] FalseListFirstMaxIndexWins: OK
  8425. 655.82 s [vector] +++ OK, failed as expected. (after 1 test):
  8426. 655.82 s [vector] Exception:
  8427. 655.82 s [vector] Prelude.foldr1: empty list
  8428. 655.82 s [vector] CallStack (from HasCallStack):
  8429. 655.82 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8430. 655.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8431. 655.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8432. 655.82 s [vector] []
  8433. 655.82 s [vector] zip: OK
  8434. 655.82 s [vector] +++ OK, passed 100 tests.
  8435. 655.82 s [vector] zip3: OK
  8436. 655.82 s [vector] +++ OK, passed 100 tests.
  8437. 655.82 s [vector] unzip: OK
  8438. 655.82 s [vector] +++ OK, passed 100 tests.
  8439. 655.82 s [vector] unzip3: OK
  8440. 655.82 s [vector] +++ OK, passed 100 tests.
  8441. 655.82 s [vector] indexed: OK
  8442. 655.82 s [vector] +++ OK, passed 100 tests.
  8443. 655.83 s [vector] update: OK
  8444. 655.83 s [vector] +++ OK, passed 100 tests.
  8445. 655.83 s [vector] concat: OK (0.01s)
  8446. 655.83 s [vector] +++ OK, passed 100 tests.
  8447. 655.83 s [vector] mempty: OK
  8448. 655.83 s [vector] +++ OK, passed 100 tests.
  8449. 655.83 s [vector] mappend: OK
  8450. 655.84 s [vector] +++ OK, passed 100 tests.
  8451. 655.84 s [vector] mconcat: OK
  8452. 655.84 s [vector] +++ OK, passed 100 tests.
  8453. 655.84 s [vector] fmap: OK
  8454. 655.84 s [vector] +++ OK, passed 100 tests.
  8455. 655.84 s [vector] return: OK
  8456. 655.85 s [vector] +++ OK, passed 100 tests.
  8457. 655.86 s [vector] bind: OK (0.02s)
  8458. 655.86 s [vector] +++ OK, passed 100 tests.
  8459. 655.87 s [vector] mzip: OK
  8460. 655.87 s [vector] +++ OK, passed 100 tests.
  8461. 655.87 s [vector] munzip: OK
  8462. 655.87 s [vector] +++ OK, passed 100 tests.
  8463. 655.87 s [vector] applicative_pure: OK
  8464. 655.87 s [vector] +++ OK, passed 100 tests.
  8465. 655.91 s [vector] applicative_appl: OK (0.04s)
  8466. 655.91 s [vector] +++ OK, passed 100 tests.
  8467. 655.91 s [vector] alternative_empty: OK
  8468. 655.91 s [vector] +++ OK, passed 100 tests.
  8469. 655.91 s [vector] alternative_or: OK
  8470. 655.91 s [vector] +++ OK, passed 100 tests.
  8471. 655.97 s [vector] sequence: OK (0.05s)
  8472. 655.97 s [vector] +++ OK, passed 100 tests.
  8473. 655.97 s [vector] sequence_: OK (0.01s)
  8474. 655.97 s [vector] +++ OK, passed 100 tests.
  8475. 655.97 s [vector] glength: OK
  8476. 655.97 s [vector] +++ OK, passed 100 tests.
  8477. 655.97 s [vector] sum: OK
  8478. 655.97 s [vector] +++ OK, passed 100 tests.
  8479. 655.97 s [vector] product: OK
  8480. 655.97 s [vector] +++ OK, passed 100 tests.
  8481. 655.97 s [vector] enumFromN: OK
  8482. 655.97 s [vector] +++ OK, passed 100 tests.
  8483. 655.97 s [vector] enumFromThenN: OK
  8484. 655.97 s [vector] +++ OK, passed 100 tests.
  8485. 655.97 s [vector] enumFromTo: OK
  8486. 655.97 s [vector] +++ OK, passed 100 tests.
  8487. 655.97 s [vector] enumFromThenTo: OK
  8488. 655.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8489. 655.97 s [vector] unstream
  8490. 655.98 s [vector] unstream == vunstream (exact): OK
  8491. 655.98 s [vector] +++ OK, passed 100 tests.
  8492. 655.98 s [vector] unstream == vunstream (unknown): OK
  8493. 655.98 s [vector] +++ OK, passed 100 tests.
  8494. 655.98 s [vector] unstreamR ~= vunstream (exact): OK
  8495. 655.98 s [vector] +++ OK, passed 100 tests.
  8496. 655.98 s [vector] unstreamR ~= vunstream (unknown): OK
  8497. 655.98 s [vector] +++ OK, passed 100 tests.
  8498. 655.98 s [vector] Tests.Vector.Unboxed
  8499. 655.98 s [vector] ()
  8500. 655.98 s [vector] fromList.toList == id: OK
  8501. 655.98 s [vector] +++ OK, passed 100 tests.
  8502. 655.98 s [vector] toList.fromList == id: OK
  8503. 655.98 s [vector] +++ OK, passed 100 tests.
  8504. 655.98 s [vector] unstream.stream == id: OK
  8505. 655.98 s [vector] +++ OK, passed 100 tests.
  8506. 655.98 s [vector] stream.unstream == id: OK
  8507. 655.98 s [vector] +++ OK, passed 100 tests.
  8508. 655.98 s [vector] eq: OK
  8509. 655.98 s [vector] +++ OK, passed 100 tests.
  8510. 655.98 s [vector] length: OK
  8511. 655.99 s [vector] +++ OK, passed 100 tests.
  8512. 655.99 s [vector] null: OK
  8513. 655.99 s [vector] +++ OK, passed 100 tests.
  8514. 655.99 s [vector] index: OK
  8515. 655.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8516. 655.99 s [vector] safeIndex: OK
  8517. 655.99 s [vector] +++ OK, passed 100 tests.
  8518. 655.99 s [vector] head: OK
  8519. 655.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8520. 655.99 s [vector] last: OK
  8521. 655.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8522. 655.99 s [vector] unsafeIndex: OK
  8523. 655.99 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8524. 655.99 s [vector] unsafeHead: OK
  8525. 655.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8526. 655.99 s [vector] unsafeLast: OK
  8527. 655.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8528. 655.99 s [vector] slice: OK
  8529. 655.99 s [vector] +++ OK, passed 100 tests.
  8530. 655.99 s [vector] init: OK
  8531. 655.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8532. 655.99 s [vector] tail: OK
  8533. 655.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8534. 655.99 s [vector] take: OK
  8535. 655.99 s [vector] +++ OK, passed 100 tests.
  8536. 655.99 s [vector] drop: OK
  8537. 655.99 s [vector] +++ OK, passed 100 tests.
  8538. 655.99 s [vector] splitAt: OK
  8539. 655.99 s [vector] +++ OK, passed 100 tests.
  8540. 655.99 s [vector] empty: OK
  8541. 655.99 s [vector] +++ OK, passed 100 tests.
  8542. 655.99 s [vector] singleton: OK
  8543. 655.99 s [vector] +++ OK, passed 100 tests.
  8544. 655.99 s [vector] replicate: OK
  8545. 655.99 s [vector] +++ OK, passed 100 tests.
  8546. 655.99 s [vector] generate: OK
  8547. 655.99 s [vector] +++ OK, passed 100 tests.
  8548. 655.99 s [vector] iterateN: OK
  8549. 655.99 s [vector] +++ OK, passed 100 tests.
  8550. 656.05 s [vector] iterateNM: OK (0.04s)
  8551. 656.05 s [vector] +++ OK, passed 100 tests.
  8552. 656.07 s [vector] generateM: OK
  8553. 656.07 s [vector] +++ OK, passed 100 tests.
  8554. 656.08 s [vector] replicateM: OK (0.02s)
  8555. 656.08 s [vector] +++ OK, passed 100 tests.
  8556. 656.08 s [vector] create: OK
  8557. 656.08 s [vector] +++ OK, passed 100 tests.
  8558. 656.08 s [vector] createT: OK
  8559. 656.08 s [vector] +++ OK, passed 100 tests.
  8560. 656.08 s [vector] unfoldr: OK
  8561. 656.08 s [vector] +++ OK, passed 100 tests.
  8562. 656.08 s [vector] unfoldrN: OK
  8563. 656.08 s [vector] +++ OK, passed 100 tests.
  8564. 656.08 s [vector] unfoldrExactN: OK
  8565. 656.08 s [vector] +++ OK, passed 100 tests.
  8566. 656.08 s [vector] unfoldrM: OK
  8567. 656.08 s [vector] +++ OK, passed 100 tests.
  8568. 656.08 s [vector] unfoldrNM: OK
  8569. 656.08 s [vector] +++ OK, passed 100 tests.
  8570. 656.16 s [vector] unfoldrExactNM: OK (0.07s)
  8571. 656.16 s [vector] +++ OK, passed 100 tests.
  8572. 656.16 s [vector] constructN: OK
  8573. 656.16 s [vector] +++ OK, passed 100 tests.
  8574. 656.16 s [vector] constructrN: OK
  8575. 656.16 s [vector] +++ OK, passed 100 tests.
  8576. 656.16 s [vector] cons: OK
  8577. 656.16 s [vector] +++ OK, passed 100 tests.
  8578. 656.16 s [vector] snoc: OK
  8579. 656.16 s [vector] +++ OK, passed 100 tests.
  8580. 656.17 s [vector] append: OK
  8581. 656.17 s [vector] +++ OK, passed 100 tests.
  8582. 656.17 s [vector] concat: OK
  8583. 656.17 s [vector] +++ OK, passed 100 tests.
  8584. 656.17 s [vector] force: OK
  8585. 656.17 s [vector] +++ OK, passed 100 tests.
  8586. 656.17 s [vector] upd: OK
  8587. 656.17 s [vector] +++ OK, passed 100 tests.
  8588. 656.17 s [vector] accum: OK
  8589. 656.17 s [vector] +++ OK, passed 100 tests.
  8590. 656.17 s [vector] reverse: OK
  8591. 656.17 s [vector] +++ OK, passed 100 tests.
  8592. 656.17 s [vector] backpermute: OK
  8593. 656.17 s [vector] +++ OK, passed 100 tests.
  8594. 656.18 s [vector] map: OK
  8595. 656.18 s [vector] +++ OK, passed 100 tests.
  8596. 656.18 s [vector] imap: OK
  8597. 656.18 s [vector] +++ OK, passed 100 tests.
  8598. 656.18 s [vector] concatMap: OK
  8599. 656.18 s [vector] +++ OK, passed 100 tests.
  8600. 656.18 s [vector] mapM: OK
  8601. 656.19 s [vector] +++ OK, passed 100 tests.
  8602. 656.19 s [vector] mapM_: OK
  8603. 656.19 s [vector] +++ OK, passed 100 tests.
  8604. 656.20 s [vector] forM: OK
  8605. 656.20 s [vector] +++ OK, passed 100 tests.
  8606. 656.20 s [vector] forM_: OK
  8607. 656.20 s [vector] +++ OK, passed 100 tests.
  8608. 656.21 s [vector] imapM: OK
  8609. 656.21 s [vector] +++ OK, passed 100 tests.
  8610. 656.21 s [vector] imapM_: OK (0.01s)
  8611. 656.21 s [vector] +++ OK, passed 100 tests.
  8612. 656.21 s [vector] zipWith: OK
  8613. 656.21 s [vector] +++ OK, passed 100 tests.
  8614. 656.21 s [vector] zipWith3: OK
  8615. 656.21 s [vector] +++ OK, passed 100 tests.
  8616. 656.21 s [vector] izipWith: OK
  8617. 656.21 s [vector] +++ OK, passed 100 tests.
  8618. 656.21 s [vector] izipWith3: OK
  8619. 656.21 s [vector] +++ OK, passed 100 tests.
  8620. 656.22 s [vector] izipWithM: OK
  8621. 656.22 s [vector] +++ OK, passed 100 tests.
  8622. 656.22 s [vector] izipWithM_: OK
  8623. 656.23 s [vector] +++ OK, passed 100 tests.
  8624. 656.23 s [vector] zipWithM: OK
  8625. 656.23 s [vector] +++ OK, passed 100 tests.
  8626. 656.23 s [vector] zipWithM_: OK
  8627. 656.23 s [vector] +++ OK, passed 100 tests.
  8628. 656.23 s [vector] filter: OK
  8629. 656.23 s [vector] +++ OK, passed 100 tests.
  8630. 656.25 s [vector] ifilter: OK
  8631. 656.25 s [vector] +++ OK, passed 100 tests.
  8632. 656.26 s [vector] filterM: OK (0.03s)
  8633. 656.26 s [vector] +++ OK, passed 100 tests.
  8634. 656.26 s [vector] uniq: OK
  8635. 656.26 s [vector] +++ OK, passed 100 tests.
  8636. 656.26 s [vector] mapMaybe: OK
  8637. 656.26 s [vector] +++ OK, passed 100 tests.
  8638. 656.26 s [vector] imapMaybe: OK
  8639. 656.27 s [vector] +++ OK, passed 100 tests.
  8640. 656.27 s [vector] takeWhile: OK
  8641. 656.27 s [vector] +++ OK, passed 100 tests.
  8642. 656.27 s [vector] dropWhile: OK
  8643. 656.27 s [vector] +++ OK, passed 100 tests.
  8644. 656.27 s [vector] partition: OK
  8645. 656.27 s [vector] +++ OK, passed 100 tests.
  8646. 656.27 s [vector] partitionWith: OK
  8647. 656.27 s [vector] +++ OK, passed 100 tests.
  8648. 656.27 s [vector] span: OK
  8649. 656.27 s [vector] +++ OK, passed 100 tests.
  8650. 656.27 s [vector] break: OK
  8651. 656.27 s [vector] +++ OK, passed 100 tests.
  8652. 656.27 s [vector] spanR: OK
  8653. 656.27 s [vector] +++ OK, passed 100 tests.
  8654. 656.27 s [vector] breakR: OK
  8655. 656.27 s [vector] +++ OK, passed 100 tests.
  8656. 656.27 s [vector] groupBy: OK
  8657. 656.27 s [vector] +++ OK, passed 100 tests.
  8658. 656.27 s [vector] elem: OK
  8659. 656.27 s [vector] +++ OK, passed 100 tests.
  8660. 656.28 s [vector] notElem: OK
  8661. 656.28 s [vector] +++ OK, passed 100 tests.
  8662. 656.28 s [vector] find: OK
  8663. 656.28 s [vector] +++ OK, passed 100 tests.
  8664. 656.28 s [vector] findIndex: OK
  8665. 656.28 s [vector] +++ OK, passed 100 tests.
  8666. 656.28 s [vector] findIndexR: OK
  8667. 656.28 s [vector] +++ OK, passed 100 tests.
  8668. 656.28 s [vector] findIndices: OK
  8669. 656.28 s [vector] +++ OK, passed 100 tests.
  8670. 656.28 s [vector] elemIndex: OK
  8671. 656.28 s [vector] +++ OK, passed 100 tests.
  8672. 656.28 s [vector] elemIndices: OK
  8673. 656.28 s [vector] +++ OK, passed 100 tests.
  8674. 656.28 s [vector] foldl: OK
  8675. 656.28 s [vector] +++ OK, passed 100 tests.
  8676. 656.28 s [vector] foldl1: OK
  8677. 656.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8678. 656.28 s [vector] foldl': OK
  8679. 656.28 s [vector] +++ OK, passed 100 tests.
  8680. 656.28 s [vector] foldl1': OK
  8681. 656.28 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8682. 656.28 s [vector] foldr: OK
  8683. 656.28 s [vector] +++ OK, passed 100 tests.
  8684. 656.28 s [vector] foldr1: OK
  8685. 656.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8686. 656.28 s [vector] foldr': OK
  8687. 656.28 s [vector] +++ OK, passed 100 tests.
  8688. 656.28 s [vector] foldr1': OK
  8689. 656.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8690. 656.28 s [vector] ifoldl: OK
  8691. 656.28 s [vector] +++ OK, passed 100 tests.
  8692. 656.28 s [vector] ifoldl': OK
  8693. 656.28 s [vector] +++ OK, passed 100 tests.
  8694. 656.28 s [vector] ifoldr: OK
  8695. 656.28 s [vector] +++ OK, passed 100 tests.
  8696. 656.28 s [vector] ifoldr': OK
  8697. 656.28 s [vector] +++ OK, passed 100 tests.
  8698. 656.28 s [vector] ifoldM: OK
  8699. 656.28 s [vector] +++ OK, passed 100 tests.
  8700. 656.28 s [vector] ifoldM': OK
  8701. 656.29 s [vector] +++ OK, passed 100 tests.
  8702. 656.30 s [vector] ifoldM_: OK (0.01s)
  8703. 656.30 s [vector] +++ OK, passed 100 tests.
  8704. 656.30 s [vector] ifoldM'_: OK
  8705. 656.30 s [vector] +++ OK, passed 100 tests.
  8706. 656.30 s [vector] all: OK
  8707. 656.30 s [vector] +++ OK, passed 100 tests.
  8708. 656.30 s [vector] any: OK
  8709. 656.31 s [vector] +++ OK, passed 100 tests.
  8710. 656.31 s [vector] prescanl: OK
  8711. 656.31 s [vector] +++ OK, passed 100 tests.
  8712. 656.31 s [vector] prescanl': OK
  8713. 656.31 s [vector] +++ OK, passed 100 tests.
  8714. 656.31 s [vector] postscanl: OK
  8715. 656.31 s [vector] +++ OK, passed 100 tests.
  8716. 656.31 s [vector] postscanl': OK
  8717. 656.31 s [vector] +++ OK, passed 100 tests.
  8718. 656.31 s [vector] scanl: OK
  8719. 656.31 s [vector] +++ OK, passed 100 tests.
  8720. 656.31 s [vector] scanl': OK
  8721. 656.31 s [vector] +++ OK, passed 100 tests.
  8722. 656.31 s [vector] scanl1: OK
  8723. 656.31 s [vector] +++ OK, passed 100 tests.
  8724. 656.31 s [vector] scanl1': OK
  8725. 656.31 s [vector] +++ OK, passed 100 tests.
  8726. 656.31 s [vector] iscanl: OK
  8727. 656.31 s [vector] +++ OK, passed 100 tests.
  8728. 656.31 s [vector] iscanl': OK
  8729. 656.31 s [vector] +++ OK, passed 100 tests.
  8730. 656.31 s [vector] prescanr: OK
  8731. 656.32 s [vector] +++ OK, passed 100 tests.
  8732. 656.32 s [vector] prescanr': OK
  8733. 656.32 s [vector] +++ OK, passed 100 tests.
  8734. 656.32 s [vector] postscanr: OK
  8735. 656.32 s [vector] +++ OK, passed 100 tests.
  8736. 656.32 s [vector] postscanr': OK
  8737. 656.32 s [vector] +++ OK, passed 100 tests.
  8738. 656.32 s [vector] scanr: OK
  8739. 656.32 s [vector] +++ OK, passed 100 tests.
  8740. 656.32 s [vector] scanr': OK
  8741. 656.32 s [vector] +++ OK, passed 100 tests.
  8742. 656.32 s [vector] scanr1: OK
  8743. 656.32 s [vector] +++ OK, passed 100 tests.
  8744. 656.32 s [vector] scanr1': OK
  8745. 656.32 s [vector] +++ OK, passed 100 tests.
  8746. 656.32 s [vector] iscanr: OK
  8747. 656.32 s [vector] +++ OK, passed 100 tests.
  8748. 656.32 s [vector] iscanr': OK
  8749. 656.32 s [vector] +++ OK, passed 100 tests.
  8750. 656.33 s [vector] mut_read: OK
  8751. 656.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8752. 656.33 s [vector] mut_write: OK
  8753. 656.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8754. 656.33 s [vector] mut_modify: OK
  8755. 656.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8756. 656.33 s [vector] mut_generate: OK
  8757. 656.33 s [vector] +++ OK, passed 100 tests.
  8758. 656.33 s [vector] mut_generateM: OK
  8759. 656.34 s [vector] +++ OK, passed 100 tests.
  8760. 656.34 s [vector] mut_mapM_: OK
  8761. 656.35 s [vector] +++ OK, passed 100 tests.
  8762. 656.36 s [vector] mut_imapM_: OK
  8763. 656.36 s [vector] +++ OK, passed 100 tests.
  8764. 656.37 s [vector] mut_forM_: OK
  8765. 656.37 s [vector] +++ OK, passed 100 tests.
  8766. 656.37 s [vector] mut_iforM_: OK (0.01s)
  8767. 656.37 s [vector] +++ OK, passed 100 tests.
  8768. 656.37 s [vector] mut_foldr: OK
  8769. 656.37 s [vector] +++ OK, passed 100 tests.
  8770. 656.37 s [vector] mut_foldr': OK
  8771. 656.37 s [vector] +++ OK, passed 100 tests.
  8772. 656.37 s [vector] mut_foldl: OK
  8773. 656.37 s [vector] +++ OK, passed 100 tests.
  8774. 656.37 s [vector] mut_foldl': OK
  8775. 656.37 s [vector] +++ OK, passed 100 tests.
  8776. 656.37 s [vector] mut_ifoldr: OK
  8777. 656.37 s [vector] +++ OK, passed 100 tests.
  8778. 656.37 s [vector] mut_ifoldr': OK
  8779. 656.37 s [vector] +++ OK, passed 100 tests.
  8780. 656.37 s [vector] mut_ifoldl: OK
  8781. 656.37 s [vector] +++ OK, passed 100 tests.
  8782. 656.37 s [vector] mut_ifoldl': OK
  8783. 656.37 s [vector] +++ OK, passed 100 tests.
  8784. 656.38 s [vector] mut_foldM: OK
  8785. 656.38 s [vector] +++ OK, passed 100 tests.
  8786. 656.38 s [vector] mut_foldM': OK
  8787. 656.38 s [vector] +++ OK, passed 100 tests.
  8788. 656.38 s [vector] mut_foldrM: OK
  8789. 656.38 s [vector] +++ OK, passed 100 tests.
  8790. 656.38 s [vector] mut_foldrM': OK
  8791. 656.38 s [vector] +++ OK, passed 100 tests.
  8792. 656.38 s [vector] mut_ifoldM: OK
  8793. 656.38 s [vector] +++ OK, passed 100 tests.
  8794. 656.38 s [vector] mut_ifoldM': OK
  8795. 656.38 s [vector] +++ OK, passed 100 tests.
  8796. 656.38 s [vector] mut_ifoldrM: OK
  8797. 656.38 s [vector] +++ OK, passed 100 tests.
  8798. 656.38 s [vector] mut_ifoldrM': OK
  8799. 656.38 s [vector] +++ OK, passed 100 tests.
  8800. 656.38 s [vector] compare: OK
  8801. 656.38 s [vector] +++ OK, passed 100 tests.
  8802. 656.38 s [vector] maximum: OK
  8803. 656.38 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8804. 656.38 s [vector] minimum: OK
  8805. 656.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8806. 656.38 s [vector] minIndex: OK
  8807. 656.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8808. 656.38 s [vector] maxIndex: OK
  8809. 656.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8810. 656.38 s [vector] maximumBy: OK
  8811. 656.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8812. 656.38 s [vector] minimumBy: OK
  8813. 656.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8814. 656.38 s [vector] maximumOn: OK
  8815. 656.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8816. 656.39 s [vector] minimumOn: OK
  8817. 656.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8818. 656.39 s [vector] maxIndexBy: OK
  8819. 656.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8820. 656.39 s [vector] minIndexBy: OK
  8821. 656.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8822. 656.39 s [vector] ListFirstMaxIndexWins: OK
  8823. 656.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8824. 656.39 s [vector] FalseListFirstMaxIndexWins: OK
  8825. 656.39 s [vector] +++ OK, failed as expected. (after 1 test):
  8826. 656.39 s [vector] Exception:
  8827. 656.39 s [vector] Prelude.foldr1: empty list
  8828. 656.39 s [vector] CallStack (from HasCallStack):
  8829. 656.39 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  8830. 656.39 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  8831. 656.39 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8832. 656.39 s [vector] []
  8833. 656.39 s [vector] zip: OK
  8834. 656.39 s [vector] +++ OK, passed 100 tests.
  8835. 656.39 s [vector] zip3: OK
  8836. 656.39 s [vector] +++ OK, passed 100 tests.
  8837. 656.40 s [vector] unzip: OK
  8838. 656.40 s [vector] +++ OK, passed 100 tests.
  8839. 656.40 s [vector] unzip3: OK
  8840. 656.40 s [vector] +++ OK, passed 100 tests.
  8841. 656.40 s [vector] indexed: OK
  8842. 656.40 s [vector] +++ OK, passed 100 tests.
  8843. 656.40 s [vector] update: OK
  8844. 656.40 s [vector] +++ OK, passed 100 tests.
  8845. 656.40 s [vector] mempty: OK
  8846. 656.40 s [vector] +++ OK, passed 100 tests.
  8847. 656.40 s [vector] mappend: OK
  8848. 656.40 s [vector] +++ OK, passed 100 tests.
  8849. 656.40 s [vector] mconcat: OK
  8850. 656.40 s [vector] +++ OK, passed 100 tests.
  8851. 656.40 s [vector] glength: OK
  8852. 656.40 s [vector] +++ OK, passed 100 tests.
  8853. 656.40 s [vector] (Bool)
  8854. 656.40 s [vector] fromList.toList == id: OK
  8855. 656.41 s [vector] +++ OK, passed 100 tests.
  8856. 656.41 s [vector] toList.fromList == id: OK
  8857. 656.41 s [vector] +++ OK, passed 100 tests.
  8858. 656.41 s [vector] unstream.stream == id: OK
  8859. 656.41 s [vector] +++ OK, passed 100 tests.
  8860. 656.41 s [vector] stream.unstream == id: OK
  8861. 656.41 s [vector] +++ OK, passed 100 tests.
  8862. 656.41 s [vector] eq: OK
  8863. 656.41 s [vector] +++ OK, passed 100 tests.
  8864. 656.41 s [vector] length: OK
  8865. 656.41 s [vector] +++ OK, passed 100 tests.
  8866. 656.41 s [vector] null: OK
  8867. 656.41 s [vector] +++ OK, passed 100 tests.
  8868. 656.41 s [vector] index: OK
  8869. 656.41 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8870. 656.41 s [vector] safeIndex: OK
  8871. 656.41 s [vector] +++ OK, passed 100 tests.
  8872. 656.41 s [vector] head: OK
  8873. 656.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8874. 656.41 s [vector] last: OK
  8875. 656.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8876. 656.41 s [vector] unsafeIndex: OK
  8877. 656.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8878. 656.41 s [vector] unsafeHead: OK
  8879. 656.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8880. 656.41 s [vector] unsafeLast: OK
  8881. 656.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8882. 656.41 s [vector] slice: OK
  8883. 656.41 s [vector] +++ OK, passed 100 tests.
  8884. 656.41 s [vector] init: OK
  8885. 656.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8886. 656.41 s [vector] tail: OK
  8887. 656.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8888. 656.41 s [vector] take: OK
  8889. 656.41 s [vector] +++ OK, passed 100 tests.
  8890. 656.41 s [vector] drop: OK
  8891. 656.41 s [vector] +++ OK, passed 100 tests.
  8892. 656.41 s [vector] splitAt: OK
  8893. 656.41 s [vector] +++ OK, passed 100 tests.
  8894. 656.41 s [vector] empty: OK
  8895. 656.41 s [vector] +++ OK, passed 100 tests.
  8896. 656.41 s [vector] singleton: OK
  8897. 656.41 s [vector] +++ OK, passed 100 tests.
  8898. 656.41 s [vector] replicate: OK
  8899. 656.41 s [vector] +++ OK, passed 100 tests.
  8900. 656.41 s [vector] generate: OK
  8901. 656.41 s [vector] +++ OK, passed 100 tests.
  8902. 656.43 s [vector] iterateN: OK
  8903. 656.43 s [vector] +++ OK, passed 100 tests.
  8904. 656.48 s [vector] iterateNM: OK (0.06s)
  8905. 656.48 s [vector] +++ OK, passed 100 tests.
  8906. 656.48 s [vector] generateM: OK (0.01s)
  8907. 656.48 s [vector] +++ OK, passed 100 tests.
  8908. 656.50 s [vector] replicateM: OK
  8909. 656.50 s [vector] +++ OK, passed 100 tests.
  8910. 656.50 s [vector] create: OK
  8911. 656.50 s [vector] +++ OK, passed 100 tests.
  8912. 656.50 s [vector] createT: OK
  8913. 656.50 s [vector] +++ OK, passed 100 tests.
  8914. 656.50 s [vector] unfoldr: OK
  8915. 656.50 s [vector] +++ OK, passed 100 tests.
  8916. 656.50 s [vector] unfoldrN: OK
  8917. 656.50 s [vector] +++ OK, passed 100 tests.
  8918. 656.50 s [vector] unfoldrExactN: OK
  8919. 656.50 s [vector] +++ OK, passed 100 tests.
  8920. 656.51 s [vector] unfoldrM: OK
  8921. 656.51 s [vector] +++ OK, passed 100 tests.
  8922. 656.51 s [vector] unfoldrNM: OK
  8923. 656.51 s [vector] +++ OK, passed 100 tests.
  8924. 656.53 s [vector] unfoldrExactNM: OK
  8925. 656.53 s [vector] +++ OK, passed 100 tests.
  8926. 656.53 s [vector] constructN: OK
  8927. 656.53 s [vector] +++ OK, passed 100 tests.
  8928. 656.53 s [vector] constructrN: OK
  8929. 656.53 s [vector] +++ OK, passed 100 tests.
  8930. 656.54 s [vector] cons: OK
  8931. 656.54 s [vector] +++ OK, passed 100 tests.
  8932. 656.54 s [vector] snoc: OK
  8933. 656.54 s [vector] +++ OK, passed 100 tests.
  8934. 656.54 s [vector] append: OK
  8935. 656.54 s [vector] +++ OK, passed 100 tests.
  8936. 656.54 s [vector] concat: OK (0.01s)
  8937. 656.54 s [vector] +++ OK, passed 100 tests.
  8938. 656.55 s [vector] force: OK
  8939. 656.55 s [vector] +++ OK, passed 100 tests.
  8940. 656.55 s [vector] upd: OK
  8941. 656.55 s [vector] +++ OK, passed 100 tests.
  8942. 656.55 s [vector] accum: OK
  8943. 656.55 s [vector] +++ OK, passed 100 tests.
  8944. 656.55 s [vector] reverse: OK
  8945. 656.55 s [vector] +++ OK, passed 100 tests.
  8946. 656.56 s [vector] backpermute: OK
  8947. 656.56 s [vector] +++ OK, passed 100 tests.
  8948. 656.56 s [vector] map: OK
  8949. 656.56 s [vector] +++ OK, passed 100 tests.
  8950. 656.56 s [vector] imap: OK
  8951. 656.56 s [vector] +++ OK, passed 100 tests.
  8952. 656.56 s [vector] concatMap: OK
  8953. 656.56 s [vector] +++ OK, passed 100 tests.
  8954. 656.56 s [vector] mapM: OK
  8955. 656.57 s [vector] +++ OK, passed 100 tests.
  8956. 656.58 s [vector] mapM_: OK (0.01s)
  8957. 656.58 s [vector] +++ OK, passed 100 tests.
  8958. 656.58 s [vector] forM: OK
  8959. 656.59 s [vector] +++ OK, passed 100 tests.
  8960. 656.59 s [vector] forM_: OK (0.01s)
  8961. 656.59 s [vector] +++ OK, passed 100 tests.
  8962. 656.60 s [vector] imapM: OK
  8963. 656.60 s [vector] +++ OK, passed 100 tests.
  8964. 656.61 s [vector] imapM_: OK (0.01s)
  8965. 656.61 s [vector] +++ OK, passed 100 tests.
  8966. 656.61 s [vector] zipWith: OK
  8967. 656.61 s [vector] +++ OK, passed 100 tests.
  8968. 656.61 s [vector] zipWith3: OK
  8969. 656.61 s [vector] +++ OK, passed 100 tests.
  8970. 656.61 s [vector] izipWith: OK
  8971. 656.61 s [vector] +++ OK, passed 100 tests.
  8972. 656.62 s [vector] izipWith3: OK
  8973. 656.62 s [vector] +++ OK, passed 100 tests.
  8974. 656.62 s [vector] izipWithM: OK
  8975. 656.62 s [vector] +++ OK, passed 100 tests.
  8976. 656.63 s [vector] izipWithM_: OK (0.01s)
  8977. 656.63 s [vector] +++ OK, passed 100 tests.
  8978. 656.63 s [vector] zipWithM: OK
  8979. 656.63 s [vector] +++ OK, passed 100 tests.
  8980. 656.64 s [vector] zipWithM_: OK
  8981. 656.64 s [vector] +++ OK, passed 100 tests.
  8982. 656.64 s [vector] filter: OK
  8983. 656.64 s [vector] +++ OK, passed 100 tests.
  8984. 656.65 s [vector] ifilter: OK
  8985. 656.65 s [vector] +++ OK, passed 100 tests.
  8986. 656.66 s [vector] filterM: OK (0.02s)
  8987. 656.66 s [vector] +++ OK, passed 100 tests.
  8988. 656.66 s [vector] uniq: OK
  8989. 656.66 s [vector] +++ OK, passed 100 tests.
  8990. 656.66 s [vector] mapMaybe: OK
  8991. 656.66 s [vector] +++ OK, passed 100 tests.
  8992. 656.66 s [vector] imapMaybe: OK
  8993. 656.66 s [vector] +++ OK, passed 100 tests.
  8994. 656.66 s [vector] takeWhile: OK
  8995. 656.67 s [vector] +++ OK, passed 100 tests.
  8996. 656.67 s [vector] dropWhile: OK
  8997. 656.67 s [vector] +++ OK, passed 100 tests.
  8998. 656.67 s [vector] partition: OK
  8999. 656.67 s [vector] +++ OK, passed 100 tests.
  9000. 656.67 s [vector] partitionWith: OK
  9001. 656.67 s [vector] +++ OK, passed 100 tests.
  9002. 656.67 s [vector] span: OK
  9003. 656.67 s [vector] +++ OK, passed 100 tests.
  9004. 656.67 s [vector] break: OK
  9005. 656.67 s [vector] +++ OK, passed 100 tests.
  9006. 656.67 s [vector] spanR: OK
  9007. 656.67 s [vector] +++ OK, passed 100 tests.
  9008. 656.67 s [vector] breakR: OK
  9009. 656.67 s [vector] +++ OK, passed 100 tests.
  9010. 656.67 s [vector] groupBy: OK
  9011. 656.67 s [vector] +++ OK, passed 100 tests.
  9012. 656.67 s [vector] elem: OK
  9013. 656.67 s [vector] +++ OK, passed 100 tests.
  9014. 656.67 s [vector] notElem: OK
  9015. 656.67 s [vector] +++ OK, passed 100 tests.
  9016. 656.67 s [vector] find: OK
  9017. 656.67 s [vector] +++ OK, passed 100 tests.
  9018. 656.68 s [vector] findIndex: OK
  9019. 656.68 s [vector] +++ OK, passed 100 tests.
  9020. 656.68 s [vector] findIndexR: OK
  9021. 656.68 s [vector] +++ OK, passed 100 tests.
  9022. 656.68 s [vector] findIndices: OK
  9023. 656.68 s [vector] +++ OK, passed 100 tests.
  9024. 656.68 s [vector] elemIndex: OK
  9025. 656.68 s [vector] +++ OK, passed 100 tests.
  9026. 656.68 s [vector] elemIndices: OK
  9027. 656.68 s [vector] +++ OK, passed 100 tests.
  9028. 656.68 s [vector] foldl: OK
  9029. 656.68 s [vector] +++ OK, passed 100 tests.
  9030. 656.68 s [vector] foldl1: OK
  9031. 656.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9032. 656.68 s [vector] foldl': OK
  9033. 656.68 s [vector] +++ OK, passed 100 tests.
  9034. 656.68 s [vector] foldl1': OK
  9035. 656.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9036. 656.69 s [vector] foldr: OK
  9037. 656.69 s [vector] +++ OK, passed 100 tests.
  9038. 656.69 s [vector] foldr1: OK
  9039. 656.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9040. 656.69 s [vector] foldr': OK
  9041. 656.69 s [vector] +++ OK, passed 100 tests.
  9042. 656.69 s [vector] foldr1': OK
  9043. 656.69 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9044. 656.69 s [vector] ifoldl: OK
  9045. 656.69 s [vector] +++ OK, passed 100 tests.
  9046. 656.70 s [vector] ifoldl': OK
  9047. 656.70 s [vector] +++ OK, passed 100 tests.
  9048. 656.70 s [vector] ifoldr: OK
  9049. 656.71 s [vector] +++ OK, passed 100 tests.
  9050. 656.72 s [vector] ifoldr': OK (0.02s)
  9051. 656.72 s [vector] +++ OK, passed 100 tests.
  9052. 656.72 s [vector] ifoldM: OK
  9053. 656.72 s [vector] +++ OK, passed 100 tests.
  9054. 656.73 s [vector] ifoldM': OK
  9055. 656.73 s [vector] +++ OK, passed 100 tests.
  9056. 656.75 s [vector] ifoldM_: OK (0.01s)
  9057. 656.75 s [vector] +++ OK, passed 100 tests.
  9058. 656.75 s [vector] ifoldM'_: OK (0.01s)
  9059. 656.75 s [vector] +++ OK, passed 100 tests.
  9060. 656.75 s [vector] all: OK
  9061. 656.75 s [vector] +++ OK, passed 100 tests.
  9062. 656.75 s [vector] any: OK
  9063. 656.75 s [vector] +++ OK, passed 100 tests.
  9064. 656.75 s [vector] prescanl: OK
  9065. 656.75 s [vector] +++ OK, passed 100 tests.
  9066. 656.75 s [vector] prescanl': OK
  9067. 656.75 s [vector] +++ OK, passed 100 tests.
  9068. 656.75 s [vector] postscanl: OK
  9069. 656.75 s [vector] +++ OK, passed 100 tests.
  9070. 656.76 s [vector] postscanl': OK
  9071. 656.76 s [vector] +++ OK, passed 100 tests.
  9072. 656.76 s [vector] scanl: OK
  9073. 656.76 s [vector] +++ OK, passed 100 tests.
  9074. 656.76 s [vector] scanl': OK
  9075. 656.76 s [vector] +++ OK, passed 100 tests.
  9076. 656.76 s [vector] scanl1: OK
  9077. 656.76 s [vector] +++ OK, passed 100 tests.
  9078. 656.76 s [vector] scanl1': OK
  9079. 656.76 s [vector] +++ OK, passed 100 tests.
  9080. 656.76 s [vector] iscanl: OK
  9081. 656.77 s [vector] +++ OK, passed 100 tests.
  9082. 656.77 s [vector] iscanl': OK
  9083. 656.77 s [vector] +++ OK, passed 100 tests.
  9084. 656.77 s [vector] prescanr: OK
  9085. 656.77 s [vector] +++ OK, passed 100 tests.
  9086. 656.77 s [vector] prescanr': OK
  9087. 656.77 s [vector] +++ OK, passed 100 tests.
  9088. 656.78 s [vector] postscanr: OK
  9089. 656.78 s [vector] +++ OK, passed 100 tests.
  9090. 656.78 s [vector] postscanr': OK
  9091. 656.78 s [vector] +++ OK, passed 100 tests.
  9092. 656.78 s [vector] scanr: OK
  9093. 656.78 s [vector] +++ OK, passed 100 tests.
  9094. 656.78 s [vector] scanr': OK
  9095. 656.78 s [vector] +++ OK, passed 100 tests.
  9096. 656.78 s [vector] scanr1: OK
  9097. 656.78 s [vector] +++ OK, passed 100 tests.
  9098. 656.78 s [vector] scanr1': OK
  9099. 656.78 s [vector] +++ OK, passed 100 tests.
  9100. 656.78 s [vector] iscanr: OK
  9101. 656.78 s [vector] +++ OK, passed 100 tests.
  9102. 656.79 s [vector] iscanr': OK
  9103. 656.79 s [vector] +++ OK, passed 100 tests.
  9104. 656.79 s [vector] mut_read: OK
  9105. 656.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9106. 656.79 s [vector] mut_write: OK
  9107. 656.79 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9108. 656.79 s [vector] mut_modify: OK
  9109. 656.79 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9110. 656.80 s [vector] mut_generate: OK
  9111. 656.80 s [vector] +++ OK, passed 100 tests.
  9112. 656.81 s [vector] mut_generateM: OK
  9113. 656.81 s [vector] +++ OK, passed 100 tests.
  9114. 656.82 s [vector] mut_mapM_: OK (0.01s)
  9115. 656.82 s [vector] +++ OK, passed 100 tests.
  9116. 656.82 s [vector] mut_imapM_: OK (0.01s)
  9117. 656.82 s [vector] +++ OK, passed 100 tests.
  9118. 656.83 s [vector] mut_forM_: OK
  9119. 656.84 s [vector] +++ OK, passed 100 tests.
  9120. 656.84 s [vector] mut_iforM_: OK (0.01s)
  9121. 656.84 s [vector] +++ OK, passed 100 tests.
  9122. 656.84 s [vector] mut_foldr: OK
  9123. 656.84 s [vector] +++ OK, passed 100 tests.
  9124. 656.84 s [vector] mut_foldr': OK
  9125. 656.84 s [vector] +++ OK, passed 100 tests.
  9126. 656.84 s [vector] mut_foldl: OK
  9127. 656.85 s [vector] +++ OK, passed 100 tests.
  9128. 656.85 s [vector] mut_foldl': OK
  9129. 656.85 s [vector] +++ OK, passed 100 tests.
  9130. 656.85 s [vector] mut_ifoldr: OK
  9131. 656.85 s [vector] +++ OK, passed 100 tests.
  9132. 656.85 s [vector] mut_ifoldr': OK
  9133. 656.85 s [vector] +++ OK, passed 100 tests.
  9134. 656.85 s [vector] mut_ifoldl: OK
  9135. 656.85 s [vector] +++ OK, passed 100 tests.
  9136. 656.85 s [vector] mut_ifoldl': OK
  9137. 656.86 s [vector] +++ OK, passed 100 tests.
  9138. 656.86 s [vector] mut_foldM: OK
  9139. 656.86 s [vector] +++ OK, passed 100 tests.
  9140. 656.86 s [vector] mut_foldM': OK
  9141. 656.86 s [vector] +++ OK, passed 100 tests.
  9142. 656.86 s [vector] mut_foldrM: OK
  9143. 656.86 s [vector] +++ OK, passed 100 tests.
  9144. 656.86 s [vector] mut_foldrM': OK
  9145. 656.86 s [vector] +++ OK, passed 100 tests.
  9146. 656.86 s [vector] mut_ifoldM: OK
  9147. 656.86 s [vector] +++ OK, passed 100 tests.
  9148. 656.86 s [vector] mut_ifoldM': OK
  9149. 656.86 s [vector] +++ OK, passed 100 tests.
  9150. 656.87 s [vector] mut_ifoldrM: OK
  9151. 656.87 s [vector] +++ OK, passed 100 tests.
  9152. 656.87 s [vector] mut_ifoldrM': OK
  9153. 656.87 s [vector] +++ OK, passed 100 tests.
  9154. 656.87 s [vector] compare: OK
  9155. 656.87 s [vector] +++ OK, passed 100 tests.
  9156. 656.87 s [vector] maximum: OK
  9157. 656.87 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9158. 656.87 s [vector] minimum: OK
  9159. 656.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9160. 656.87 s [vector] minIndex: OK
  9161. 656.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9162. 656.87 s [vector] maxIndex: OK
  9163. 656.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9164. 656.87 s [vector] maximumBy: OK
  9165. 656.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9166. 656.87 s [vector] minimumBy: OK
  9167. 656.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9168. 656.87 s [vector] maximumOn: OK
  9169. 656.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9170. 656.87 s [vector] minimumOn: OK
  9171. 656.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9172. 656.87 s [vector] maxIndexBy: OK
  9173. 656.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9174. 656.87 s [vector] minIndexBy: OK
  9175. 656.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9176. 656.87 s [vector] ListFirstMaxIndexWins: OK
  9177. 656.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9178. 656.88 s [vector] FalseListFirstMaxIndexWins: OK
  9179. 656.88 s [vector] +++ OK, failed as expected. (after 1 test):
  9180. 656.88 s [vector] Exception:
  9181. 656.88 s [vector] Prelude.foldr1: empty list
  9182. 656.88 s [vector] CallStack (from HasCallStack):
  9183. 656.88 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9184. 656.88 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9185. 656.88 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9186. 656.88 s [vector] []
  9187. 656.88 s [vector] zip: OK
  9188. 656.88 s [vector] +++ OK, passed 100 tests.
  9189. 656.88 s [vector] zip3: OK
  9190. 656.88 s [vector] +++ OK, passed 100 tests.
  9191. 656.88 s [vector] unzip: OK
  9192. 656.88 s [vector] +++ OK, passed 100 tests.
  9193. 656.88 s [vector] unzip3: OK
  9194. 656.88 s [vector] +++ OK, passed 100 tests.
  9195. 656.88 s [vector] indexed: OK
  9196. 656.88 s [vector] +++ OK, passed 100 tests.
  9197. 656.88 s [vector] update: OK
  9198. 656.88 s [vector] +++ OK, passed 100 tests.
  9199. 656.89 s [vector] mempty: OK
  9200. 656.89 s [vector] +++ OK, passed 100 tests.
  9201. 656.89 s [vector] mappend: OK
  9202. 656.90 s [vector] +++ OK, passed 100 tests.
  9203. 656.90 s [vector] mconcat: OK (0.01s)
  9204. 656.90 s [vector] +++ OK, passed 100 tests.
  9205. 656.90 s [vector] glength: OK
  9206. 656.90 s [vector] +++ OK, passed 100 tests.
  9207. 656.90 s [vector] and: OK
  9208. 656.90 s [vector] +++ OK, passed 100 tests.
  9209. 656.90 s [vector] or: OK
  9210. 656.90 s [vector] +++ OK, passed 100 tests.
  9211. 656.90 s [vector] (Int)
  9212. 656.90 s [vector] fromList.toList == id: OK
  9213. 656.90 s [vector] +++ OK, passed 100 tests.
  9214. 656.90 s [vector] toList.fromList == id: OK
  9215. 656.90 s [vector] +++ OK, passed 100 tests.
  9216. 656.90 s [vector] unstream.stream == id: OK
  9217. 656.90 s [vector] +++ OK, passed 100 tests.
  9218. 656.90 s [vector] stream.unstream == id: OK
  9219. 656.90 s [vector] +++ OK, passed 100 tests.
  9220. 656.90 s [vector] eq: OK
  9221. 656.90 s [vector] +++ OK, passed 100 tests.
  9222. 656.90 s [vector] length: OK
  9223. 656.90 s [vector] +++ OK, passed 100 tests.
  9224. 656.90 s [vector] null: OK
  9225. 656.91 s [vector] +++ OK, passed 100 tests.
  9226. 656.91 s [vector] index: OK
  9227. 656.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9228. 656.91 s [vector] safeIndex: OK
  9229. 656.91 s [vector] +++ OK, passed 100 tests.
  9230. 656.91 s [vector] head: OK
  9231. 656.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9232. 656.91 s [vector] last: OK
  9233. 656.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9234. 656.91 s [vector] unsafeIndex: OK
  9235. 656.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9236. 656.91 s [vector] unsafeHead: OK
  9237. 656.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9238. 656.91 s [vector] unsafeLast: OK
  9239. 656.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9240. 656.91 s [vector] slice: OK
  9241. 656.91 s [vector] +++ OK, passed 100 tests.
  9242. 656.91 s [vector] init: OK
  9243. 656.91 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9244. 656.91 s [vector] tail: OK
  9245. 656.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9246. 656.91 s [vector] take: OK
  9247. 656.91 s [vector] +++ OK, passed 100 tests.
  9248. 656.91 s [vector] drop: OK
  9249. 656.91 s [vector] +++ OK, passed 100 tests.
  9250. 656.91 s [vector] splitAt: OK
  9251. 656.91 s [vector] +++ OK, passed 100 tests.
  9252. 656.91 s [vector] empty: OK
  9253. 656.91 s [vector] +++ OK, passed 100 tests.
  9254. 656.91 s [vector] singleton: OK
  9255. 656.91 s [vector] +++ OK, passed 100 tests.
  9256. 656.91 s [vector] replicate: OK
  9257. 656.91 s [vector] +++ OK, passed 100 tests.
  9258. 656.91 s [vector] generate: OK
  9259. 656.91 s [vector] +++ OK, passed 100 tests.
  9260. 656.92 s [vector] iterateN: OK
  9261. 656.93 s [vector] +++ OK, passed 100 tests.
  9262. 656.97 s [vector] iterateNM: OK (0.05s)
  9263. 656.97 s [vector] +++ OK, passed 100 tests.
  9264. 656.99 s [vector] generateM: OK (0.01s)
  9265. 656.99 s [vector] +++ OK, passed 100 tests.
  9266. 656.99 s [vector] replicateM: OK (0.01s)
  9267. 656.99 s [vector] +++ OK, passed 100 tests.
  9268. 656.99 s [vector] create: OK
  9269. 657.00 s [vector] +++ OK, passed 100 tests.
  9270. 657.00 s [vector] createT: OK
  9271. 657.00 s [vector] +++ OK, passed 100 tests.
  9272. 657.00 s [vector] unfoldr: OK
  9273. 657.00 s [vector] +++ OK, passed 100 tests.
  9274. 657.00 s [vector] unfoldrN: OK
  9275. 657.00 s [vector] +++ OK, passed 100 tests.
  9276. 657.00 s [vector] unfoldrExactN: OK
  9277. 657.00 s [vector] +++ OK, passed 100 tests.
  9278. 657.00 s [vector] unfoldrM: OK
  9279. 657.00 s [vector] +++ OK, passed 100 tests.
  9280. 657.00 s [vector] unfoldrNM: OK
  9281. 657.01 s [vector] +++ OK, passed 100 tests.
  9282. 657.05 s [vector] unfoldrExactNM: OK (0.05s)
  9283. 657.06 s [vector] +++ OK, passed 100 tests.
  9284. 657.06 s [vector] constructN: OK
  9285. 657.06 s [vector] +++ OK, passed 100 tests.
  9286. 657.06 s [vector] constructrN: OK
  9287. 657.06 s [vector] +++ OK, passed 100 tests.
  9288. 657.06 s [vector] cons: OK
  9289. 657.06 s [vector] +++ OK, passed 100 tests.
  9290. 657.06 s [vector] snoc: OK
  9291. 657.06 s [vector] +++ OK, passed 100 tests.
  9292. 657.07 s [vector] append: OK
  9293. 657.07 s [vector] +++ OK, passed 100 tests.
  9294. 657.07 s [vector] concat: OK (0.01s)
  9295. 657.08 s [vector] +++ OK, passed 100 tests.
  9296. 657.08 s [vector] force: OK
  9297. 657.08 s [vector] +++ OK, passed 100 tests.
  9298. 657.08 s [vector] upd: OK
  9299. 657.08 s [vector] +++ OK, passed 100 tests.
  9300. 657.08 s [vector] accum: OK
  9301. 657.08 s [vector] +++ OK, passed 100 tests.
  9302. 657.08 s [vector] reverse: OK
  9303. 657.08 s [vector] +++ OK, passed 100 tests.
  9304. 657.09 s [vector] backpermute: OK
  9305. 657.09 s [vector] +++ OK, passed 100 tests.
  9306. 657.09 s [vector] map: OK
  9307. 657.09 s [vector] +++ OK, passed 100 tests.
  9308. 657.09 s [vector] imap: OK
  9309. 657.09 s [vector] +++ OK, passed 100 tests.
  9310. 657.09 s [vector] concatMap: OK
  9311. 657.09 s [vector] +++ OK, passed 100 tests.
  9312. 657.09 s [vector] mapM: OK
  9313. 657.11 s [vector] +++ OK, passed 100 tests.
  9314. 657.12 s [vector] mapM_: OK (0.02s)
  9315. 657.12 s [vector] +++ OK, passed 100 tests.
  9316. 657.12 s [vector] forM: OK
  9317. 657.13 s [vector] +++ OK, passed 100 tests.
  9318. 657.13 s [vector] forM_: OK (0.02s)
  9319. 657.13 s [vector] +++ OK, passed 100 tests.
  9320. 657.15 s [vector] imapM: OK
  9321. 657.15 s [vector] +++ OK, passed 100 tests.
  9322. 657.16 s [vector] imapM_: OK (0.02s)
  9323. 657.16 s [vector] +++ OK, passed 100 tests.
  9324. 657.16 s [vector] zipWith: OK
  9325. 657.16 s [vector] +++ OK, passed 100 tests.
  9326. 657.16 s [vector] zipWith3: OK
  9327. 657.16 s [vector] +++ OK, passed 100 tests.
  9328. 657.16 s [vector] izipWith: OK
  9329. 657.16 s [vector] +++ OK, passed 100 tests.
  9330. 657.17 s [vector] izipWith3: OK
  9331. 657.17 s [vector] +++ OK, passed 100 tests.
  9332. 657.17 s [vector] izipWithM: OK
  9333. 657.17 s [vector] +++ OK, passed 100 tests.
  9334. 657.18 s [vector] izipWithM_: OK
  9335. 657.18 s [vector] +++ OK, passed 100 tests.
  9336. 657.18 s [vector] zipWithM: OK
  9337. 657.18 s [vector] +++ OK, passed 100 tests.
  9338. 657.19 s [vector] zipWithM_: OK (0.01s)
  9339. 657.19 s [vector] +++ OK, passed 100 tests.
  9340. 657.20 s [vector] filter: OK
  9341. 657.20 s [vector] +++ OK, passed 100 tests.
  9342. 657.20 s [vector] ifilter: OK
  9343. 657.21 s [vector] +++ OK, passed 100 tests.
  9344. 657.23 s [vector] filterM: OK (0.03s)
  9345. 657.23 s [vector] +++ OK, passed 100 tests.
  9346. 657.23 s [vector] uniq: OK
  9347. 657.23 s [vector] +++ OK, passed 100 tests.
  9348. 657.23 s [vector] mapMaybe: OK
  9349. 657.23 s [vector] +++ OK, passed 100 tests.
  9350. 657.23 s [vector] imapMaybe: OK
  9351. 657.23 s [vector] +++ OK, passed 100 tests.
  9352. 657.23 s [vector] takeWhile: OK
  9353. 657.24 s [vector] +++ OK, passed 100 tests.
  9354. 657.24 s [vector] dropWhile: OK
  9355. 657.24 s [vector] +++ OK, passed 100 tests.
  9356. 657.24 s [vector] partition: OK
  9357. 657.24 s [vector] +++ OK, passed 100 tests.
  9358. 657.24 s [vector] partitionWith: OK
  9359. 657.24 s [vector] +++ OK, passed 100 tests.
  9360. 657.24 s [vector] span: OK
  9361. 657.24 s [vector] +++ OK, passed 100 tests.
  9362. 657.24 s [vector] break: OK
  9363. 657.24 s [vector] +++ OK, passed 100 tests.
  9364. 657.24 s [vector] spanR: OK
  9365. 657.24 s [vector] +++ OK, passed 100 tests.
  9366. 657.24 s [vector] breakR: OK
  9367. 657.24 s [vector] +++ OK, passed 100 tests.
  9368. 657.24 s [vector] groupBy: OK
  9369. 657.24 s [vector] +++ OK, passed 100 tests.
  9370. 657.24 s [vector] elem: OK
  9371. 657.24 s [vector] +++ OK, passed 100 tests.
  9372. 657.25 s [vector] notElem: OK
  9373. 657.25 s [vector] +++ OK, passed 100 tests.
  9374. 657.25 s [vector] find: OK
  9375. 657.25 s [vector] +++ OK, passed 100 tests.
  9376. 657.26 s [vector] findIndex: OK
  9377. 657.26 s [vector] +++ OK, passed 100 tests.
  9378. 657.26 s [vector] findIndexR: OK
  9379. 657.26 s [vector] +++ OK, passed 100 tests.
  9380. 657.26 s [vector] findIndices: OK
  9381. 657.27 s [vector] +++ OK, passed 100 tests.
  9382. 657.27 s [vector] elemIndex: OK
  9383. 657.27 s [vector] +++ OK, passed 100 tests.
  9384. 657.28 s [vector] elemIndices: OK
  9385. 657.28 s [vector] +++ OK, passed 100 tests.
  9386. 657.29 s [vector] foldl: OK
  9387. 657.29 s [vector] +++ OK, passed 100 tests.
  9388. 657.29 s [vector] foldl1: OK
  9389. 657.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9390. 657.30 s [vector] foldl': OK
  9391. 657.31 s [vector] +++ OK, passed 100 tests.
  9392. 657.32 s [vector] foldl1': OK
  9393. 657.32 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9394. 657.33 s [vector] foldr: OK
  9395. 657.33 s [vector] +++ OK, passed 100 tests.
  9396. 657.33 s [vector] foldr1: OK
  9397. 657.33 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9398. 657.34 s [vector] foldr': OK
  9399. 657.34 s [vector] +++ OK, passed 100 tests.
  9400. 657.34 s [vector] foldr1': OK
  9401. 657.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9402. 657.36 s [vector] ifoldl: OK (0.01s)
  9403. 657.36 s [vector] +++ OK, passed 100 tests.
  9404. 657.37 s [vector] ifoldl': OK (0.01s)
  9405. 657.37 s [vector] +++ OK, passed 100 tests.
  9406. 657.38 s [vector] ifoldr: OK (0.01s)
  9407. 657.38 s [vector] +++ OK, passed 100 tests.
  9408. 657.38 s [vector] ifoldr': OK
  9409. 657.38 s [vector] +++ OK, passed 100 tests.
  9410. 657.39 s [vector] ifoldM: OK
  9411. 657.40 s [vector] +++ OK, passed 100 tests.
  9412. 657.40 s [vector] ifoldM': OK
  9413. 657.41 s [vector] +++ OK, passed 100 tests.
  9414. 657.43 s [vector] ifoldM_: OK (0.02s)
  9415. 657.43 s [vector] +++ OK, passed 100 tests.
  9416. 657.45 s [vector] ifoldM'_: OK (0.02s)
  9417. 657.45 s [vector] +++ OK, passed 100 tests.
  9418. 657.45 s [vector] all: OK
  9419. 657.45 s [vector] +++ OK, passed 100 tests.
  9420. 657.45 s [vector] any: OK
  9421. 657.45 s [vector] +++ OK, passed 100 tests.
  9422. 657.45 s [vector] prescanl: OK
  9423. 657.45 s [vector] +++ OK, passed 100 tests.
  9424. 657.45 s [vector] prescanl': OK
  9425. 657.46 s [vector] +++ OK, passed 100 tests.
  9426. 657.46 s [vector] postscanl: OK
  9427. 657.46 s [vector] +++ OK, passed 100 tests.
  9428. 657.46 s [vector] postscanl': OK
  9429. 657.46 s [vector] +++ OK, passed 100 tests.
  9430. 657.46 s [vector] scanl: OK
  9431. 657.46 s [vector] +++ OK, passed 100 tests.
  9432. 657.47 s [vector] scanl': OK
  9433. 657.47 s [vector] +++ OK, passed 100 tests.
  9434. 657.47 s [vector] scanl1: OK
  9435. 657.47 s [vector] +++ OK, passed 100 tests.
  9436. 657.47 s [vector] scanl1': OK
  9437. 657.47 s [vector] +++ OK, passed 100 tests.
  9438. 657.48 s [vector] iscanl: OK
  9439. 657.48 s [vector] +++ OK, passed 100 tests.
  9440. 657.48 s [vector] iscanl': OK
  9441. 657.48 s [vector] +++ OK, passed 100 tests.
  9442. 657.48 s [vector] prescanr: OK
  9443. 657.48 s [vector] +++ OK, passed 100 tests.
  9444. 657.49 s [vector] prescanr': OK
  9445. 657.49 s [vector] +++ OK, passed 100 tests.
  9446. 657.49 s [vector] postscanr: OK
  9447. 657.49 s [vector] +++ OK, passed 100 tests.
  9448. 657.49 s [vector] postscanr': OK
  9449. 657.49 s [vector] +++ OK, passed 100 tests.
  9450. 657.49 s [vector] scanr: OK
  9451. 657.49 s [vector] +++ OK, passed 100 tests.
  9452. 657.49 s [vector] scanr': OK
  9453. 657.50 s [vector] +++ OK, passed 100 tests.
  9454. 657.50 s [vector] scanr1: OK
  9455. 657.50 s [vector] +++ OK, passed 100 tests.
  9456. 657.50 s [vector] scanr1': OK
  9457. 657.51 s [vector] +++ OK, passed 100 tests.
  9458. 657.51 s [vector] iscanr: OK
  9459. 657.51 s [vector] +++ OK, passed 100 tests.
  9460. 657.51 s [vector] iscanr': OK
  9461. 657.51 s [vector] +++ OK, passed 100 tests.
  9462. 657.51 s [vector] mut_read: OK
  9463. 657.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9464. 657.52 s [vector] mut_write: OK
  9465. 657.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9466. 657.52 s [vector] mut_modify: OK
  9467. 657.52 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9468. 657.52 s [vector] mut_generate: OK
  9469. 657.52 s [vector] +++ OK, passed 100 tests.
  9470. 657.53 s [vector] mut_generateM: OK (0.01s)
  9471. 657.53 s [vector] +++ OK, passed 100 tests.
  9472. 657.55 s [vector] mut_mapM_: OK (0.02s)
  9473. 657.55 s [vector] +++ OK, passed 100 tests.
  9474. 657.57 s [vector] mut_imapM_: OK (0.02s)
  9475. 657.57 s [vector] +++ OK, passed 100 tests.
  9476. 657.59 s [vector] mut_forM_: OK (0.02s)
  9477. 657.59 s [vector] +++ OK, passed 100 tests.
  9478. 657.60 s [vector] mut_iforM_: OK (0.02s)
  9479. 657.60 s [vector] +++ OK, passed 100 tests.
  9480. 657.60 s [vector] mut_foldr: OK
  9481. 657.60 s [vector] +++ OK, passed 100 tests.
  9482. 657.60 s [vector] mut_foldr': OK
  9483. 657.60 s [vector] +++ OK, passed 100 tests.
  9484. 657.60 s [vector] mut_foldl: OK
  9485. 657.60 s [vector] +++ OK, passed 100 tests.
  9486. 657.61 s [vector] mut_foldl': OK
  9487. 657.61 s [vector] +++ OK, passed 100 tests.
  9488. 657.61 s [vector] mut_ifoldr: OK
  9489. 657.61 s [vector] +++ OK, passed 100 tests.
  9490. 657.62 s [vector] mut_ifoldr': OK
  9491. 657.62 s [vector] +++ OK, passed 100 tests.
  9492. 657.62 s [vector] mut_ifoldl: OK
  9493. 657.62 s [vector] +++ OK, passed 100 tests.
  9494. 657.62 s [vector] mut_ifoldl': OK
  9495. 657.62 s [vector] +++ OK, passed 100 tests.
  9496. 657.62 s [vector] mut_foldM: OK
  9497. 657.62 s [vector] +++ OK, passed 100 tests.
  9498. 657.63 s [vector] mut_foldM': OK
  9499. 657.63 s [vector] +++ OK, passed 100 tests.
  9500. 657.63 s [vector] mut_foldrM: OK
  9501. 657.63 s [vector] +++ OK, passed 100 tests.
  9502. 657.65 s [vector] mut_foldrM': OK
  9503. 657.65 s [vector] +++ OK, passed 100 tests.
  9504. 657.66 s [vector] mut_ifoldM: OK (0.02s)
  9505. 657.66 s [vector] +++ OK, passed 100 tests.
  9506. 657.66 s [vector] mut_ifoldM': OK
  9507. 657.66 s [vector] +++ OK, passed 100 tests.
  9508. 657.67 s [vector] mut_ifoldrM: OK
  9509. 657.67 s [vector] +++ OK, passed 100 tests.
  9510. 657.67 s [vector] mut_ifoldrM': OK
  9511. 657.67 s [vector] +++ OK, passed 100 tests.
  9512. 657.67 s [vector] compare: OK
  9513. 657.67 s [vector] +++ OK, passed 100 tests.
  9514. 657.67 s [vector] maximum: OK
  9515. 657.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9516. 657.67 s [vector] minimum: OK
  9517. 657.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9518. 657.67 s [vector] minIndex: OK
  9519. 657.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9520. 657.67 s [vector] maxIndex: OK
  9521. 657.67 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9522. 657.67 s [vector] maximumBy: OK
  9523. 657.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9524. 657.67 s [vector] minimumBy: OK
  9525. 657.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9526. 657.67 s [vector] maximumOn: OK
  9527. 657.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9528. 657.67 s [vector] minimumOn: OK
  9529. 657.67 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9530. 657.67 s [vector] maxIndexBy: OK
  9531. 657.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9532. 657.68 s [vector] minIndexBy: OK
  9533. 657.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9534. 657.68 s [vector] ListFirstMaxIndexWins: OK
  9535. 657.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9536. 657.68 s [vector] FalseListFirstMaxIndexWins: OK
  9537. 657.68 s [vector] +++ OK, failed as expected. (after 1 test):
  9538. 657.68 s [vector] Exception:
  9539. 657.68 s [vector] Prelude.foldr1: empty list
  9540. 657.68 s [vector] CallStack (from HasCallStack):
  9541. 657.68 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9542. 657.68 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9543. 657.68 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9544. 657.68 s [vector] []
  9545. 657.68 s [vector] zip: OK
  9546. 657.68 s [vector] +++ OK, passed 100 tests.
  9547. 657.68 s [vector] zip3: OK
  9548. 657.68 s [vector] +++ OK, passed 100 tests.
  9549. 657.68 s [vector] unzip: OK
  9550. 657.68 s [vector] +++ OK, passed 100 tests.
  9551. 657.69 s [vector] unzip3: OK
  9552. 657.69 s [vector] +++ OK, passed 100 tests.
  9553. 657.69 s [vector] indexed: OK
  9554. 657.69 s [vector] +++ OK, passed 100 tests.
  9555. 657.69 s [vector] update: OK
  9556. 657.69 s [vector] +++ OK, passed 100 tests.
  9557. 657.69 s [vector] mempty: OK
  9558. 657.69 s [vector] +++ OK, passed 100 tests.
  9559. 657.69 s [vector] mappend: OK
  9560. 657.69 s [vector] +++ OK, passed 100 tests.
  9561. 657.71 s [vector] mconcat: OK (0.02s)
  9562. 657.71 s [vector] +++ OK, passed 100 tests.
  9563. 657.71 s [vector] glength: OK
  9564. 657.71 s [vector] +++ OK, passed 100 tests.
  9565. 657.71 s [vector] sum: OK
  9566. 657.71 s [vector] +++ OK, passed 100 tests.
  9567. 657.71 s [vector] product: OK
  9568. 657.71 s [vector] +++ OK, passed 100 tests.
  9569. 657.71 s [vector] enumFromN: OK
  9570. 657.71 s [vector] +++ OK, passed 100 tests.
  9571. 657.71 s [vector] enumFromThenN: OK
  9572. 657.71 s [vector] +++ OK, passed 100 tests.
  9573. 657.71 s [vector] enumFromTo: OK
  9574. 657.71 s [vector] +++ OK, passed 100 tests.
  9575. 657.71 s [vector] enumFromThenTo: OK
  9576. 657.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9577. 657.71 s [vector] (Float)
  9578. 657.72 s [vector] fromList.toList == id: OK
  9579. 657.72 s [vector] +++ OK, passed 100 tests.
  9580. 657.72 s [vector] toList.fromList == id: OK
  9581. 657.72 s [vector] +++ OK, passed 100 tests.
  9582. 657.72 s [vector] unstream.stream == id: OK
  9583. 657.72 s [vector] +++ OK, passed 100 tests.
  9584. 657.72 s [vector] stream.unstream == id: OK
  9585. 657.72 s [vector] +++ OK, passed 100 tests.
  9586. 657.72 s [vector] eq: OK
  9587. 657.72 s [vector] +++ OK, passed 100 tests.
  9588. 657.72 s [vector] length: OK
  9589. 657.72 s [vector] +++ OK, passed 100 tests.
  9590. 657.72 s [vector] null: OK
  9591. 657.72 s [vector] +++ OK, passed 100 tests.
  9592. 657.72 s [vector] index: OK
  9593. 657.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9594. 657.72 s [vector] safeIndex: OK
  9595. 657.72 s [vector] +++ OK, passed 100 tests.
  9596. 657.72 s [vector] head: OK
  9597. 657.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9598. 657.73 s [vector] last: OK
  9599. 657.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9600. 657.73 s [vector] unsafeIndex: OK
  9601. 657.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9602. 657.73 s [vector] unsafeHead: OK
  9603. 657.73 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9604. 657.73 s [vector] unsafeLast: OK
  9605. 657.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9606. 657.73 s [vector] slice: OK
  9607. 657.73 s [vector] +++ OK, passed 100 tests.
  9608. 657.73 s [vector] init: OK
  9609. 657.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9610. 657.73 s [vector] tail: OK
  9611. 657.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9612. 657.73 s [vector] take: OK
  9613. 657.73 s [vector] +++ OK, passed 100 tests.
  9614. 657.73 s [vector] drop: OK
  9615. 657.73 s [vector] +++ OK, passed 100 tests.
  9616. 657.73 s [vector] splitAt: OK
  9617. 657.73 s [vector] +++ OK, passed 100 tests.
  9618. 657.73 s [vector] empty: OK
  9619. 657.73 s [vector] +++ OK, passed 100 tests.
  9620. 657.73 s [vector] singleton: OK
  9621. 657.73 s [vector] +++ OK, passed 100 tests.
  9622. 657.73 s [vector] replicate: OK
  9623. 657.73 s [vector] +++ OK, passed 100 tests.
  9624. 657.74 s [vector] generate: OK
  9625. 657.74 s [vector] +++ OK, passed 100 tests.
  9626. 657.74 s [vector] iterateN: OK
  9627. 657.75 s [vector] +++ OK, passed 100 tests.
  9628. 657.81 s [vector] iterateNM: OK (0.06s)
  9629. 657.81 s [vector] +++ OK, passed 100 tests.
  9630. 657.85 s [vector] generateM: OK (0.04s)
  9631. 657.85 s [vector] +++ OK, passed 100 tests.
  9632. 657.85 s [vector] replicateM: OK (0.01s)
  9633. 657.85 s [vector] +++ OK, passed 100 tests.
  9634. 657.85 s [vector] create: OK
  9635. 657.85 s [vector] +++ OK, passed 100 tests.
  9636. 657.85 s [vector] createT: OK
  9637. 657.85 s [vector] +++ OK, passed 100 tests.
  9638. 657.85 s [vector] unfoldr: OK
  9639. 657.85 s [vector] +++ OK, passed 100 tests.
  9640. 657.85 s [vector] unfoldrN: OK
  9641. 657.85 s [vector] +++ OK, passed 100 tests.
  9642. 657.86 s [vector] unfoldrExactN: OK
  9643. 657.86 s [vector] +++ OK, passed 100 tests.
  9644. 657.86 s [vector] unfoldrM: OK
  9645. 657.86 s [vector] +++ OK, passed 100 tests.
  9646. 657.87 s [vector] unfoldrNM: OK
  9647. 657.87 s [vector] +++ OK, passed 100 tests.
  9648. 657.93 s [vector] unfoldrExactNM: OK (0.07s)
  9649. 657.93 s [vector] +++ OK, passed 100 tests.
  9650. 657.93 s [vector] constructN: OK
  9651. 657.95 s [vector] +++ OK, passed 100 tests.
  9652. 657.95 s [vector] constructrN: OK (0.01s)
  9653. 658.47 s [vector] +++ OK, passed 100 tests.
  9654. 658.47 s [vector] cons: OK
  9655. 658.47 s [vector] +++ OK, passed 100 tests.
  9656. 658.47 s [vector] snoc: OK
  9657. 658.47 s [vector] +++ OK, passed 100 tests.
  9658. 658.47 s [vector] append: OK
  9659. 658.47 s [vector] +++ OK, passed 100 tests.
  9660. 658.47 s [vector] concat: OK (0.03s)
  9661. 658.47 s [vector] +++ OK, passed 100 tests.
  9662. 658.47 s [vector] force: OK
  9663. 658.47 s [vector] +++ OK, passed 100 tests.
  9664. 658.47 s [vector] upd: OK
  9665. 658.47 s [vector] +++ OK, passed 100 tests.
  9666. 658.47 s [vector] accum: OK (0.01s)
  9667. 658.47 s [vector] +++ OK, passed 100 tests.
  9668. 658.47 s [vector] reverse: OK
  9669. 658.47 s [vector] +++ OK, passed 100 tests.
  9670. 658.47 s [vector] backpermute: OK
  9671. 658.47 s [vector] +++ OK, passed 100 tests.
  9672. 658.47 s [vector] map: OK
  9673. 658.47 s [vector] +++ OK, passed 100 tests.
  9674. 658.47 s [vector] imap: OK
  9675. 658.47 s [vector] +++ OK, passed 100 tests.
  9676. 658.47 s [vector] concatMap: OK
  9677. 658.47 s [vector] +++ OK, passed 100 tests.
  9678. 658.48 s [vector] mapM: OK
  9679. 658.48 s [vector] +++ OK, passed 100 tests.
  9680. 658.48 s [vector] mapM_: OK (0.04s)
  9681. 658.48 s [vector] +++ OK, passed 100 tests.
  9682. 658.48 s [vector] forM: OK
  9683. 658.48 s [vector] +++ OK, passed 100 tests.
  9684. 658.48 s [vector] forM_: OK (0.04s)
  9685. 658.48 s [vector] +++ OK, passed 100 tests.
  9686. 658.48 s [vector] imapM: OK
  9687. 658.48 s [vector] +++ OK, passed 100 tests.
  9688. 658.48 s [vector] imapM_: OK (0.02s)
  9689. 658.48 s [vector] +++ OK, passed 100 tests.
  9690. 658.48 s [vector] zipWith: OK
  9691. 658.48 s [vector] +++ OK, passed 100 tests.
  9692. 658.48 s [vector] zipWith3: OK
  9693. 658.48 s [vector] +++ OK, passed 100 tests.
  9694. 658.48 s [vector] izipWith: OK
  9695. 658.48 s [vector] +++ OK, passed 100 tests.
  9696. 658.48 s [vector] izipWith3: OK
  9697. 658.48 s [vector] +++ OK, passed 100 tests.
  9698. 658.48 s [vector] izipWithM: OK
  9699. 658.48 s [vector] +++ OK, passed 100 tests.
  9700. 658.48 s [vector] izipWithM_: OK (0.02s)
  9701. 658.48 s [vector] +++ OK, passed 100 tests.
  9702. 658.48 s [vector] zipWithM: OK (0.01s)
  9703. 658.48 s [vector] +++ OK, passed 100 tests.
  9704. 658.48 s [vector] zipWithM_: OK (0.03s)
  9705. 658.48 s [vector] +++ OK, passed 100 tests.
  9706. 658.48 s [vector] filter: OK
  9707. 658.48 s [vector] +++ OK, passed 100 tests.
  9708. 658.48 s [vector] ifilter: OK
  9709. 658.48 s [vector] +++ OK, passed 100 tests.
  9710. 658.48 s [vector] filterM: OK (0.05s)
  9711. 658.48 s [vector] +++ OK, passed 100 tests.
  9712. 658.48 s [vector] uniq: OK
  9713. 658.48 s [vector] +++ OK, passed 100 tests.
  9714. 658.48 s [vector] mapMaybe: OK
  9715. 658.48 s [vector] +++ OK, passed 100 tests.
  9716. 658.48 s [vector] imapMaybe: OK
  9717. 658.49 s [vector] +++ OK, passed 100 tests.
  9718. 658.49 s [vector] takeWhile: OK
  9719. 658.49 s [vector] +++ OK, passed 100 tests.
  9720. 658.49 s [vector] dropWhile: OK
  9721. 658.49 s [vector] +++ OK, passed 100 tests.
  9722. 658.49 s [vector] partition: OK
  9723. 658.49 s [vector] +++ OK, passed 100 tests.
  9724. 658.49 s [vector] partitionWith: OK
  9725. 658.49 s [vector] +++ OK, passed 100 tests.
  9726. 658.49 s [vector] span: OK
  9727. 658.49 s [vector] +++ OK, passed 100 tests.
  9728. 658.49 s [vector] break: OK
  9729. 658.49 s [vector] +++ OK, passed 100 tests.
  9730. 658.49 s [vector] spanR: OK
  9731. 658.49 s [vector] +++ OK, passed 100 tests.
  9732. 658.49 s [vector] breakR: OK
  9733. 658.49 s [vector] +++ OK, passed 100 tests.
  9734. 658.49 s [vector] groupBy: OK
  9735. 658.49 s [vector] +++ OK, passed 100 tests.
  9736. 658.49 s [vector] elem: OK
  9737. 658.49 s [vector] +++ OK, passed 100 tests.
  9738. 658.49 s [vector] notElem: OK
  9739. 658.49 s [vector] +++ OK, passed 100 tests.
  9740. 658.49 s [vector] find: OK
  9741. 658.49 s [vector] +++ OK, passed 100 tests.
  9742. 658.49 s [vector] findIndex: OK
  9743. 658.49 s [vector] +++ OK, passed 100 tests.
  9744. 658.49 s [vector] findIndexR: OK
  9745. 658.49 s [vector] +++ OK, passed 100 tests.
  9746. 658.49 s [vector] findIndices: OK
  9747. 658.49 s [vector] +++ OK, passed 100 tests.
  9748. 658.49 s [vector] elemIndex: OK
  9749. 658.49 s [vector] +++ OK, passed 100 tests.
  9750. 658.49 s [vector] elemIndices: OK
  9751. 658.49 s [vector] +++ OK, passed 100 tests.
  9752. 658.49 s [vector] foldl: OK
  9753. 658.49 s [vector] +++ OK, passed 100 tests.
  9754. 658.49 s [vector] foldl1: OK
  9755. 658.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9756. 658.49 s [vector] foldl': OK
  9757. 658.49 s [vector] +++ OK, passed 100 tests.
  9758. 658.49 s [vector] foldl1': OK
  9759. 658.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9760. 658.49 s [vector] foldr: OK
  9761. 658.49 s [vector] +++ OK, passed 100 tests.
  9762. 658.49 s [vector] foldr1: OK (0.01s)
  9763. 658.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9764. 658.49 s [vector] foldr': OK
  9765. 658.49 s [vector] +++ OK, passed 100 tests.
  9766. 658.49 s [vector] foldr1': OK
  9767. 658.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9768. 658.49 s [vector] ifoldl: OK (0.01s)
  9769. 658.49 s [vector] +++ OK, passed 100 tests.
  9770. 658.49 s [vector] ifoldl': OK
  9771. 658.49 s [vector] +++ OK, passed 100 tests.
  9772. 658.49 s [vector] ifoldr: OK (0.01s)
  9773. 658.49 s [vector] +++ OK, passed 100 tests.
  9774. 658.49 s [vector] ifoldr': OK
  9775. 658.49 s [vector] +++ OK, passed 100 tests.
  9776. 658.51 s [vector] ifoldM: OK (0.01s)
  9777. 658.51 s [vector] +++ OK, passed 100 tests.
  9778. 658.51 s [vector] ifoldM': OK (0.01s)
  9779. 658.51 s [vector] +++ OK, passed 100 tests.
  9780. 658.55 s [vector] ifoldM_: OK (0.04s)
  9781. 658.55 s [vector] +++ OK, passed 100 tests.
  9782. 658.60 s [vector] ifoldM'_: OK (0.03s)
  9783. 658.60 s [vector] +++ OK, passed 100 tests.
  9784. 658.60 s [vector] all: OK
  9785. 658.60 s [vector] +++ OK, passed 100 tests.
  9786. 658.60 s [vector] any: OK
  9787. 658.60 s [vector] +++ OK, passed 100 tests.
  9788. 658.62 s [vector] prescanl: OK
  9789. 658.62 s [vector] +++ OK, passed 100 tests.
  9790. 658.63 s [vector] prescanl': OK
  9791. 658.63 s [vector] +++ OK, passed 100 tests.
  9792. 658.63 s [vector] postscanl: OK
  9793. 658.64 s [vector] +++ OK, passed 100 tests.
  9794. 658.65 s [vector] postscanl': OK (0.01s)
  9795. 658.65 s [vector] +++ OK, passed 100 tests.
  9796. 658.65 s [vector] scanl: OK
  9797. 658.66 s [vector] +++ OK, passed 100 tests.
  9798. 658.67 s [vector] scanl': OK (0.01s)
  9799. 658.67 s [vector] +++ OK, passed 100 tests.
  9800. 658.67 s [vector] scanl1: OK
  9801. 658.67 s [vector] +++ OK, passed 100 tests.
  9802. 658.69 s [vector] scanl1': OK
  9803. 658.69 s [vector] +++ OK, passed 100 tests.
  9804. 658.70 s [vector] iscanl: OK
  9805. 658.70 s [vector] +++ OK, passed 100 tests.
  9806. 658.70 s [vector] iscanl': OK
  9807. 658.71 s [vector] +++ OK, passed 100 tests.
  9808. 658.71 s [vector] prescanr: OK
  9809. 658.71 s [vector] +++ OK, passed 100 tests.
  9810. 658.73 s [vector] prescanr': OK (0.01s)
  9811. 658.73 s [vector] +++ OK, passed 100 tests.
  9812. 658.73 s [vector] postscanr: OK
  9813. 658.74 s [vector] +++ OK, passed 100 tests.
  9814. 658.75 s [vector] postscanr': OK (0.01s)
  9815. 658.75 s [vector] +++ OK, passed 100 tests.
  9816. 658.76 s [vector] scanr: OK
  9817. 658.76 s [vector] +++ OK, passed 100 tests.
  9818. 658.77 s [vector] scanr': OK
  9819. 658.77 s [vector] +++ OK, passed 100 tests.
  9820. 658.78 s [vector] scanr1: OK
  9821. 658.78 s [vector] +++ OK, passed 100 tests.
  9822. 658.79 s [vector] scanr1': OK (0.01s)
  9823. 658.79 s [vector] +++ OK, passed 100 tests.
  9824. 658.80 s [vector] iscanr: OK (0.01s)
  9825. 658.80 s [vector] +++ OK, passed 100 tests.
  9826. 658.80 s [vector] iscanr': OK (0.01s)
  9827. 658.80 s [vector] +++ OK, passed 100 tests.
  9828. 658.81 s [vector] mut_read: OK
  9829. 658.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9830. 658.81 s [vector] mut_write: OK
  9831. 658.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9832. 658.81 s [vector] mut_modify: OK
  9833. 658.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9834. 658.82 s [vector] mut_generate: OK
  9835. 658.82 s [vector] +++ OK, passed 100 tests.
  9836. 658.84 s [vector] mut_generateM: OK (0.03s)
  9837. 658.84 s [vector] +++ OK, passed 100 tests.
  9838. 658.88 s [vector] mut_mapM_: OK (0.04s)
  9839. 658.88 s [vector] +++ OK, passed 100 tests.
  9840. 658.92 s [vector] mut_imapM_: OK (0.04s)
  9841. 658.92 s [vector] +++ OK, passed 100 tests.
  9842. 658.96 s [vector] mut_forM_: OK (0.04s)
  9843. 658.96 s [vector] +++ OK, passed 100 tests.
  9844. 659.00 s [vector] mut_iforM_: OK (0.03s)
  9845. 659.00 s [vector] +++ OK, passed 100 tests.
  9846. 659.01 s [vector] mut_foldr: OK (0.01s)
  9847. 659.01 s [vector] +++ OK, passed 100 tests.
  9848. 659.02 s [vector] mut_foldr': OK (0.01s)
  9849. 659.02 s [vector] +++ OK, passed 100 tests.
  9850. 659.03 s [vector] mut_foldl: OK (0.01s)
  9851. 659.03 s [vector] +++ OK, passed 100 tests.
  9852. 659.04 s [vector] mut_foldl': OK (0.01s)
  9853. 659.04 s [vector] +++ OK, passed 100 tests.
  9854. 659.04 s [vector] mut_ifoldr: OK (0.01s)
  9855. 659.04 s [vector] +++ OK, passed 100 tests.
  9856. 659.06 s [vector] mut_ifoldr': OK
  9857. 659.06 s [vector] +++ OK, passed 100 tests.
  9858. 659.08 s [vector] mut_ifoldl: OK (0.01s)
  9859. 659.08 s [vector] +++ OK, passed 100 tests.
  9860. 659.09 s [vector] mut_ifoldl': OK (0.01s)
  9861. 659.09 s [vector] +++ OK, passed 100 tests.
  9862. 659.09 s [vector] mut_foldM: OK
  9863. 659.10 s [vector] +++ OK, passed 100 tests.
  9864. 659.10 s [vector] mut_foldM': OK
  9865. 659.10 s [vector] +++ OK, passed 100 tests.
  9866. 659.12 s [vector] mut_foldrM: OK
  9867. 659.12 s [vector] +++ OK, passed 100 tests.
  9868. 659.12 s [vector] mut_foldrM': OK
  9869. 659.12 s [vector] +++ OK, passed 100 tests.
  9870. 659.13 s [vector] mut_ifoldM: OK (0.01s)
  9871. 659.14 s [vector] +++ OK, passed 100 tests.
  9872. 659.14 s [vector] mut_ifoldM': OK
  9873. 659.15 s [vector] +++ OK, passed 100 tests.
  9874. 659.16 s [vector] mut_ifoldrM: OK
  9875. 659.16 s [vector] +++ OK, passed 100 tests.
  9876. 659.16 s [vector] mut_ifoldrM': OK
  9877. 659.16 s [vector] +++ OK, passed 100 tests.
  9878. 659.16 s [vector] compare: OK
  9879. 659.16 s [vector] +++ OK, passed 100 tests.
  9880. 659.16 s [vector] maximum: OK
  9881. 659.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9882. 659.16 s [vector] minimum: OK
  9883. 659.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9884. 659.16 s [vector] minIndex: OK
  9885. 659.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9886. 659.16 s [vector] maxIndex: OK
  9887. 659.16 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9888. 659.17 s [vector] maximumBy: OK
  9889. 659.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9890. 659.17 s [vector] minimumBy: OK
  9891. 659.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9892. 659.17 s [vector] maximumOn: OK
  9893. 659.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9894. 659.17 s [vector] minimumOn: OK
  9895. 659.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9896. 659.17 s [vector] maxIndexBy: OK
  9897. 659.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9898. 659.17 s [vector] minIndexBy: OK
  9899. 659.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9900. 659.17 s [vector] ListFirstMaxIndexWins: OK
  9901. 659.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9902. 659.17 s [vector] FalseListFirstMaxIndexWins: OK
  9903. 659.17 s [vector] +++ OK, failed as expected. (after 1 test):
  9904. 659.17 s [vector] Exception:
  9905. 659.17 s [vector] Prelude.foldr1: empty list
  9906. 659.17 s [vector] CallStack (from HasCallStack):
  9907. 659.17 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  9908. 659.17 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  9909. 659.17 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9910. 659.17 s [vector] []
  9911. 659.17 s [vector] zip: OK
  9912. 659.17 s [vector] +++ OK, passed 100 tests.
  9913. 659.18 s [vector] zip3: OK
  9914. 659.18 s [vector] +++ OK, passed 100 tests.
  9915. 659.18 s [vector] unzip: OK
  9916. 659.18 s [vector] +++ OK, passed 100 tests.
  9917. 659.18 s [vector] unzip3: OK
  9918. 659.18 s [vector] +++ OK, passed 100 tests.
  9919. 659.18 s [vector] indexed: OK
  9920. 659.19 s [vector] +++ OK, passed 100 tests.
  9921. 659.19 s [vector] update: OK
  9922. 659.19 s [vector] +++ OK, passed 100 tests.
  9923. 659.19 s [vector] mempty: OK
  9924. 659.19 s [vector] +++ OK, passed 100 tests.
  9925. 659.19 s [vector] mappend: OK
  9926. 659.20 s [vector] +++ OK, passed 100 tests.
  9927. 659.22 s [vector] mconcat: OK (0.03s)
  9928. 659.22 s [vector] +++ OK, passed 100 tests.
  9929. 659.22 s [vector] glength: OK
  9930. 659.22 s [vector] +++ OK, passed 100 tests.
  9931. 659.22 s [vector] sum: OK
  9932. 659.22 s [vector] +++ OK, passed 100 tests.
  9933. 659.22 s [vector] product: OK
  9934. 659.22 s [vector] +++ OK, passed 100 tests.
  9935. 659.22 s [vector] enumFromN: OK
  9936. 659.22 s [vector] +++ OK, passed 100 tests.
  9937. 659.22 s [vector] enumFromThenN: OK
  9938. 659.22 s [vector] +++ OK, passed 100 tests.
  9939. 659.22 s [vector] enumFromTo: OK
  9940. 659.22 s [vector] +++ OK, passed 100 tests.
  9941. 659.22 s [vector] enumFromThenTo: OK
  9942. 659.22 s [vector] +++ OK, passed 100 tests; 2 discarded.
  9943. 659.22 s [vector] (Double)
  9944. 659.22 s [vector] fromList.toList == id: OK
  9945. 659.22 s [vector] +++ OK, passed 100 tests.
  9946. 659.22 s [vector] toList.fromList == id: OK
  9947. 659.22 s [vector] +++ OK, passed 100 tests.
  9948. 659.22 s [vector] unstream.stream == id: OK
  9949. 659.22 s [vector] +++ OK, passed 100 tests.
  9950. 659.23 s [vector] stream.unstream == id: OK
  9951. 659.23 s [vector] +++ OK, passed 100 tests.
  9952. 659.23 s [vector] eq: OK
  9953. 659.23 s [vector] +++ OK, passed 100 tests.
  9954. 659.23 s [vector] length: OK
  9955. 659.23 s [vector] +++ OK, passed 100 tests.
  9956. 659.23 s [vector] null: OK
  9957. 659.23 s [vector] +++ OK, passed 100 tests.
  9958. 659.23 s [vector] index: OK
  9959. 659.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9960. 659.23 s [vector] safeIndex: OK
  9961. 659.23 s [vector] +++ OK, passed 100 tests.
  9962. 659.23 s [vector] head: OK
  9963. 659.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9964. 659.23 s [vector] last: OK
  9965. 659.23 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9966. 659.23 s [vector] unsafeIndex: OK
  9967. 659.23 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9968. 659.23 s [vector] unsafeHead: OK
  9969. 659.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9970. 659.23 s [vector] unsafeLast: OK
  9971. 659.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9972. 659.24 s [vector] slice: OK
  9973. 659.24 s [vector] +++ OK, passed 100 tests.
  9974. 659.24 s [vector] init: OK
  9975. 659.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9976. 659.24 s [vector] tail: OK
  9977. 659.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9978. 659.24 s [vector] take: OK
  9979. 659.24 s [vector] +++ OK, passed 100 tests.
  9980. 659.24 s [vector] drop: OK
  9981. 659.24 s [vector] +++ OK, passed 100 tests.
  9982. 659.24 s [vector] splitAt: OK
  9983. 659.24 s [vector] +++ OK, passed 100 tests.
  9984. 659.24 s [vector] empty: OK
  9985. 659.24 s [vector] +++ OK, passed 100 tests.
  9986. 659.24 s [vector] singleton: OK
  9987. 659.24 s [vector] +++ OK, passed 100 tests.
  9988. 659.24 s [vector] replicate: OK
  9989. 659.24 s [vector] +++ OK, passed 100 tests.
  9990. 659.25 s [vector] generate: OK
  9991. 659.25 s [vector] +++ OK, passed 100 tests.
  9992. 659.26 s [vector] iterateN: OK
  9993. 659.26 s [vector] +++ OK, passed 100 tests.
  9994. 659.32 s [vector] iterateNM: OK (0.05s)
  9995. 659.32 s [vector] +++ OK, passed 100 tests.
  9996. 659.36 s [vector] generateM: OK (0.05s)
  9997. 659.36 s [vector] +++ OK, passed 100 tests.
  9998. 659.36 s [vector] replicateM: OK
  9999. 659.36 s [vector] +++ OK, passed 100 tests.
  10000. 659.36 s [vector] create: OK
  10001. 659.36 s [vector] +++ OK, passed 100 tests.
  10002. 659.36 s [vector] createT: OK
  10003. 659.36 s [vector] +++ OK, passed 100 tests.
  10004. 659.36 s [vector] unfoldr: OK
  10005. 659.36 s [vector] +++ OK, passed 100 tests.
  10006. 659.36 s [vector] unfoldrN: OK
  10007. 659.36 s [vector] +++ OK, passed 100 tests.
  10008. 659.36 s [vector] unfoldrExactN: OK
  10009. 659.36 s [vector] +++ OK, passed 100 tests.
  10010. 659.36 s [vector] unfoldrM: OK
  10011. 659.36 s [vector] +++ OK, passed 100 tests.
  10012. 659.38 s [vector] unfoldrNM: OK
  10013. 659.38 s [vector] +++ OK, passed 100 tests.
  10014. 659.42 s [vector] unfoldrExactNM: OK (0.04s)
  10015. 659.42 s [vector] +++ OK, passed 100 tests.
  10016. 659.44 s [vector] constructN: OK (0.02s)
  10017. 659.44 s [vector] +++ OK, passed 100 tests.
  10018. 659.44 s [vector] constructrN: OK (0.01s)
  10019. 659.44 s [vector] +++ OK, passed 100 tests.
  10020. 659.44 s [vector] cons: OK
  10021. 659.44 s [vector] +++ OK, passed 100 tests.
  10022. 659.44 s [vector] snoc: OK
  10023. 659.44 s [vector] +++ OK, passed 100 tests.
  10024. 659.44 s [vector] append: OK
  10025. 659.44 s [vector] +++ OK, passed 100 tests.
  10026. 659.46 s [vector] concat: OK
  10027. 659.46 s [vector] +++ OK, passed 100 tests.
  10028. 659.47 s [vector] force: OK
  10029. 659.47 s [vector] +++ OK, passed 100 tests.
  10030. 659.47 s [vector] upd: OK
  10031. 659.47 s [vector] +++ OK, passed 100 tests.
  10032. 659.48 s [vector] accum: OK (0.01s)
  10033. 659.48 s [vector] +++ OK, passed 100 tests.
  10034. 659.48 s [vector] reverse: OK
  10035. 659.48 s [vector] +++ OK, passed 100 tests.
  10036. 659.48 s [vector] backpermute: OK
  10037. 659.48 s [vector] +++ OK, passed 100 tests.
  10038. 659.50 s [vector] map: OK
  10039. 659.50 s [vector] +++ OK, passed 100 tests.
  10040. 659.51 s [vector] imap: OK
  10041. 659.51 s [vector] +++ OK, passed 100 tests.
  10042. 659.52 s [vector] concatMap: OK
  10043. 659.52 s [vector] +++ OK, passed 100 tests.
  10044. 659.54 s [vector] mapM: OK
  10045. 659.54 s [vector] +++ OK, passed 100 tests.
  10046. 659.57 s [vector] mapM_: OK (0.04s)
  10047. 659.57 s [vector] +++ OK, passed 100 tests.
  10048. 659.58 s [vector] forM: OK
  10049. 659.58 s [vector] +++ OK, passed 100 tests.
  10050. 659.62 s [vector] forM_: OK (0.05s)
  10051. 659.62 s [vector] +++ OK, passed 100 tests.
  10052. 659.62 s [vector] imapM: OK (0.01s)
  10053. 659.62 s [vector] +++ OK, passed 100 tests.
  10054. 659.67 s [vector] imapM_: OK (0.03s)
  10055. 659.67 s [vector] +++ OK, passed 100 tests.
  10056. 659.67 s [vector] zipWith: OK
  10057. 659.67 s [vector] +++ OK, passed 100 tests.
  10058. 659.69 s [vector] zipWith3: OK (0.01s)
  10059. 659.69 s [vector] +++ OK, passed 100 tests.
  10060. 659.69 s [vector] izipWith: OK
  10061. 659.69 s [vector] +++ OK, passed 100 tests.
  10062. 659.71 s [vector] izipWith3: OK (0.01s)
  10063. 659.71 s [vector] +++ OK, passed 100 tests.
  10064. 659.72 s [vector] izipWithM: OK (0.01s)
  10065. 659.72 s [vector] +++ OK, passed 100 tests.
  10066. 659.76 s [vector] izipWithM_: OK (0.04s)
  10067. 659.76 s [vector] +++ OK, passed 100 tests.
  10068. 659.76 s [vector] zipWithM: OK
  10069. 659.78 s [vector] +++ OK, passed 100 tests.
  10070. 659.79 s [vector] zipWithM_: OK (0.03s)
  10071. 659.79 s [vector] +++ OK, passed 100 tests.
  10072. 659.79 s [vector] filter: OK
  10073. 659.79 s [vector] +++ OK, passed 100 tests.
  10074. 659.80 s [vector] ifilter: OK
  10075. 659.82 s [vector] +++ OK, passed 100 tests.
  10076. 659.84 s [vector] filterM: OK (0.05s)
  10077. 659.84 s [vector] +++ OK, passed 100 tests.
  10078. 659.84 s [vector] uniq: OK
  10079. 659.85 s [vector] +++ OK, passed 100 tests.
  10080. 659.85 s [vector] mapMaybe: OK
  10081. 659.85 s [vector] +++ OK, passed 100 tests.
  10082. 659.86 s [vector] imapMaybe: OK
  10083. 659.86 s [vector] +++ OK, passed 100 tests.
  10084. 659.86 s [vector] takeWhile: OK
  10085. 659.86 s [vector] +++ OK, passed 100 tests.
  10086. 659.86 s [vector] dropWhile: OK
  10087. 659.86 s [vector] +++ OK, passed 100 tests.
  10088. 659.87 s [vector] partition: OK
  10089. 659.88 s [vector] +++ OK, passed 100 tests.
  10090. 659.88 s [vector] partitionWith: OK
  10091. 659.88 s [vector] +++ OK, passed 100 tests.
  10092. 659.88 s [vector] span: OK
  10093. 659.88 s [vector] +++ OK, passed 100 tests.
  10094. 659.88 s [vector] break: OK
  10095. 659.88 s [vector] +++ OK, passed 100 tests.
  10096. 659.88 s [vector] spanR: OK
  10097. 659.88 s [vector] +++ OK, passed 100 tests.
  10098. 659.89 s [vector] breakR: OK
  10099. 659.89 s [vector] +++ OK, passed 100 tests.
  10100. 659.89 s [vector] groupBy: OK (0.01s)
  10101. 659.89 s [vector] +++ OK, passed 100 tests.
  10102. 659.89 s [vector] elem: OK
  10103. 659.89 s [vector] +++ OK, passed 100 tests.
  10104. 659.89 s [vector] notElem: OK
  10105. 659.89 s [vector] +++ OK, passed 100 tests.
  10106. 659.89 s [vector] find: OK
  10107. 659.89 s [vector] +++ OK, passed 100 tests.
  10108. 659.90 s [vector] findIndex: OK
  10109. 659.90 s [vector] +++ OK, passed 100 tests.
  10110. 659.90 s [vector] findIndexR: OK
  10111. 659.90 s [vector] +++ OK, passed 100 tests.
  10112. 659.90 s [vector] findIndices: OK
  10113. 659.90 s [vector] +++ OK, passed 100 tests.
  10114. 659.90 s [vector] elemIndex: OK
  10115. 659.90 s [vector] +++ OK, passed 100 tests.
  10116. 659.91 s [vector] elemIndices: OK
  10117. 659.92 s [vector] +++ OK, passed 100 tests.
  10118. 659.92 s [vector] foldl: OK (0.02s)
  10119. 659.92 s [vector] +++ OK, passed 100 tests.
  10120. 659.94 s [vector] foldl1: OK
  10121. 659.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10122. 659.96 s [vector] foldl': OK (0.01s)
  10123. 659.96 s [vector] +++ OK, passed 100 tests.
  10124. 659.98 s [vector] foldl1': OK (0.01s)
  10125. 659.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10126. 659.99 s [vector] foldr: OK (0.01s)
  10127. 659.99 s [vector] +++ OK, passed 100 tests.
  10128. 660.00 s [vector] foldr1: OK (0.01s)
  10129. 660.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10130. 660.01 s [vector] foldr': OK (0.01s)
  10131. 660.02 s [vector] +++ OK, passed 100 tests.
  10132. 660.02 s [vector] foldr1': OK (0.01s)
  10133. 660.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10134. 660.03 s [vector] ifoldl: OK (0.01s)
  10135. 660.03 s [vector] +++ OK, passed 100 tests.
  10136. 660.05 s [vector] ifoldl': OK (0.01s)
  10137. 660.05 s [vector] +++ OK, passed 100 tests.
  10138. 660.06 s [vector] ifoldr: OK (0.01s)
  10139. 660.06 s [vector] +++ OK, passed 100 tests.
  10140. 660.08 s [vector] ifoldr': OK (0.02s)
  10141. 660.08 s [vector] +++ OK, passed 100 tests.
  10142. 660.10 s [vector] ifoldM: OK (0.02s)
  10143. 660.10 s [vector] +++ OK, passed 100 tests.
  10144. 660.12 s [vector] ifoldM': OK (0.02s)
  10145. 660.12 s [vector] +++ OK, passed 100 tests.
  10146. 660.16 s [vector] ifoldM_: OK (0.04s)
  10147. 660.16 s [vector] +++ OK, passed 100 tests.
  10148. 660.19 s [vector] ifoldM'_: OK (0.05s)
  10149. 660.19 s [vector] +++ OK, passed 100 tests.
  10150. 660.19 s [vector] all: OK
  10151. 660.19 s [vector] +++ OK, passed 100 tests.
  10152. 660.19 s [vector] any: OK
  10153. 660.19 s [vector] +++ OK, passed 100 tests.
  10154. 660.21 s [vector] prescanl: OK (0.01s)
  10155. 660.21 s [vector] +++ OK, passed 100 tests.
  10156. 660.24 s [vector] prescanl': OK (0.02s)
  10157. 660.24 s [vector] +++ OK, passed 100 tests.
  10158. 660.26 s [vector] postscanl: OK (0.02s)
  10159. 660.26 s [vector] +++ OK, passed 100 tests.
  10160. 660.28 s [vector] postscanl': OK (0.03s)
  10161. 660.28 s [vector] +++ OK, passed 100 tests.
  10162. 660.30 s [vector] scanl: OK (0.02s)
  10163. 660.30 s [vector] +++ OK, passed 100 tests.
  10164. 660.34 s [vector] scanl': OK (0.03s)
  10165. 660.34 s [vector] +++ OK, passed 100 tests.
  10166. 660.36 s [vector] scanl1: OK (0.03s)
  10167. 660.36 s [vector] +++ OK, passed 100 tests.
  10168. 660.38 s [vector] scanl1': OK (0.02s)
  10169. 660.38 s [vector] +++ OK, passed 100 tests.
  10170. 660.41 s [vector] iscanl: OK (0.02s)
  10171. 660.41 s [vector] +++ OK, passed 100 tests.
  10172. 660.42 s [vector] iscanl': OK (0.02s)
  10173. 660.42 s [vector] +++ OK, passed 100 tests.
  10174. 660.43 s [vector] prescanr: OK (0.01s)
  10175. 660.43 s [vector] +++ OK, passed 100 tests.
  10176. 660.46 s [vector] prescanr': OK (0.02s)
  10177. 660.46 s [vector] +++ OK, passed 100 tests.
  10178. 660.48 s [vector] postscanr: OK (0.03s)
  10179. 660.48 s [vector] +++ OK, passed 100 tests.
  10180. 660.51 s [vector] postscanr': OK (0.02s)
  10181. 660.51 s [vector] +++ OK, passed 100 tests.
  10182. 660.54 s [vector] scanr: OK (0.02s)
  10183. 660.54 s [vector] +++ OK, passed 100 tests.
  10184. 660.55 s [vector] scanr': OK (0.02s)
  10185. 660.55 s [vector] +++ OK, passed 100 tests.
  10186. 660.57 s [vector] scanr1: OK (0.02s)
  10187. 660.57 s [vector] +++ OK, passed 100 tests.
  10188. 660.60 s [vector] scanr1': OK (0.02s)
  10189. 660.60 s [vector] +++ OK, passed 100 tests.
  10190. 660.62 s [vector] iscanr: OK (0.02s)
  10191. 660.62 s [vector] +++ OK, passed 100 tests.
  10192. 660.63 s [vector] iscanr': OK (0.02s)
  10193. 660.63 s [vector] +++ OK, passed 100 tests.
  10194. 660.63 s [vector] mut_read: OK
  10195. 660.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10196. 660.64 s [vector] mut_write: OK
  10197. 660.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10198. 660.65 s [vector] mut_modify: OK
  10199. 660.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10200. 660.67 s [vector] mut_generate: OK
  10201. 660.67 s [vector] +++ OK, passed 100 tests.
  10202. 660.71 s [vector] mut_generateM: OK (0.04s)
  10203. 660.71 s [vector] +++ OK, passed 100 tests.
  10204. 660.75 s [vector] mut_mapM_: OK (0.04s)
  10205. 660.75 s [vector] +++ OK, passed 100 tests.
  10206. 660.79 s [vector] mut_imapM_: OK (0.04s)
  10207. 660.79 s [vector] +++ OK, passed 100 tests.
  10208. 660.83 s [vector] mut_forM_: OK (0.04s)
  10209. 660.83 s [vector] +++ OK, passed 100 tests.
  10210. 660.87 s [vector] mut_iforM_: OK (0.04s)
  10211. 660.87 s [vector] +++ OK, passed 100 tests.
  10212. 660.87 s [vector] mut_foldr: OK (0.02s)
  10213. 660.87 s [vector] +++ OK, passed 100 tests.
  10214. 660.89 s [vector] mut_foldr': OK (0.01s)
  10215. 660.89 s [vector] +++ OK, passed 100 tests.
  10216. 660.91 s [vector] mut_foldl: OK (0.01s)
  10217. 660.91 s [vector] +++ OK, passed 100 tests.
  10218. 660.93 s [vector] mut_foldl': OK (0.01s)
  10219. 660.93 s [vector] +++ OK, passed 100 tests.
  10220. 660.93 s [vector] mut_ifoldr: OK (0.02s)
  10221. 660.93 s [vector] +++ OK, passed 100 tests.
  10222. 660.95 s [vector] mut_ifoldr': OK (0.02s)
  10223. 660.95 s [vector] +++ OK, passed 100 tests.
  10224. 660.97 s [vector] mut_ifoldl: OK (0.02s)
  10225. 660.97 s [vector] +++ OK, passed 100 tests.
  10226. 660.99 s [vector] mut_ifoldl': OK (0.02s)
  10227. 660.99 s [vector] +++ OK, passed 100 tests.
  10228. 660.99 s [vector] mut_foldM: OK (0.01s)
  10229. 660.99 s [vector] +++ OK, passed 100 tests.
  10230. 661.02 s [vector] mut_foldM': OK
  10231. 661.02 s [vector] +++ OK, passed 100 tests.
  10232. 661.02 s [vector] mut_foldrM: OK (0.02s)
  10233. 661.02 s [vector] +++ OK, passed 100 tests.
  10234. 661.05 s [vector] mut_foldrM': OK (0.02s)
  10235. 661.05 s [vector] +++ OK, passed 100 tests.
  10236. 661.07 s [vector] mut_ifoldM: OK (0.02s)
  10237. 661.07 s [vector] +++ OK, passed 100 tests.
  10238. 661.09 s [vector] mut_ifoldM': OK (0.02s)
  10239. 661.09 s [vector] +++ OK, passed 100 tests.
  10240. 661.11 s [vector] mut_ifoldrM: OK (0.02s)
  10241. 661.11 s [vector] +++ OK, passed 100 tests.
  10242. 661.12 s [vector] mut_ifoldrM': OK (0.02s)
  10243. 661.12 s [vector] +++ OK, passed 100 tests.
  10244. 661.12 s [vector] compare: OK
  10245. 661.12 s [vector] +++ OK, passed 100 tests.
  10246. 661.12 s [vector] maximum: OK
  10247. 661.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10248. 661.12 s [vector] minimum: OK
  10249. 661.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10250. 661.12 s [vector] minIndex: OK
  10251. 661.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10252. 661.12 s [vector] maxIndex: OK
  10253. 661.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10254. 661.12 s [vector] maximumBy: OK
  10255. 661.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10256. 661.12 s [vector] minimumBy: OK
  10257. 661.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10258. 661.12 s [vector] maximumOn: OK
  10259. 661.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10260. 661.13 s [vector] minimumOn: OK
  10261. 661.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10262. 661.13 s [vector] maxIndexBy: OK
  10263. 661.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10264. 661.13 s [vector] minIndexBy: OK
  10265. 661.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10266. 661.13 s [vector] ListFirstMaxIndexWins: OK
  10267. 661.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10268. 661.13 s [vector] FalseListFirstMaxIndexWins: OK
  10269. 661.13 s [vector] +++ OK, failed as expected. (after 1 test):
  10270. 661.13 s [vector] Exception:
  10271. 661.13 s [vector] Prelude.foldr1: empty list
  10272. 661.13 s [vector] CallStack (from HasCallStack):
  10273. 661.13 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10274. 661.13 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10275. 661.13 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10276. 661.13 s [vector] []
  10277. 661.14 s [vector] zip: OK
  10278. 661.14 s [vector] +++ OK, passed 100 tests.
  10279. 661.14 s [vector] zip3: OK
  10280. 661.14 s [vector] +++ OK, passed 100 tests.
  10281. 661.14 s [vector] unzip: OK
  10282. 661.14 s [vector] +++ OK, passed 100 tests.
  10283. 661.15 s [vector] unzip3: OK
  10284. 661.15 s [vector] +++ OK, passed 100 tests.
  10285. 661.15 s [vector] indexed: OK
  10286. 661.15 s [vector] +++ OK, passed 100 tests.
  10287. 661.15 s [vector] update: OK
  10288. 661.15 s [vector] +++ OK, passed 100 tests.
  10289. 661.15 s [vector] mempty: OK
  10290. 661.15 s [vector] +++ OK, passed 100 tests.
  10291. 661.15 s [vector] mappend: OK
  10292. 661.15 s [vector] +++ OK, passed 100 tests.
  10293. 661.20 s [vector] mconcat: OK (0.03s)
  10294. 661.20 s [vector] +++ OK, passed 100 tests.
  10295. 661.20 s [vector] glength: OK
  10296. 661.20 s [vector] +++ OK, passed 100 tests.
  10297. 661.20 s [vector] sum: OK
  10298. 661.20 s [vector] +++ OK, passed 100 tests.
  10299. 661.20 s [vector] product: OK
  10300. 661.20 s [vector] +++ OK, passed 100 tests.
  10301. 661.20 s [vector] enumFromN: OK
  10302. 661.20 s [vector] +++ OK, passed 100 tests.
  10303. 661.21 s [vector] enumFromThenN: OK
  10304. 661.21 s [vector] +++ OK, passed 100 tests.
  10305. 661.21 s [vector] enumFromTo: OK
  10306. 661.21 s [vector] +++ OK, passed 100 tests.
  10307. 661.21 s [vector] enumFromThenTo: OK
  10308. 661.21 s [vector] +++ OK, passed 100 tests; 6 discarded.
  10309. 661.21 s [vector] (Int,Bool)
  10310. 661.21 s [vector] fromList.toList == id: OK
  10311. 661.21 s [vector] +++ OK, passed 100 tests.
  10312. 661.21 s [vector] toList.fromList == id: OK
  10313. 661.21 s [vector] +++ OK, passed 100 tests.
  10314. 661.21 s [vector] unstream.stream == id: OK
  10315. 661.21 s [vector] +++ OK, passed 100 tests.
  10316. 661.21 s [vector] stream.unstream == id: OK
  10317. 661.21 s [vector] +++ OK, passed 100 tests.
  10318. 661.21 s [vector] eq: OK
  10319. 661.21 s [vector] +++ OK, passed 100 tests.
  10320. 661.22 s [vector] length: OK
  10321. 661.22 s [vector] +++ OK, passed 100 tests.
  10322. 661.22 s [vector] null: OK
  10323. 661.22 s [vector] +++ OK, passed 100 tests.
  10324. 661.22 s [vector] index: OK
  10325. 661.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10326. 661.22 s [vector] safeIndex: OK
  10327. 661.22 s [vector] +++ OK, passed 100 tests.
  10328. 661.22 s [vector] head: OK
  10329. 661.22 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10330. 661.22 s [vector] last: OK
  10331. 661.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10332. 661.22 s [vector] unsafeIndex: OK
  10333. 661.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10334. 661.22 s [vector] unsafeHead: OK
  10335. 661.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10336. 661.22 s [vector] unsafeLast: OK
  10337. 661.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10338. 661.22 s [vector] slice: OK
  10339. 661.22 s [vector] +++ OK, passed 100 tests.
  10340. 661.22 s [vector] init: OK
  10341. 661.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10342. 661.23 s [vector] tail: OK
  10343. 661.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10344. 661.23 s [vector] take: OK
  10345. 661.23 s [vector] +++ OK, passed 100 tests.
  10346. 661.23 s [vector] drop: OK
  10347. 661.23 s [vector] +++ OK, passed 100 tests.
  10348. 661.23 s [vector] splitAt: OK
  10349. 661.23 s [vector] +++ OK, passed 100 tests.
  10350. 661.23 s [vector] empty: OK
  10351. 661.23 s [vector] +++ OK, passed 100 tests.
  10352. 661.23 s [vector] singleton: OK
  10353. 661.23 s [vector] +++ OK, passed 100 tests.
  10354. 661.23 s [vector] replicate: OK
  10355. 661.23 s [vector] +++ OK, passed 100 tests.
  10356. 661.24 s [vector] generate: OK
  10357. 661.24 s [vector] +++ OK, passed 100 tests.
  10358. 661.25 s [vector] iterateN: OK
  10359. 661.25 s [vector] +++ OK, passed 100 tests.
  10360. 661.29 s [vector] iterateNM: OK (0.04s)
  10361. 661.29 s [vector] +++ OK, passed 100 tests.
  10362. 661.35 s [vector] generateM: OK (0.05s)
  10363. 661.35 s [vector] +++ OK, passed 100 tests.
  10364. 661.35 s [vector] replicateM: OK (0.02s)
  10365. 661.35 s [vector] +++ OK, passed 100 tests.
  10366. 661.35 s [vector] create: OK
  10367. 661.35 s [vector] +++ OK, passed 100 tests.
  10368. 661.35 s [vector] createT: OK
  10369. 661.35 s [vector] +++ OK, passed 100 tests.
  10370. 661.35 s [vector] unfoldr: OK
  10371. 661.35 s [vector] +++ OK, passed 100 tests.
  10372. 661.36 s [vector] unfoldrN: OK
  10373. 661.36 s [vector] +++ OK, passed 100 tests.
  10374. 661.36 s [vector] unfoldrExactN: OK
  10375. 661.36 s [vector] +++ OK, passed 100 tests.
  10376. 661.36 s [vector] unfoldrM: OK
  10377. 661.36 s [vector] +++ OK, passed 100 tests.
  10378. 661.37 s [vector] unfoldrNM: OK
  10379. 661.37 s [vector] +++ OK, passed 100 tests.
  10380. 661.44 s [vector] unfoldrExactNM: OK (0.04s)
  10381. 661.44 s [vector] +++ OK, passed 100 tests.
  10382. 661.45 s [vector] constructN: OK
  10383. 661.45 s [vector] +++ OK, passed 100 tests.
  10384. 661.45 s [vector] constructrN: OK
  10385. 661.45 s [vector] +++ OK, passed 100 tests.
  10386. 661.45 s [vector] cons: OK
  10387. 661.45 s [vector] +++ OK, passed 100 tests.
  10388. 661.45 s [vector] snoc: OK
  10389. 661.45 s [vector] +++ OK, passed 100 tests.
  10390. 661.46 s [vector] append: OK
  10391. 661.46 s [vector] +++ OK, passed 100 tests.
  10392. 661.49 s [vector] concat: OK (0.04s)
  10393. 661.49 s [vector] +++ OK, passed 100 tests.
  10394. 661.49 s [vector] force: OK
  10395. 661.49 s [vector] +++ OK, passed 100 tests.
  10396. 661.49 s [vector] upd: OK
  10397. 661.50 s [vector] +++ OK, passed 100 tests.
  10398. 661.50 s [vector] accum: OK
  10399. 661.50 s [vector] +++ OK, passed 100 tests.
  10400. 661.51 s [vector] reverse: OK
  10401. 661.51 s [vector] +++ OK, passed 100 tests.
  10402. 661.51 s [vector] backpermute: OK
  10403. 661.51 s [vector] +++ OK, passed 100 tests.
  10404. 661.52 s [vector] map: OK
  10405. 661.52 s [vector] +++ OK, passed 100 tests.
  10406. 661.52 s [vector] imap: OK
  10407. 661.52 s [vector] +++ OK, passed 100 tests.
  10408. 661.53 s [vector] concatMap: OK
  10409. 661.53 s [vector] +++ OK, passed 100 tests.
  10410. 661.53 s [vector] mapM: OK
  10411. 661.53 s [vector] +++ OK, passed 100 tests.
  10412. 661.56 s [vector] mapM_: OK (0.03s)
  10413. 661.56 s [vector] +++ OK, passed 100 tests.
  10414. 661.56 s [vector] forM: OK
  10415. 661.57 s [vector] +++ OK, passed 100 tests.
  10416. 661.59 s [vector] forM_: OK (0.02s)
  10417. 661.59 s [vector] +++ OK, passed 100 tests.
  10418. 661.61 s [vector] imapM: OK
  10419. 661.61 s [vector] +++ OK, passed 100 tests.
  10420. 661.62 s [vector] imapM_: OK (0.03s)
  10421. 661.62 s [vector] +++ OK, passed 100 tests.
  10422. 661.63 s [vector] zipWith: OK
  10423. 661.63 s [vector] +++ OK, passed 100 tests.
  10424. 661.64 s [vector] zipWith3: OK
  10425. 661.64 s [vector] +++ OK, passed 100 tests.
  10426. 661.64 s [vector] izipWith: OK
  10427. 661.64 s [vector] +++ OK, passed 100 tests.
  10428. 661.64 s [vector] izipWith3: OK
  10429. 661.64 s [vector] +++ OK, passed 100 tests.
  10430. 661.65 s [vector] izipWithM: OK
  10431. 661.67 s [vector] +++ OK, passed 100 tests.
  10432. 661.67 s [vector] izipWithM_: OK (0.02s)
  10433. 661.67 s [vector] +++ OK, passed 100 tests.
  10434. 661.69 s [vector] zipWithM: OK
  10435. 661.69 s [vector] +++ OK, passed 100 tests.
  10436. 661.70 s [vector] zipWithM_: OK (0.02s)
  10437. 661.70 s [vector] +++ OK, passed 100 tests.
  10438. 661.70 s [vector] filter: OK
  10439. 661.70 s [vector] +++ OK, passed 100 tests.
  10440. 661.70 s [vector] ifilter: OK
  10441. 661.71 s [vector] +++ OK, passed 100 tests.
  10442. 661.76 s [vector] filterM: OK (0.06s)
  10443. 661.76 s [vector] +++ OK, passed 100 tests.
  10444. 661.77 s [vector] uniq: OK
  10445. 661.77 s [vector] +++ OK, passed 100 tests.
  10446. 661.77 s [vector] mapMaybe: OK
  10447. 661.77 s [vector] +++ OK, passed 100 tests.
  10448. 661.77 s [vector] imapMaybe: OK
  10449. 661.77 s [vector] +++ OK, passed 100 tests.
  10450. 661.77 s [vector] takeWhile: OK
  10451. 661.77 s [vector] +++ OK, passed 100 tests.
  10452. 661.78 s [vector] dropWhile: OK
  10453. 661.78 s [vector] +++ OK, passed 100 tests.
  10454. 661.78 s [vector] partition: OK
  10455. 661.78 s [vector] +++ OK, passed 100 tests.
  10456. 661.78 s [vector] partitionWith: OK
  10457. 661.78 s [vector] +++ OK, passed 100 tests.
  10458. 661.78 s [vector] span: OK
  10459. 661.79 s [vector] +++ OK, passed 100 tests.
  10460. 661.79 s [vector] break: OK
  10461. 661.79 s [vector] +++ OK, passed 100 tests.
  10462. 661.79 s [vector] spanR: OK
  10463. 661.79 s [vector] +++ OK, passed 100 tests.
  10464. 661.79 s [vector] breakR: OK
  10465. 661.79 s [vector] +++ OK, passed 100 tests.
  10466. 661.80 s [vector] groupBy: OK
  10467. 661.80 s [vector] +++ OK, passed 100 tests.
  10468. 661.80 s [vector] elem: OK
  10469. 661.80 s [vector] +++ OK, passed 100 tests.
  10470. 661.80 s [vector] notElem: OK
  10471. 661.80 s [vector] +++ OK, passed 100 tests.
  10472. 661.80 s [vector] find: OK
  10473. 661.80 s [vector] +++ OK, passed 100 tests.
  10474. 661.80 s [vector] findIndex: OK
  10475. 661.80 s [vector] +++ OK, passed 100 tests.
  10476. 661.80 s [vector] findIndexR: OK
  10477. 661.80 s [vector] +++ OK, passed 100 tests.
  10478. 661.80 s [vector] findIndices: OK
  10479. 661.80 s [vector] +++ OK, passed 100 tests.
  10480. 661.80 s [vector] elemIndex: OK
  10481. 661.81 s [vector] +++ OK, passed 100 tests.
  10482. 661.81 s [vector] elemIndices: OK
  10483. 661.81 s [vector] +++ OK, passed 100 tests.
  10484. 661.81 s [vector] foldl: OK
  10485. 661.81 s [vector] +++ OK, passed 100 tests.
  10486. 661.82 s [vector] foldl1: OK
  10487. 661.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10488. 661.82 s [vector] foldl': OK
  10489. 661.82 s [vector] +++ OK, passed 100 tests.
  10490. 661.82 s [vector] foldl1': OK
  10491. 661.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10492. 661.83 s [vector] foldr: OK
  10493. 661.83 s [vector] +++ OK, passed 100 tests.
  10494. 661.83 s [vector] foldr1: OK
  10495. 661.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10496. 661.84 s [vector] foldr': OK
  10497. 661.84 s [vector] +++ OK, passed 100 tests.
  10498. 661.85 s [vector] foldr1': OK
  10499. 661.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10500. 661.85 s [vector] ifoldl: OK
  10501. 661.85 s [vector] +++ OK, passed 100 tests.
  10502. 661.87 s [vector] ifoldl': OK
  10503. 661.87 s [vector] +++ OK, passed 100 tests.
  10504. 661.88 s [vector] ifoldr: OK
  10505. 661.88 s [vector] +++ OK, passed 100 tests.
  10506. 661.88 s [vector] ifoldr': OK
  10507. 661.88 s [vector] +++ OK, passed 100 tests.
  10508. 661.89 s [vector] ifoldM: OK
  10509. 661.89 s [vector] +++ OK, passed 100 tests.
  10510. 661.91 s [vector] ifoldM': OK
  10511. 661.91 s [vector] +++ OK, passed 100 tests.
  10512. 661.93 s [vector] ifoldM_: OK (0.04s)
  10513. 661.93 s [vector] +++ OK, passed 100 tests.
  10514. 661.96 s [vector] ifoldM'_: OK (0.03s)
  10515. 661.96 s [vector] +++ OK, passed 100 tests.
  10516. 661.96 s [vector] all: OK
  10517. 661.96 s [vector] +++ OK, passed 100 tests.
  10518. 661.96 s [vector] any: OK
  10519. 661.96 s [vector] +++ OK, passed 100 tests.
  10520. 661.97 s [vector] prescanl: OK
  10521. 661.97 s [vector] +++ OK, passed 100 tests.
  10522. 661.97 s [vector] prescanl': OK
  10523. 661.98 s [vector] +++ OK, passed 100 tests.
  10524. 661.98 s [vector] postscanl: OK
  10525. 661.99 s [vector] +++ OK, passed 100 tests.
  10526. 661.99 s [vector] postscanl': OK
  10527. 661.99 s [vector] +++ OK, passed 100 tests.
  10528. 662.00 s [vector] scanl: OK
  10529. 662.00 s [vector] +++ OK, passed 100 tests.
  10530. 662.00 s [vector] scanl': OK
  10531. 662.00 s [vector] +++ OK, passed 100 tests.
  10532. 662.01 s [vector] scanl1: OK
  10533. 662.01 s [vector] +++ OK, passed 100 tests.
  10534. 662.02 s [vector] scanl1': OK
  10535. 662.02 s [vector] +++ OK, passed 100 tests.
  10536. 662.02 s [vector] iscanl: OK
  10537. 662.03 s [vector] +++ OK, passed 100 tests.
  10538. 662.03 s [vector] iscanl': OK
  10539. 662.04 s [vector] +++ OK, passed 100 tests.
  10540. 662.04 s [vector] prescanr: OK
  10541. 662.04 s [vector] +++ OK, passed 100 tests.
  10542. 662.05 s [vector] prescanr': OK
  10543. 662.05 s [vector] +++ OK, passed 100 tests.
  10544. 662.05 s [vector] postscanr: OK
  10545. 662.06 s [vector] +++ OK, passed 100 tests.
  10546. 662.06 s [vector] postscanr': OK
  10547. 662.07 s [vector] +++ OK, passed 100 tests.
  10548. 662.07 s [vector] scanr: OK
  10549. 662.08 s [vector] +++ OK, passed 100 tests.
  10550. 662.08 s [vector] scanr': OK
  10551. 662.08 s [vector] +++ OK, passed 100 tests.
  10552. 662.08 s [vector] scanr1: OK
  10553. 662.08 s [vector] +++ OK, passed 100 tests.
  10554. 662.09 s [vector] scanr1': OK
  10555. 662.09 s [vector] +++ OK, passed 100 tests.
  10556. 662.10 s [vector] iscanr: OK
  10557. 662.10 s [vector] +++ OK, passed 100 tests.
  10558. 662.10 s [vector] iscanr': OK
  10559. 662.10 s [vector] +++ OK, passed 100 tests.
  10560. 662.11 s [vector] mut_read: OK
  10561. 662.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10562. 662.11 s [vector] mut_write: OK
  10563. 662.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10564. 662.11 s [vector] mut_modify: OK
  10565. 662.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10566. 662.12 s [vector] mut_generate: OK
  10567. 662.12 s [vector] +++ OK, passed 100 tests.
  10568. 662.12 s [vector] mut_generateM: OK (0.01s)
  10569. 662.13 s [vector] +++ OK, passed 100 tests.
  10570. 662.17 s [vector] mut_mapM_: OK (0.03s)
  10571. 662.17 s [vector] +++ OK, passed 100 tests.
  10572. 662.18 s [vector] mut_imapM_: OK (0.03s)
  10573. 662.18 s [vector] +++ OK, passed 100 tests.
  10574. 662.23 s [vector] mut_forM_: OK (0.03s)
  10575. 662.23 s [vector] +++ OK, passed 100 tests.
  10576. 662.24 s [vector] mut_iforM_: OK (0.03s)
  10577. 662.24 s [vector] +++ OK, passed 100 tests.
  10578. 662.24 s [vector] mut_foldr: OK
  10579. 662.24 s [vector] +++ OK, passed 100 tests.
  10580. 662.25 s [vector] mut_foldr': OK
  10581. 662.25 s [vector] +++ OK, passed 100 tests.
  10582. 662.27 s [vector] mut_foldl: OK
  10583. 662.27 s [vector] +++ OK, passed 100 tests.
  10584. 662.27 s [vector] mut_foldl': OK
  10585. 662.27 s [vector] +++ OK, passed 100 tests.
  10586. 662.27 s [vector] mut_ifoldr: OK
  10587. 662.27 s [vector] +++ OK, passed 100 tests.
  10588. 662.27 s [vector] mut_ifoldr': OK
  10589. 662.27 s [vector] +++ OK, passed 100 tests.
  10590. 662.28 s [vector] mut_ifoldl: OK
  10591. 662.28 s [vector] +++ OK, passed 100 tests.
  10592. 662.29 s [vector] mut_ifoldl': OK
  10593. 662.29 s [vector] +++ OK, passed 100 tests.
  10594. 662.29 s [vector] mut_foldM: OK
  10595. 662.29 s [vector] +++ OK, passed 100 tests.
  10596. 662.29 s [vector] mut_foldM': OK
  10597. 662.30 s [vector] +++ OK, passed 100 tests.
  10598. 662.30 s [vector] mut_foldrM: OK
  10599. 662.30 s [vector] +++ OK, passed 100 tests.
  10600. 662.30 s [vector] mut_foldrM': OK
  10601. 662.30 s [vector] +++ OK, passed 100 tests.
  10602. 662.31 s [vector] mut_ifoldM: OK
  10603. 662.32 s [vector] +++ OK, passed 100 tests.
  10604. 662.32 s [vector] mut_ifoldM': OK
  10605. 662.32 s [vector] +++ OK, passed 100 tests.
  10606. 662.32 s [vector] mut_ifoldrM: OK
  10607. 662.32 s [vector] +++ OK, passed 100 tests.
  10608. 662.33 s [vector] mut_ifoldrM': OK
  10609. 662.33 s [vector] +++ OK, passed 100 tests.
  10610. 662.33 s [vector] compare: OK
  10611. 662.33 s [vector] +++ OK, passed 100 tests.
  10612. 662.33 s [vector] maximum: OK
  10613. 662.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10614. 662.33 s [vector] minimum: OK
  10615. 662.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10616. 662.34 s [vector] minIndex: OK
  10617. 662.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10618. 662.34 s [vector] maxIndex: OK
  10619. 662.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10620. 662.34 s [vector] maximumBy: OK
  10621. 662.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10622. 662.34 s [vector] minimumBy: OK
  10623. 662.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10624. 662.34 s [vector] maximumOn: OK
  10625. 662.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10626. 662.34 s [vector] minimumOn: OK
  10627. 662.34 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10628. 662.34 s [vector] maxIndexBy: OK
  10629. 662.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10630. 662.34 s [vector] minIndexBy: OK
  10631. 662.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10632. 662.34 s [vector] ListFirstMaxIndexWins: OK
  10633. 662.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10634. 662.34 s [vector] FalseListFirstMaxIndexWins: OK
  10635. 662.34 s [vector] +++ OK, failed as expected. (after 1 test):
  10636. 662.34 s [vector] Exception:
  10637. 662.34 s [vector] Prelude.foldr1: empty list
  10638. 662.34 s [vector] CallStack (from HasCallStack):
  10639. 662.34 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10640. 662.34 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10641. 662.34 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10642. 662.34 s [vector] []
  10643. 662.35 s [vector] zip: OK
  10644. 662.35 s [vector] +++ OK, passed 100 tests.
  10645. 662.36 s [vector] zip3: OK
  10646. 662.36 s [vector] +++ OK, passed 100 tests.
  10647. 662.36 s [vector] unzip: OK
  10648. 662.36 s [vector] +++ OK, passed 100 tests.
  10649. 662.36 s [vector] unzip3: OK
  10650. 662.36 s [vector] +++ OK, passed 100 tests.
  10651. 662.36 s [vector] indexed: OK
  10652. 662.36 s [vector] +++ OK, passed 100 tests.
  10653. 662.37 s [vector] update: OK
  10654. 662.37 s [vector] +++ OK, passed 100 tests.
  10655. 662.37 s [vector] mempty: OK
  10656. 662.37 s [vector] +++ OK, passed 100 tests.
  10657. 662.37 s [vector] mappend: OK
  10658. 662.39 s [vector] +++ OK, passed 100 tests.
  10659. 662.41 s [vector] mconcat: OK (0.04s)
  10660. 662.41 s [vector] +++ OK, passed 100 tests.
  10661. 662.41 s [vector] glength: OK
  10662. 662.41 s [vector] +++ OK, passed 100 tests.
  10663. 662.42 s [vector] (Int,Bool,Int)
  10664. 662.42 s [vector] fromList.toList == id: OK
  10665. 662.42 s [vector] +++ OK, passed 100 tests.
  10666. 662.42 s [vector] toList.fromList == id: OK
  10667. 662.42 s [vector] +++ OK, passed 100 tests.
  10668. 662.42 s [vector] unstream.stream == id: OK
  10669. 662.42 s [vector] +++ OK, passed 100 tests.
  10670. 662.42 s [vector] stream.unstream == id: OK
  10671. 662.42 s [vector] +++ OK, passed 100 tests.
  10672. 662.42 s [vector] eq: OK
  10673. 662.42 s [vector] +++ OK, passed 100 tests.
  10674. 662.42 s [vector] length: OK
  10675. 662.42 s [vector] +++ OK, passed 100 tests.
  10676. 662.42 s [vector] null: OK
  10677. 662.42 s [vector] +++ OK, passed 100 tests.
  10678. 662.42 s [vector] index: OK
  10679. 662.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10680. 662.42 s [vector] safeIndex: OK
  10681. 662.43 s [vector] +++ OK, passed 100 tests.
  10682. 662.43 s [vector] head: OK
  10683. 662.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10684. 662.43 s [vector] last: OK
  10685. 662.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10686. 662.43 s [vector] unsafeIndex: OK
  10687. 662.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10688. 662.43 s [vector] unsafeHead: OK
  10689. 662.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10690. 662.43 s [vector] unsafeLast: OK
  10691. 662.43 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10692. 662.43 s [vector] slice: OK
  10693. 662.43 s [vector] +++ OK, passed 100 tests.
  10694. 662.45 s [vector] init: OK
  10695. 662.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10696. 662.45 s [vector] tail: OK (0.02s)
  10697. 662.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10698. 662.46 s [vector] take: OK
  10699. 662.46 s [vector] +++ OK, passed 100 tests.
  10700. 662.46 s [vector] drop: OK
  10701. 662.46 s [vector] +++ OK, passed 100 tests.
  10702. 662.46 s [vector] splitAt: OK
  10703. 662.46 s [vector] +++ OK, passed 100 tests.
  10704. 662.46 s [vector] empty: OK
  10705. 662.46 s [vector] +++ OK, passed 100 tests.
  10706. 662.46 s [vector] singleton: OK
  10707. 662.46 s [vector] +++ OK, passed 100 tests.
  10708. 662.46 s [vector] replicate: OK
  10709. 662.46 s [vector] +++ OK, passed 100 tests.
  10710. 662.46 s [vector] generate: OK
  10711. 662.46 s [vector] +++ OK, passed 100 tests.
  10712. 662.47 s [vector] iterateN: OK
  10713. 662.48 s [vector] +++ OK, passed 100 tests.
  10714. 662.52 s [vector] iterateNM: OK (0.04s)
  10715. 662.53 s [vector] +++ OK, passed 100 tests.
  10716. 662.54 s [vector] generateM: OK (0.03s)
  10717. 662.55 s [vector] +++ OK, passed 100 tests.
  10718. 662.56 s [vector] replicateM: OK (0.01s)
  10719. 662.56 s [vector] +++ OK, passed 100 tests.
  10720. 662.56 s [vector] create: OK
  10721. 662.56 s [vector] +++ OK, passed 100 tests.
  10722. 662.56 s [vector] createT: OK
  10723. 662.56 s [vector] +++ OK, passed 100 tests.
  10724. 662.56 s [vector] unfoldr: OK
  10725. 662.56 s [vector] +++ OK, passed 100 tests.
  10726. 662.56 s [vector] unfoldrN: OK
  10727. 662.56 s [vector] +++ OK, passed 100 tests.
  10728. 662.57 s [vector] unfoldrExactN: OK
  10729. 662.57 s [vector] +++ OK, passed 100 tests.
  10730. 662.57 s [vector] unfoldrM: OK
  10731. 662.57 s [vector] +++ OK, passed 100 tests.
  10732. 662.59 s [vector] unfoldrNM: OK
  10733. 662.59 s [vector] +++ OK, passed 100 tests.
  10734. 662.64 s [vector] unfoldrExactNM: OK (0.07s)
  10735. 662.65 s [vector] +++ OK, passed 100 tests.
  10736. 662.65 s [vector] constructN: OK (0.01s)
  10737. 662.65 s [vector] +++ OK, passed 100 tests.
  10738. 662.66 s [vector] constructrN: OK
  10739. 662.66 s [vector] +++ OK, passed 100 tests.
  10740. 662.66 s [vector] cons: OK
  10741. 662.66 s [vector] +++ OK, passed 100 tests.
  10742. 662.67 s [vector] snoc: OK
  10743. 662.67 s [vector] +++ OK, passed 100 tests.
  10744. 662.67 s [vector] append: OK
  10745. 662.69 s [vector] +++ OK, passed 100 tests.
  10746. 662.72 s [vector] concat: OK (0.05s)
  10747. 662.72 s [vector] +++ OK, passed 100 tests.
  10748. 662.73 s [vector] force: OK
  10749. 662.73 s [vector] +++ OK, passed 100 tests.
  10750. 662.74 s [vector] upd: OK
  10751. 662.74 s [vector] +++ OK, passed 100 tests.
  10752. 662.74 s [vector] accum: OK (0.01s)
  10753. 662.74 s [vector] +++ OK, passed 100 tests.
  10754. 662.74 s [vector] reverse: OK
  10755. 662.74 s [vector] +++ OK, passed 100 tests.
  10756. 662.74 s [vector] backpermute: OK
  10757. 662.74 s [vector] +++ OK, passed 100 tests.
  10758. 662.75 s [vector] map: OK
  10759. 662.76 s [vector] +++ OK, passed 100 tests.
  10760. 662.77 s [vector] imap: OK
  10761. 662.77 s [vector] +++ OK, passed 100 tests.
  10762. 662.77 s [vector] concatMap: OK
  10763. 662.77 s [vector] +++ OK, passed 100 tests.
  10764. 662.77 s [vector] mapM: OK
  10765. 662.77 s [vector] +++ OK, passed 100 tests.
  10766. 662.83 s [vector] mapM_: OK (0.04s)
  10767. 662.83 s [vector] +++ OK, passed 100 tests.
  10768. 662.85 s [vector] forM: OK
  10769. 662.85 s [vector] +++ OK, passed 100 tests.
  10770. 662.88 s [vector] forM_: OK (0.04s)
  10771. 662.88 s [vector] +++ OK, passed 100 tests.
  10772. 662.88 s [vector] imapM: OK
  10773. 662.88 s [vector] +++ OK, passed 100 tests.
  10774. 662.92 s [vector] imapM_: OK (0.04s)
  10775. 662.92 s [vector] +++ OK, passed 100 tests.
  10776. 662.95 s [vector] zipWith: OK
  10777. 662.95 s [vector] +++ OK, passed 100 tests.
  10778. 663.22 s [vector] zipWith3: OK (0.02s)
  10779. 663.22 s [vector] +++ OK, passed 100 tests.
  10780. 663.22 s [vector] izipWith: OK
  10781. 663.22 s [vector] +++ OK, passed 100 tests.
  10782. 663.22 s [vector] izipWith3: OK
  10783. 663.22 s [vector] +++ OK, passed 100 tests.
  10784. 663.22 s [vector] izipWithM: OK
  10785. 663.22 s [vector] +++ OK, passed 100 tests.
  10786. 663.22 s [vector] izipWithM_: OK (0.04s)
  10787. 663.22 s [vector] +++ OK, passed 100 tests.
  10788. 663.22 s [vector] zipWithM: OK
  10789. 663.22 s [vector] +++ OK, passed 100 tests.
  10790. 663.22 s [vector] zipWithM_: OK (0.04s)
  10791. 663.22 s [vector] +++ OK, passed 100 tests.
  10792. 663.22 s [vector] filter: OK
  10793. 663.22 s [vector] +++ OK, passed 100 tests.
  10794. 663.22 s [vector] ifilter: OK
  10795. 663.22 s [vector] +++ OK, passed 100 tests.
  10796. 663.22 s [vector] filterM: OK (0.08s)
  10797. 663.22 s [vector] +++ OK, passed 100 tests.
  10798. 663.22 s [vector] uniq: OK
  10799. 663.22 s [vector] +++ OK, passed 100 tests.
  10800. 663.23 s [vector] mapMaybe: OK
  10801. 663.23 s [vector] +++ OK, passed 100 tests.
  10802. 663.23 s [vector] imapMaybe: OK
  10803. 663.23 s [vector] +++ OK, passed 100 tests.
  10804. 663.23 s [vector] takeWhile: OK
  10805. 663.23 s [vector] +++ OK, passed 100 tests.
  10806. 663.23 s [vector] dropWhile: OK
  10807. 663.23 s [vector] +++ OK, passed 100 tests.
  10808. 663.23 s [vector] partition: OK
  10809. 663.23 s [vector] +++ OK, passed 100 tests.
  10810. 663.23 s [vector] partitionWith: OK
  10811. 663.23 s [vector] +++ OK, passed 100 tests.
  10812. 663.23 s [vector] span: OK
  10813. 663.23 s [vector] +++ OK, passed 100 tests.
  10814. 663.23 s [vector] break: OK
  10815. 663.23 s [vector] +++ OK, passed 100 tests.
  10816. 663.23 s [vector] spanR: OK
  10817. 663.23 s [vector] +++ OK, passed 100 tests.
  10818. 663.23 s [vector] breakR: OK
  10819. 663.23 s [vector] +++ OK, passed 100 tests.
  10820. 663.23 s [vector] groupBy: OK
  10821. 663.23 s [vector] +++ OK, passed 100 tests.
  10822. 663.23 s [vector] elem: OK
  10823. 663.23 s [vector] +++ OK, passed 100 tests.
  10824. 663.23 s [vector] notElem: OK
  10825. 663.23 s [vector] +++ OK, passed 100 tests.
  10826. 663.23 s [vector] find: OK
  10827. 663.23 s [vector] +++ OK, passed 100 tests.
  10828. 663.23 s [vector] findIndex: OK
  10829. 663.23 s [vector] +++ OK, passed 100 tests.
  10830. 663.23 s [vector] findIndexR: OK
  10831. 663.23 s [vector] +++ OK, passed 100 tests.
  10832. 663.23 s [vector] findIndices: OK
  10833. 663.23 s [vector] +++ OK, passed 100 tests.
  10834. 663.23 s [vector] elemIndex: OK
  10835. 663.23 s [vector] +++ OK, passed 100 tests.
  10836. 663.23 s [vector] elemIndices: OK
  10837. 663.23 s [vector] +++ OK, passed 100 tests.
  10838. 663.23 s [vector] foldl: OK
  10839. 663.23 s [vector] +++ OK, passed 100 tests.
  10840. 663.24 s [vector] foldl1: OK
  10841. 663.24 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10842. 663.24 s [vector] foldl': OK
  10843. 663.25 s [vector] +++ OK, passed 100 tests.
  10844. 663.25 s [vector] foldl1': OK
  10845. 663.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10846. 663.26 s [vector] foldr: OK
  10847. 663.27 s [vector] +++ OK, passed 100 tests.
  10848. 663.27 s [vector] foldr1: OK
  10849. 663.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10850. 663.27 s [vector] foldr': OK
  10851. 663.28 s [vector] +++ OK, passed 100 tests.
  10852. 663.29 s [vector] foldr1': OK
  10853. 663.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10854. 663.30 s [vector] ifoldl: OK (0.01s)
  10855. 663.30 s [vector] +++ OK, passed 100 tests.
  10856. 663.31 s [vector] ifoldl': OK
  10857. 663.31 s [vector] +++ OK, passed 100 tests.
  10858. 663.32 s [vector] ifoldr: OK (0.01s)
  10859. 663.32 s [vector] +++ OK, passed 100 tests.
  10860. 663.33 s [vector] ifoldr': OK (0.01s)
  10861. 663.33 s [vector] +++ OK, passed 100 tests.
  10862. 663.33 s [vector] ifoldM: OK
  10863. 663.34 s [vector] +++ OK, passed 100 tests.
  10864. 663.35 s [vector] ifoldM': OK
  10865. 663.35 s [vector] +++ OK, passed 100 tests.
  10866. 663.41 s [vector] ifoldM_: OK (0.05s)
  10867. 663.41 s [vector] +++ OK, passed 100 tests.
  10868. 663.44 s [vector] ifoldM'_: OK (0.05s)
  10869. 663.45 s [vector] +++ OK, passed 100 tests.
  10870. 663.45 s [vector] all: OK
  10871. 663.45 s [vector] +++ OK, passed 100 tests.
  10872. 663.45 s [vector] any: OK
  10873. 663.45 s [vector] +++ OK, passed 100 tests.
  10874. 663.46 s [vector] prescanl: OK
  10875. 663.46 s [vector] +++ OK, passed 100 tests.
  10876. 663.48 s [vector] prescanl': OK (0.01s)
  10877. 663.48 s [vector] +++ OK, passed 100 tests.
  10878. 663.48 s [vector] postscanl: OK (0.01s)
  10879. 663.48 s [vector] +++ OK, passed 100 tests.
  10880. 663.49 s [vector] postscanl': OK
  10881. 663.49 s [vector] +++ OK, passed 100 tests.
  10882. 663.51 s [vector] scanl: OK (0.01s)
  10883. 663.51 s [vector] +++ OK, passed 100 tests.
  10884. 663.52 s [vector] scanl': OK (0.01s)
  10885. 663.52 s [vector] +++ OK, passed 100 tests.
  10886. 663.52 s [vector] scanl1: OK
  10887. 663.52 s [vector] +++ OK, passed 100 tests.
  10888. 663.54 s [vector] scanl1': OK
  10889. 663.54 s [vector] +++ OK, passed 100 tests.
  10890. 663.54 s [vector] iscanl: OK (0.01s)
  10891. 663.54 s [vector] +++ OK, passed 100 tests.
  10892. 663.56 s [vector] iscanl': OK (0.01s)
  10893. 663.56 s [vector] +++ OK, passed 100 tests.
  10894. 663.56 s [vector] prescanr: OK
  10895. 663.56 s [vector] +++ OK, passed 100 tests.
  10896. 663.57 s [vector] prescanr': OK
  10897. 663.57 s [vector] +++ OK, passed 100 tests.
  10898. 663.58 s [vector] postscanr: OK
  10899. 663.58 s [vector] +++ OK, passed 100 tests.
  10900. 663.59 s [vector] postscanr': OK
  10901. 663.59 s [vector] +++ OK, passed 100 tests.
  10902. 663.60 s [vector] scanr: OK
  10903. 663.60 s [vector] +++ OK, passed 100 tests.
  10904. 663.60 s [vector] scanr': OK
  10905. 663.60 s [vector] +++ OK, passed 100 tests.
  10906. 663.61 s [vector] scanr1: OK
  10907. 663.62 s [vector] +++ OK, passed 100 tests.
  10908. 663.63 s [vector] scanr1': OK
  10909. 663.63 s [vector] +++ OK, passed 100 tests.
  10910. 663.63 s [vector] iscanr: OK
  10911. 663.63 s [vector] +++ OK, passed 100 tests.
  10912. 663.64 s [vector] iscanr': OK
  10913. 663.64 s [vector] +++ OK, passed 100 tests.
  10914. 663.64 s [vector] mut_read: OK
  10915. 663.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10916. 663.64 s [vector] mut_write: OK
  10917. 663.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10918. 663.64 s [vector] mut_modify: OK
  10919. 663.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10920. 663.65 s [vector] mut_generate: OK
  10921. 663.65 s [vector] +++ OK, passed 100 tests.
  10922. 663.68 s [vector] mut_generateM: OK (0.04s)
  10923. 663.69 s [vector] +++ OK, passed 100 tests.
  10924. 663.75 s [vector] mut_mapM_: OK (0.04s)
  10925. 663.75 s [vector] +++ OK, passed 100 tests.
  10926. 663.79 s [vector] mut_imapM_: OK (0.05s)
  10927. 663.79 s [vector] +++ OK, passed 100 tests.
  10928. 663.83 s [vector] mut_forM_: OK (0.04s)
  10929. 663.83 s [vector] +++ OK, passed 100 tests.
  10930. 663.88 s [vector] mut_iforM_: OK (0.05s)
  10931. 663.88 s [vector] +++ OK, passed 100 tests.
  10932. 663.89 s [vector] mut_foldr: OK (0.01s)
  10933. 663.89 s [vector] +++ OK, passed 100 tests.
  10934. 663.90 s [vector] mut_foldr': OK (0.02s)
  10935. 663.91 s [vector] +++ OK, passed 100 tests.
  10936. 663.92 s [vector] mut_foldl: OK (0.01s)
  10937. 663.92 s [vector] +++ OK, passed 100 tests.
  10938. 663.93 s [vector] mut_foldl': OK
  10939. 663.93 s [vector] +++ OK, passed 100 tests.
  10940. 663.94 s [vector] mut_ifoldr: OK (0.01s)
  10941. 663.95 s [vector] +++ OK, passed 100 tests.
  10942. 663.95 s [vector] mut_ifoldr': OK (0.01s)
  10943. 663.95 s [vector] +++ OK, passed 100 tests.
  10944. 663.96 s [vector] mut_ifoldl: OK
  10945. 663.96 s [vector] +++ OK, passed 100 tests.
  10946. 663.97 s [vector] mut_ifoldl': OK (0.01s)
  10947. 663.97 s [vector] +++ OK, passed 100 tests.
  10948. 663.99 s [vector] mut_foldM: OK (0.01s)
  10949. 663.99 s [vector] +++ OK, passed 100 tests.
  10950. 664.00 s [vector] mut_foldM': OK (0.02s)
  10951. 664.00 s [vector] +++ OK, passed 100 tests.
  10952. 664.02 s [vector] mut_foldrM: OK (0.01s)
  10953. 664.02 s [vector] +++ OK, passed 100 tests.
  10954. 664.03 s [vector] mut_foldrM': OK (0.01s)
  10955. 664.03 s [vector] +++ OK, passed 100 tests.
  10956. 664.05 s [vector] mut_ifoldM: OK (0.02s)
  10957. 664.05 s [vector] +++ OK, passed 100 tests.
  10958. 664.07 s [vector] mut_ifoldM': OK (0.02s)
  10959. 664.07 s [vector] +++ OK, passed 100 tests.
  10960. 664.09 s [vector] mut_ifoldrM: OK (0.02s)
  10961. 664.09 s [vector] +++ OK, passed 100 tests.
  10962. 664.09 s [vector] mut_ifoldrM': OK (0.01s)
  10963. 664.09 s [vector] +++ OK, passed 100 tests.
  10964. 664.10 s [vector] compare: OK
  10965. 664.10 s [vector] +++ OK, passed 100 tests.
  10966. 664.10 s [vector] maximum: OK
  10967. 664.10 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10968. 664.10 s [vector] minimum: OK
  10969. 664.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10970. 664.10 s [vector] minIndex: OK
  10971. 664.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10972. 664.10 s [vector] maxIndex: OK
  10973. 664.10 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10974. 664.10 s [vector] maximumBy: OK
  10975. 664.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10976. 664.10 s [vector] minimumBy: OK
  10977. 664.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10978. 664.11 s [vector] maximumOn: OK
  10979. 664.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10980. 664.11 s [vector] minimumOn: OK
  10981. 664.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10982. 664.11 s [vector] maxIndexBy: OK
  10983. 664.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10984. 664.11 s [vector] minIndexBy: OK
  10985. 664.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10986. 664.12 s [vector] ListFirstMaxIndexWins: OK
  10987. 664.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10988. 664.12 s [vector] FalseListFirstMaxIndexWins: OK
  10989. 664.13 s [vector] +++ OK, failed as expected. (after 1 test):
  10990. 664.13 s [vector] Exception:
  10991. 664.13 s [vector] Prelude.foldr1: empty list
  10992. 664.13 s [vector] CallStack (from HasCallStack):
  10993. 664.13 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  10994. 664.13 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  10995. 664.13 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10996. 664.13 s [vector] []
  10997. 664.15 s [vector] zip: OK (0.01s)
  10998. 664.15 s [vector] +++ OK, passed 100 tests.
  10999. 664.17 s [vector] zip3: OK (0.02s)
  11000. 664.17 s [vector] +++ OK, passed 100 tests.
  11001. 664.18 s [vector] unzip: OK (0.02s)
  11002. 664.18 s [vector] +++ OK, passed 100 tests.
  11003. 664.20 s [vector] unzip3: OK (0.02s)
  11004. 664.20 s [vector] +++ OK, passed 100 tests.
  11005. 664.20 s [vector] indexed: OK
  11006. 664.21 s [vector] +++ OK, passed 100 tests.
  11007. 664.21 s [vector] update: OK (0.01s)
  11008. 664.21 s [vector] +++ OK, passed 100 tests.
  11009. 664.22 s [vector] mempty: OK
  11010. 664.23 s [vector] +++ OK, passed 100 tests.
  11011. 664.25 s [vector] mappend: OK (0.01s)
  11012. 664.25 s [vector] +++ OK, passed 100 tests.
  11013. 664.33 s [vector] mconcat: OK (0.09s)
  11014. 664.33 s [vector] +++ OK, passed 100 tests.
  11015. 664.34 s [vector] glength: OK (0.01s)
  11016. 664.34 s [vector] +++ OK, passed 100 tests.
  11017. 664.34 s [vector] unstream
  11018. 664.34 s [vector] unstream == vunstream (exact): OK
  11019. 664.35 s [vector] +++ OK, passed 100 tests.
  11020. 664.35 s [vector] unstream == vunstream (unknown): OK
  11021. 664.35 s [vector] +++ OK, passed 100 tests.
  11022. 664.35 s [vector] unstreamR ~= vunstream (exact): OK
  11023. 664.35 s [vector] +++ OK, passed 100 tests.
  11024. 664.35 s [vector] unstreamR ~= vunstream (unknown): OK
  11025. 664.35 s [vector] +++ OK, passed 100 tests.
  11026. 664.35 s [vector] Data.Vector.Storable.Vector Alignment
  11027. 664.35 s [vector] Aligned Double: OK
  11028. 664.35 s [vector] Aligned Int: OK
  11029. 664.35 s [vector] Regression tests
  11030. 664.35 s [vector] enumFromTo crash #188
  11031. 664.35 s [vector] Word8: OK
  11032. 664.35 s [vector] Word16: OK
  11033. 664.35 s [vector] Word32: OK
  11034. 664.35 s [vector] Word64: OK
  11035. 664.35 s [vector] Word: OK
  11036. 664.35 s [vector] Int8: OK
  11037. 664.35 s [vector] Int16: OK
  11038. 664.35 s [vector] Int32: OK
  11039. 664.35 s [vector] Int64: OK
  11040. 664.35 s [vector] Int: OK
  11041. 664.35 s [vector] Char: OK
  11042. 664.35 s [vector] Negative tests
  11043. 664.35 s [vector] slice out of bounds #257
  11044. 664.36 s [vector] Boxed
  11045. 664.36 s [vector] Negative ix: OK
  11046. 664.36 s [vector] Negative size: OK
  11047. 664.36 s [vector] Negative ix and size: OK
  11048. 664.36 s [vector] Too large ix: OK
  11049. 664.36 s [vector] Too large size: OK
  11050. 664.36 s [vector] Too large ix and size: OK
  11051. 664.36 s [vector] Overflow: OK
  11052. 664.36 s [vector] OutOfMemory: OK
  11053. 664.36 s [vector] Primitive
  11054. 664.36 s [vector] Negative ix: OK
  11055. 664.36 s [vector] Negative size: OK
  11056. 664.36 s [vector] Negative ix and size: OK
  11057. 664.36 s [vector] Too large ix: OK
  11058. 664.36 s [vector] Too large size: OK
  11059. 664.36 s [vector] Too large ix and size: OK
  11060. 664.36 s [vector] Overflow: OK
  11061. 664.36 s [vector] OutOfMemory: OK
  11062. 664.36 s [vector] Storable
  11063. 664.36 s [vector] Negative ix: OK
  11064. 664.36 s [vector] Negative size: OK
  11065. 664.36 s [vector] Negative ix and size: OK
  11066. 664.36 s [vector] Too large ix: OK
  11067. 664.36 s [vector] Too large size: OK
  11068. 664.36 s [vector] Too large ix and size: OK
  11069. 664.36 s [vector] Overflow: OK
  11070. 664.36 s [vector] OutOfMemory: OK
  11071. 664.36 s [vector] Unboxed
  11072. 664.36 s [vector] Negative ix: OK
  11073. 664.36 s [vector] Negative size: OK
  11074. 664.36 s [vector] Negative ix and size: OK
  11075. 664.36 s [vector] Too large ix: OK
  11076. 664.36 s [vector] Too large size: OK
  11077. 664.36 s [vector] Too large ix and size: OK
  11078. 664.36 s [vector] Overflow: OK
  11079. 664.36 s [vector] OutOfMemory: OK
  11080. 664.36 s [vector] take #282
  11081. 664.36 s [vector] Boxed: OK
  11082. 664.36 s [vector] Primitive: OK
  11083. 664.36 s [vector] Storable: OK
  11084. 664.36 s [vector] Unboxed: OK
  11085. 664.36 s [vector] Data.Vector
  11086. 664.36 s [vector] MonadFix: OK
  11087. 664.36 s [vector] toFromArray: OK
  11088. 664.36 s [vector] toFromArraySlice: OK
  11089. 664.36 s [vector] toFromArraySliceUnsafe: OK
  11090. 664.36 s [vector] toFromMutableArray: OK
  11091. 664.36 s [vector] Data.Vector.Mutable (Move): OK
  11092. 664.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11093. 664.36 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  11094. 664.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11095. 664.36 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  11096. 664.36 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11097. 664.37 s [vector] Data.Vector.Storable.Mutable (Move): OK
  11098. 664.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11099. 664.38 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  11100. 664.38 s [vector] +++ OK, passed 100 tests.
  11101. 664.38 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  11102. 664.38 s [vector] +++ OK, passed 100 tests.
  11103. 664.38 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  11104. 664.38 s [vector] +++ OK, passed 100 tests.
  11105. 664.38 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  11106. 664.38 s [vector] +++ OK, passed 100 tests.
  11107. 664.38 s [vector]
  11108. 664.38 s [vector] All 2808 tests passed (16.43s)
  11109. 664.41 s [vector] Test suite vector-tests-O0: PASS
  11110. 664.41 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  11111. 664.41 s [vector] Test suite vector-tests-O2: RUNNING...
  11112. 664.43 s [vector] toplevel
  11113. 664.43 s [vector] Data.Vector.Fusion.Bundle
  11114. 664.44 s [vector] fromList.toList == id: OK
  11115. 664.44 s [vector] +++ OK, passed 100 tests.
  11116. 664.44 s [vector] toList.fromList == id: OK
  11117. 664.44 s [vector] +++ OK, passed 100 tests.
  11118. 664.44 s [vector] eq: OK
  11119. 664.44 s [vector] +++ OK, passed 100 tests.
  11120. 664.44 s [vector] length: OK
  11121. 664.44 s [vector] +++ OK, passed 100 tests.
  11122. 664.44 s [vector] null: OK
  11123. 664.45 s [vector] +++ OK, passed 100 tests.
  11124. 664.45 s [vector] empty: OK
  11125. 664.45 s [vector] +++ OK, passed 100 tests.
  11126. 664.45 s [vector] singleton: OK
  11127. 664.45 s [vector] +++ OK, passed 100 tests.
  11128. 664.46 s [vector] replicate: OK
  11129. 664.46 s [vector] +++ OK, passed 100 tests.
  11130. 664.46 s [vector] cons: OK (0.01s)
  11131. 664.46 s [vector] +++ OK, passed 100 tests.
  11132. 664.46 s [vector] snoc: OK
  11133. 664.46 s [vector] +++ OK, passed 100 tests.
  11134. 664.46 s [vector] append: OK
  11135. 664.46 s [vector] +++ OK, passed 100 tests.
  11136. 664.46 s [vector] head: OK
  11137. 664.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11138. 664.46 s [vector] last: OK
  11139. 664.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11140. 664.46 s [vector] index: OK
  11141. 664.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11142. 664.46 s [vector] extract: OK
  11143. 664.46 s [vector] +++ OK, passed 100 tests.
  11144. 664.46 s [vector] init: OK
  11145. 664.46 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11146. 664.46 s [vector] tail: OK
  11147. 664.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11148. 664.46 s [vector] take: OK
  11149. 664.46 s [vector] +++ OK, passed 100 tests.
  11150. 664.47 s [vector] drop: OK
  11151. 664.47 s [vector] +++ OK, passed 100 tests.
  11152. 664.47 s [vector] map: OK
  11153. 664.47 s [vector] +++ OK, passed 100 tests.
  11154. 664.47 s [vector] zipWith: OK
  11155. 664.47 s [vector] +++ OK, passed 100 tests.
  11156. 664.47 s [vector] zipWith3: OK
  11157. 664.47 s [vector] +++ OK, passed 100 tests.
  11158. 664.47 s [vector] filter: OK
  11159. 664.47 s [vector] +++ OK, passed 100 tests.
  11160. 664.47 s [vector] takeWhile: OK
  11161. 664.47 s [vector] +++ OK, passed 100 tests.
  11162. 664.47 s [vector] dropWhile: OK
  11163. 664.47 s [vector] +++ OK, passed 100 tests.
  11164. 664.47 s [vector] elem: OK
  11165. 664.47 s [vector] +++ OK, passed 100 tests.
  11166. 664.47 s [vector] notElem: OK
  11167. 664.47 s [vector] +++ OK, passed 100 tests.
  11168. 664.47 s [vector] find: OK
  11169. 664.47 s [vector] +++ OK, passed 100 tests.
  11170. 664.47 s [vector] findIndex: OK
  11171. 664.47 s [vector] +++ OK, passed 100 tests.
  11172. 664.48 s [vector] foldl: OK
  11173. 664.48 s [vector] +++ OK, passed 100 tests.
  11174. 664.48 s [vector] foldl1: OK
  11175. 664.48 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11176. 664.48 s [vector] foldl': OK
  11177. 664.48 s [vector] +++ OK, passed 100 tests.
  11178. 664.48 s [vector] foldl1': OK
  11179. 664.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11180. 664.48 s [vector] foldr: OK
  11181. 664.48 s [vector] +++ OK, passed 100 tests.
  11182. 664.48 s [vector] foldr1: OK
  11183. 664.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11184. 664.48 s [vector] prescanl: OK
  11185. 664.49 s [vector] +++ OK, passed 100 tests.
  11186. 664.49 s [vector] prescanl': OK
  11187. 664.49 s [vector] +++ OK, passed 100 tests.
  11188. 664.49 s [vector] postscanl: OK
  11189. 664.49 s [vector] +++ OK, passed 100 tests.
  11190. 664.49 s [vector] postscanl': OK
  11191. 664.49 s [vector] +++ OK, passed 100 tests.
  11192. 664.49 s [vector] scanl: OK
  11193. 664.49 s [vector] +++ OK, passed 100 tests.
  11194. 664.49 s [vector] scanl': OK
  11195. 664.49 s [vector] +++ OK, passed 100 tests.
  11196. 664.50 s [vector] scanl1: OK
  11197. 664.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11198. 664.50 s [vector] scanl1': OK
  11199. 664.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11200. 664.50 s [vector] concatMap: OK
  11201. 664.50 s [vector] +++ OK, passed 100 tests.
  11202. 664.50 s [vector] unfoldr: OK
  11203. 664.50 s [vector] +++ OK, passed 100 tests.
  11204. 664.50 s [vector] and: OK
  11205. 664.50 s [vector] +++ OK, passed 100 tests.
  11206. 664.50 s [vector] or: OK
  11207. 664.50 s [vector] +++ OK, passed 100 tests.
  11208. 664.50 s [vector] Tests.Vector.Boxed
  11209. 664.50 s [vector] Bool
  11210. 664.50 s [vector] fromList.toList == id: OK
  11211. 664.50 s [vector] +++ OK, passed 100 tests.
  11212. 664.50 s [vector] toList.fromList == id: OK
  11213. 664.50 s [vector] +++ OK, passed 100 tests.
  11214. 664.50 s [vector] unstream.stream == id: OK
  11215. 664.50 s [vector] +++ OK, passed 100 tests.
  11216. 664.50 s [vector] stream.unstream == id: OK
  11217. 664.50 s [vector] +++ OK, passed 100 tests.
  11218. 664.50 s [vector] eq: OK
  11219. 664.50 s [vector] +++ OK, passed 100 tests.
  11220. 664.50 s [vector] length: OK
  11221. 664.50 s [vector] +++ OK, passed 100 tests.
  11222. 664.50 s [vector] null: OK
  11223. 664.50 s [vector] +++ OK, passed 100 tests.
  11224. 664.50 s [vector] index: OK
  11225. 664.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11226. 664.50 s [vector] safeIndex: OK
  11227. 664.50 s [vector] +++ OK, passed 100 tests.
  11228. 664.50 s [vector] head: OK
  11229. 664.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11230. 664.50 s [vector] last: OK
  11231. 664.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11232. 664.50 s [vector] unsafeIndex: OK
  11233. 664.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11234. 664.50 s [vector] unsafeHead: OK
  11235. 664.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11236. 664.50 s [vector] unsafeLast: OK
  11237. 664.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11238. 664.50 s [vector] slice: OK
  11239. 664.50 s [vector] +++ OK, passed 100 tests.
  11240. 664.50 s [vector] init: OK
  11241. 664.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11242. 664.50 s [vector] tail: OK
  11243. 664.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11244. 664.50 s [vector] take: OK
  11245. 664.50 s [vector] +++ OK, passed 100 tests.
  11246. 664.51 s [vector] drop: OK
  11247. 664.51 s [vector] +++ OK, passed 100 tests.
  11248. 664.51 s [vector] splitAt: OK
  11249. 664.51 s [vector] +++ OK, passed 100 tests.
  11250. 664.51 s [vector] empty: OK
  11251. 664.51 s [vector] +++ OK, passed 100 tests.
  11252. 664.51 s [vector] singleton: OK
  11253. 664.51 s [vector] +++ OK, passed 100 tests.
  11254. 664.51 s [vector] replicate: OK
  11255. 664.51 s [vector] +++ OK, passed 100 tests.
  11256. 664.51 s [vector] generate: OK
  11257. 664.51 s [vector] +++ OK, passed 100 tests.
  11258. 664.51 s [vector] iterateN: OK
  11259. 664.51 s [vector] +++ OK, passed 100 tests.
  11260. 664.53 s [vector] iterateNM: OK
  11261. 664.53 s [vector] +++ OK, passed 100 tests.
  11262. 664.53 s [vector] generateM: OK (0.01s)
  11263. 664.53 s [vector] +++ OK, passed 100 tests.
  11264. 664.55 s [vector] replicateM: OK
  11265. 664.55 s [vector] +++ OK, passed 100 tests.
  11266. 664.55 s [vector] create: OK
  11267. 664.55 s [vector] +++ OK, passed 100 tests.
  11268. 664.55 s [vector] createT: OK
  11269. 664.55 s [vector] +++ OK, passed 100 tests.
  11270. 664.55 s [vector] unfoldr: OK
  11271. 664.55 s [vector] +++ OK, passed 100 tests.
  11272. 664.55 s [vector] unfoldrN: OK
  11273. 664.55 s [vector] +++ OK, passed 100 tests.
  11274. 664.55 s [vector] unfoldrExactN: OK
  11275. 664.55 s [vector] +++ OK, passed 100 tests.
  11276. 664.55 s [vector] unfoldrM: OK
  11277. 664.55 s [vector] +++ OK, passed 100 tests.
  11278. 664.55 s [vector] unfoldrNM: OK
  11279. 664.57 s [vector] +++ OK, passed 100 tests.
  11280. 664.57 s [vector] unfoldrExactNM: OK (0.01s)
  11281. 664.57 s [vector] +++ OK, passed 100 tests.
  11282. 664.57 s [vector] constructN: OK
  11283. 664.57 s [vector] +++ OK, passed 100 tests.
  11284. 664.57 s [vector] constructrN: OK
  11285. 664.57 s [vector] +++ OK, passed 100 tests.
  11286. 664.57 s [vector] cons: OK
  11287. 664.57 s [vector] +++ OK, passed 100 tests.
  11288. 664.57 s [vector] snoc: OK
  11289. 664.57 s [vector] +++ OK, passed 100 tests.
  11290. 664.58 s [vector] append: OK
  11291. 664.58 s [vector] +++ OK, passed 100 tests.
  11292. 664.58 s [vector] concat: OK
  11293. 664.58 s [vector] +++ OK, passed 100 tests.
  11294. 664.58 s [vector] force: OK
  11295. 664.58 s [vector] +++ OK, passed 100 tests.
  11296. 664.58 s [vector] upd: OK
  11297. 664.58 s [vector] +++ OK, passed 100 tests.
  11298. 664.59 s [vector] accum: OK
  11299. 664.59 s [vector] +++ OK, passed 100 tests.
  11300. 664.59 s [vector] reverse: OK
  11301. 664.59 s [vector] +++ OK, passed 100 tests.
  11302. 664.59 s [vector] backpermute: OK
  11303. 664.59 s [vector] +++ OK, passed 100 tests.
  11304. 664.59 s [vector] map: OK
  11305. 664.59 s [vector] +++ OK, passed 100 tests.
  11306. 664.59 s [vector] imap: OK
  11307. 664.59 s [vector] +++ OK, passed 100 tests.
  11308. 664.59 s [vector] concatMap: OK
  11309. 664.59 s [vector] +++ OK, passed 100 tests.
  11310. 664.60 s [vector] mapM: OK
  11311. 664.60 s [vector] +++ OK, passed 100 tests.
  11312. 664.60 s [vector] mapM_: OK
  11313. 664.60 s [vector] +++ OK, passed 100 tests.
  11314. 664.61 s [vector] forM: OK
  11315. 664.61 s [vector] +++ OK, passed 100 tests.
  11316. 664.61 s [vector] forM_: OK
  11317. 664.61 s [vector] +++ OK, passed 100 tests.
  11318. 664.62 s [vector] imapM: OK
  11319. 664.62 s [vector] +++ OK, passed 100 tests.
  11320. 664.62 s [vector] imapM_: OK
  11321. 664.62 s [vector] +++ OK, passed 100 tests.
  11322. 664.63 s [vector] zipWith: OK
  11323. 664.63 s [vector] +++ OK, passed 100 tests.
  11324. 664.63 s [vector] zipWith3: OK
  11325. 664.63 s [vector] +++ OK, passed 100 tests.
  11326. 664.63 s [vector] izipWith: OK
  11327. 664.63 s [vector] +++ OK, passed 100 tests.
  11328. 664.63 s [vector] izipWith3: OK
  11329. 664.63 s [vector] +++ OK, passed 100 tests.
  11330. 664.63 s [vector] izipWithM: OK
  11331. 664.63 s [vector] +++ OK, passed 100 tests.
  11332. 664.64 s [vector] izipWithM_: OK
  11333. 664.64 s [vector] +++ OK, passed 100 tests.
  11334. 664.64 s [vector] zipWithM: OK
  11335. 664.64 s [vector] +++ OK, passed 100 tests.
  11336. 664.64 s [vector] zipWithM_: OK
  11337. 664.65 s [vector] +++ OK, passed 100 tests.
  11338. 664.65 s [vector] filter: OK
  11339. 664.65 s [vector] +++ OK, passed 100 tests.
  11340. 664.65 s [vector] ifilter: OK
  11341. 664.65 s [vector] +++ OK, passed 100 tests.
  11342. 664.66 s [vector] filterM: OK (0.01s)
  11343. 664.66 s [vector] +++ OK, passed 100 tests.
  11344. 664.66 s [vector] uniq: OK
  11345. 664.66 s [vector] +++ OK, passed 100 tests.
  11346. 664.66 s [vector] mapMaybe: OK
  11347. 664.66 s [vector] +++ OK, passed 100 tests.
  11348. 664.66 s [vector] imapMaybe: OK
  11349. 664.66 s [vector] +++ OK, passed 100 tests.
  11350. 664.66 s [vector] takeWhile: OK
  11351. 664.66 s [vector] +++ OK, passed 100 tests.
  11352. 664.67 s [vector] dropWhile: OK
  11353. 664.67 s [vector] +++ OK, passed 100 tests.
  11354. 664.67 s [vector] partition: OK
  11355. 664.67 s [vector] +++ OK, passed 100 tests.
  11356. 664.67 s [vector] partitionWith: OK
  11357. 664.67 s [vector] +++ OK, passed 100 tests.
  11358. 664.67 s [vector] span: OK
  11359. 664.67 s [vector] +++ OK, passed 100 tests.
  11360. 664.67 s [vector] break: OK
  11361. 664.67 s [vector] +++ OK, passed 100 tests.
  11362. 664.67 s [vector] spanR: OK
  11363. 664.67 s [vector] +++ OK, passed 100 tests.
  11364. 664.67 s [vector] breakR: OK
  11365. 664.67 s [vector] +++ OK, passed 100 tests.
  11366. 664.67 s [vector] groupBy: OK
  11367. 664.67 s [vector] +++ OK, passed 100 tests.
  11368. 664.67 s [vector] elem: OK
  11369. 664.67 s [vector] +++ OK, passed 100 tests.
  11370. 664.67 s [vector] notElem: OK
  11371. 664.67 s [vector] +++ OK, passed 100 tests.
  11372. 664.67 s [vector] find: OK
  11373. 664.67 s [vector] +++ OK, passed 100 tests.
  11374. 664.67 s [vector] findIndex: OK
  11375. 664.67 s [vector] +++ OK, passed 100 tests.
  11376. 664.67 s [vector] findIndexR: OK
  11377. 664.67 s [vector] +++ OK, passed 100 tests.
  11378. 664.67 s [vector] findIndices: OK
  11379. 664.67 s [vector] +++ OK, passed 100 tests.
  11380. 664.67 s [vector] elemIndex: OK
  11381. 664.67 s [vector] +++ OK, passed 100 tests.
  11382. 664.69 s [vector] elemIndices: OK
  11383. 664.69 s [vector] +++ OK, passed 100 tests.
  11384. 664.69 s [vector] foldl: OK (0.01s)
  11385. 664.69 s [vector] +++ OK, passed 100 tests.
  11386. 664.69 s [vector] foldl1: OK
  11387. 664.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11388. 664.69 s [vector] foldl': OK
  11389. 664.69 s [vector] +++ OK, passed 100 tests.
  11390. 664.69 s [vector] foldl1': OK
  11391. 664.69 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11392. 664.69 s [vector] foldr: OK
  11393. 664.69 s [vector] +++ OK, passed 100 tests.
  11394. 664.70 s [vector] foldr1: OK
  11395. 664.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11396. 664.70 s [vector] foldr': OK
  11397. 664.70 s [vector] +++ OK, passed 100 tests.
  11398. 664.70 s [vector] foldr1': OK
  11399. 664.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11400. 664.70 s [vector] ifoldl: OK
  11401. 664.70 s [vector] +++ OK, passed 100 tests.
  11402. 664.70 s [vector] ifoldl': OK
  11403. 664.70 s [vector] +++ OK, passed 100 tests.
  11404. 664.70 s [vector] ifoldr: OK
  11405. 664.70 s [vector] +++ OK, passed 100 tests.
  11406. 664.70 s [vector] ifoldr': OK
  11407. 664.70 s [vector] +++ OK, passed 100 tests.
  11408. 664.70 s [vector] ifoldM: OK
  11409. 664.70 s [vector] +++ OK, passed 100 tests.
  11410. 664.71 s [vector] ifoldM': OK
  11411. 664.71 s [vector] +++ OK, passed 100 tests.
  11412. 664.72 s [vector] ifoldM_: OK
  11413. 664.72 s [vector] +++ OK, passed 100 tests.
  11414. 664.72 s [vector] ifoldM'_: OK
  11415. 664.72 s [vector] +++ OK, passed 100 tests.
  11416. 664.72 s [vector] all: OK
  11417. 664.72 s [vector] +++ OK, passed 100 tests.
  11418. 664.72 s [vector] any: OK
  11419. 664.72 s [vector] +++ OK, passed 100 tests.
  11420. 664.72 s [vector] prescanl: OK
  11421. 664.72 s [vector] +++ OK, passed 100 tests.
  11422. 664.72 s [vector] prescanl': OK
  11423. 664.73 s [vector] +++ OK, passed 100 tests.
  11424. 664.73 s [vector] postscanl: OK
  11425. 664.73 s [vector] +++ OK, passed 100 tests.
  11426. 664.73 s [vector] postscanl': OK
  11427. 664.73 s [vector] +++ OK, passed 100 tests.
  11428. 664.73 s [vector] scanl: OK
  11429. 664.73 s [vector] +++ OK, passed 100 tests.
  11430. 664.73 s [vector] scanl': OK
  11431. 664.73 s [vector] +++ OK, passed 100 tests.
  11432. 664.73 s [vector] scanl1: OK
  11433. 664.73 s [vector] +++ OK, passed 100 tests.
  11434. 664.73 s [vector] scanl1': OK
  11435. 664.73 s [vector] +++ OK, passed 100 tests.
  11436. 664.73 s [vector] iscanl: OK
  11437. 664.73 s [vector] +++ OK, passed 100 tests.
  11438. 664.73 s [vector] iscanl': OK
  11439. 664.74 s [vector] +++ OK, passed 100 tests.
  11440. 664.74 s [vector] prescanr: OK
  11441. 664.74 s [vector] +++ OK, passed 100 tests.
  11442. 664.74 s [vector] prescanr': OK
  11443. 664.74 s [vector] +++ OK, passed 100 tests.
  11444. 664.74 s [vector] postscanr: OK
  11445. 664.74 s [vector] +++ OK, passed 100 tests.
  11446. 664.74 s [vector] postscanr': OK
  11447. 664.74 s [vector] +++ OK, passed 100 tests.
  11448. 664.74 s [vector] scanr: OK
  11449. 664.74 s [vector] +++ OK, passed 100 tests.
  11450. 664.74 s [vector] scanr': OK
  11451. 664.74 s [vector] +++ OK, passed 100 tests.
  11452. 664.74 s [vector] scanr1: OK
  11453. 664.74 s [vector] +++ OK, passed 100 tests.
  11454. 664.74 s [vector] scanr1': OK
  11455. 664.75 s [vector] +++ OK, passed 100 tests.
  11456. 664.75 s [vector] iscanr: OK
  11457. 664.75 s [vector] +++ OK, passed 100 tests.
  11458. 664.75 s [vector] iscanr': OK
  11459. 664.75 s [vector] +++ OK, passed 100 tests.
  11460. 664.75 s [vector] mut_read: OK
  11461. 664.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11462. 664.75 s [vector] mut_write: OK
  11463. 664.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11464. 664.75 s [vector] mut_modify: OK
  11465. 664.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11466. 664.75 s [vector] mut_generate: OK
  11467. 664.75 s [vector] +++ OK, passed 100 tests.
  11468. 664.75 s [vector] mut_generateM: OK
  11469. 664.76 s [vector] +++ OK, passed 100 tests.
  11470. 664.77 s [vector] mut_mapM_: OK
  11471. 664.77 s [vector] +++ OK, passed 100 tests.
  11472. 664.77 s [vector] mut_imapM_: OK
  11473. 664.77 s [vector] +++ OK, passed 100 tests.
  11474. 664.78 s [vector] mut_forM_: OK
  11475. 664.79 s [vector] +++ OK, passed 100 tests.
  11476. 664.79 s [vector] mut_iforM_: OK
  11477. 664.79 s [vector] +++ OK, passed 100 tests.
  11478. 664.79 s [vector] mut_foldr: OK
  11479. 664.79 s [vector] +++ OK, passed 100 tests.
  11480. 664.79 s [vector] mut_foldr': OK
  11481. 664.79 s [vector] +++ OK, passed 100 tests.
  11482. 664.79 s [vector] mut_foldl: OK
  11483. 664.79 s [vector] +++ OK, passed 100 tests.
  11484. 664.79 s [vector] mut_foldl': OK
  11485. 664.79 s [vector] +++ OK, passed 100 tests.
  11486. 664.79 s [vector] mut_ifoldr: OK
  11487. 664.79 s [vector] +++ OK, passed 100 tests.
  11488. 664.79 s [vector] mut_ifoldr': OK
  11489. 664.79 s [vector] +++ OK, passed 100 tests.
  11490. 664.79 s [vector] mut_ifoldl: OK
  11491. 664.79 s [vector] +++ OK, passed 100 tests.
  11492. 664.79 s [vector] mut_ifoldl': OK
  11493. 664.79 s [vector] +++ OK, passed 100 tests.
  11494. 664.80 s [vector] mut_foldM: OK
  11495. 664.80 s [vector] +++ OK, passed 100 tests.
  11496. 664.80 s [vector] mut_foldM': OK
  11497. 664.80 s [vector] +++ OK, passed 100 tests.
  11498. 664.80 s [vector] mut_foldrM: OK
  11499. 664.80 s [vector] +++ OK, passed 100 tests.
  11500. 664.80 s [vector] mut_foldrM': OK
  11501. 664.80 s [vector] +++ OK, passed 100 tests.
  11502. 664.80 s [vector] mut_ifoldM: OK
  11503. 664.80 s [vector] +++ OK, passed 100 tests.
  11504. 664.80 s [vector] mut_ifoldM': OK
  11505. 664.80 s [vector] +++ OK, passed 100 tests.
  11506. 664.80 s [vector] mut_ifoldrM: OK
  11507. 664.80 s [vector] +++ OK, passed 100 tests.
  11508. 664.80 s [vector] mut_ifoldrM': OK
  11509. 664.80 s [vector] +++ OK, passed 100 tests.
  11510. 664.80 s [vector] compare: OK
  11511. 664.81 s [vector] +++ OK, passed 100 tests.
  11512. 664.81 s [vector] maximum: OK
  11513. 664.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11514. 664.81 s [vector] minimum: OK
  11515. 664.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11516. 664.81 s [vector] minIndex: OK
  11517. 664.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11518. 664.81 s [vector] maxIndex: OK
  11519. 664.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11520. 664.81 s [vector] maximumBy: OK
  11521. 664.81 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11522. 664.81 s [vector] minimumBy: OK
  11523. 664.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11524. 664.81 s [vector] maximumOn: OK
  11525. 664.81 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11526. 664.81 s [vector] minimumOn: OK
  11527. 664.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11528. 664.81 s [vector] maxIndexBy: OK
  11529. 664.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11530. 664.81 s [vector] minIndexBy: OK
  11531. 664.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11532. 664.81 s [vector] ListFirstMaxIndexWins: OK
  11533. 664.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11534. 664.81 s [vector] FalseListFirstMaxIndexWins: OK
  11535. 664.81 s [vector] +++ OK, failed as expected. (after 1 test):
  11536. 664.81 s [vector] Exception:
  11537. 664.81 s [vector] Prelude.foldr1: empty list
  11538. 664.81 s [vector] CallStack (from HasCallStack):
  11539. 664.81 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11540. 664.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11541. 664.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11542. 664.81 s [vector] []
  11543. 664.81 s [vector] zip: OK
  11544. 664.81 s [vector] +++ OK, passed 100 tests.
  11545. 664.81 s [vector] zip3: OK
  11546. 664.81 s [vector] +++ OK, passed 100 tests.
  11547. 664.81 s [vector] unzip: OK
  11548. 664.81 s [vector] +++ OK, passed 100 tests.
  11549. 664.81 s [vector] unzip3: OK
  11550. 664.81 s [vector] +++ OK, passed 100 tests.
  11551. 664.81 s [vector] indexed: OK
  11552. 664.81 s [vector] +++ OK, passed 100 tests.
  11553. 664.82 s [vector] update: OK
  11554. 664.82 s [vector] +++ OK, passed 100 tests.
  11555. 664.82 s [vector] concat: OK
  11556. 664.82 s [vector] +++ OK, passed 100 tests.
  11557. 664.82 s [vector] mempty: OK
  11558. 664.82 s [vector] +++ OK, passed 100 tests.
  11559. 664.82 s [vector] mappend: OK
  11560. 664.82 s [vector] +++ OK, passed 100 tests.
  11561. 664.83 s [vector] mconcat: OK
  11562. 664.83 s [vector] +++ OK, passed 100 tests.
  11563. 664.83 s [vector] fmap: OK
  11564. 664.83 s [vector] +++ OK, passed 100 tests.
  11565. 664.83 s [vector] return: OK
  11566. 664.83 s [vector] +++ OK, passed 100 tests.
  11567. 664.84 s [vector] bind: OK (0.01s)
  11568. 664.84 s [vector] +++ OK, passed 100 tests.
  11569. 664.84 s [vector] mzip: OK
  11570. 664.84 s [vector] +++ OK, passed 100 tests.
  11571. 664.84 s [vector] munzip: OK
  11572. 664.84 s [vector] +++ OK, passed 100 tests.
  11573. 664.85 s [vector] applicative_pure: OK
  11574. 664.85 s [vector] +++ OK, passed 100 tests.
  11575. 664.85 s [vector] applicative_appl: OK (0.01s)
  11576. 664.85 s [vector] +++ OK, passed 100 tests.
  11577. 664.85 s [vector] alternative_empty: OK
  11578. 664.85 s [vector] +++ OK, passed 100 tests.
  11579. 664.87 s [vector] alternative_or: OK
  11580. 664.87 s [vector] +++ OK, passed 100 tests.
  11581. 664.88 s [vector] sequence: OK (0.02s)
  11582. 664.88 s [vector] +++ OK, passed 100 tests.
  11583. 664.88 s [vector] sequence_: OK
  11584. 664.88 s [vector] +++ OK, passed 100 tests.
  11585. 664.88 s [vector] glength: OK
  11586. 664.88 s [vector] +++ OK, passed 100 tests.
  11587. 664.88 s [vector] and: OK
  11588. 664.88 s [vector] +++ OK, passed 100 tests.
  11589. 664.88 s [vector] or: OK
  11590. 664.88 s [vector] +++ OK, passed 100 tests.
  11591. 664.89 s [vector] Int
  11592. 664.89 s [vector] fromList.toList == id: OK
  11593. 664.89 s [vector] +++ OK, passed 100 tests.
  11594. 664.89 s [vector] toList.fromList == id: OK
  11595. 664.89 s [vector] +++ OK, passed 100 tests.
  11596. 664.89 s [vector] unstream.stream == id: OK
  11597. 664.89 s [vector] +++ OK, passed 100 tests.
  11598. 664.89 s [vector] stream.unstream == id: OK
  11599. 664.89 s [vector] +++ OK, passed 100 tests.
  11600. 664.89 s [vector] eq: OK
  11601. 664.89 s [vector] +++ OK, passed 100 tests.
  11602. 664.89 s [vector] length: OK
  11603. 664.89 s [vector] +++ OK, passed 100 tests.
  11604. 664.89 s [vector] null: OK
  11605. 664.89 s [vector] +++ OK, passed 100 tests.
  11606. 664.89 s [vector] index: OK
  11607. 664.89 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11608. 664.89 s [vector] safeIndex: OK
  11609. 664.89 s [vector] +++ OK, passed 100 tests.
  11610. 664.89 s [vector] head: OK
  11611. 664.89 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11612. 664.89 s [vector] last: OK
  11613. 664.89 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11614. 664.89 s [vector] unsafeIndex: OK
  11615. 664.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11616. 664.89 s [vector] unsafeHead: OK
  11617. 664.89 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11618. 664.89 s [vector] unsafeLast: OK
  11619. 664.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11620. 664.89 s [vector] slice: OK
  11621. 664.89 s [vector] +++ OK, passed 100 tests.
  11622. 664.89 s [vector] init: OK
  11623. 664.89 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11624. 664.89 s [vector] tail: OK
  11625. 664.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11626. 664.89 s [vector] take: OK
  11627. 664.89 s [vector] +++ OK, passed 100 tests.
  11628. 664.89 s [vector] drop: OK
  11629. 664.89 s [vector] +++ OK, passed 100 tests.
  11630. 664.89 s [vector] splitAt: OK
  11631. 664.89 s [vector] +++ OK, passed 100 tests.
  11632. 664.89 s [vector] empty: OK
  11633. 664.89 s [vector] +++ OK, passed 100 tests.
  11634. 664.89 s [vector] singleton: OK
  11635. 664.89 s [vector] +++ OK, passed 100 tests.
  11636. 664.89 s [vector] replicate: OK
  11637. 664.89 s [vector] +++ OK, passed 100 tests.
  11638. 664.89 s [vector] generate: OK
  11639. 664.89 s [vector] +++ OK, passed 100 tests.
  11640. 664.91 s [vector] iterateN: OK
  11641. 664.91 s [vector] +++ OK, passed 100 tests.
  11642. 664.93 s [vector] iterateNM: OK (0.04s)
  11643. 664.93 s [vector] +++ OK, passed 100 tests.
  11644. 664.96 s [vector] generateM: OK (0.03s)
  11645. 664.96 s [vector] +++ OK, passed 100 tests.
  11646. 664.96 s [vector] replicateM: OK
  11647. 664.97 s [vector] +++ OK, passed 100 tests.
  11648. 664.97 s [vector] create: OK
  11649. 664.97 s [vector] +++ OK, passed 100 tests.
  11650. 664.97 s [vector] createT: OK
  11651. 664.97 s [vector] +++ OK, passed 100 tests.
  11652. 664.97 s [vector] unfoldr: OK
  11653. 664.97 s [vector] +++ OK, passed 100 tests.
  11654. 664.97 s [vector] unfoldrN: OK
  11655. 664.97 s [vector] +++ OK, passed 100 tests.
  11656. 664.97 s [vector] unfoldrExactN: OK
  11657. 664.97 s [vector] +++ OK, passed 100 tests.
  11658. 664.97 s [vector] unfoldrM: OK
  11659. 664.97 s [vector] +++ OK, passed 100 tests.
  11660. 664.97 s [vector] unfoldrNM: OK
  11661. 664.98 s [vector] +++ OK, passed 100 tests.
  11662. 664.98 s [vector] unfoldrExactNM: OK (0.01s)
  11663. 664.98 s [vector] +++ OK, passed 100 tests.
  11664. 664.99 s [vector] constructN: OK
  11665. 664.99 s [vector] +++ OK, passed 100 tests.
  11666. 664.99 s [vector] constructrN: OK
  11667. 664.99 s [vector] +++ OK, passed 100 tests.
  11668. 664.99 s [vector] cons: OK
  11669. 664.99 s [vector] +++ OK, passed 100 tests.
  11670. 664.99 s [vector] snoc: OK
  11671. 664.99 s [vector] +++ OK, passed 100 tests.
  11672. 665.01 s [vector] append: OK
  11673. 665.01 s [vector] +++ OK, passed 100 tests.
  11674. 665.01 s [vector] concat: OK (0.01s)
  11675. 665.01 s [vector] +++ OK, passed 100 tests.
  11676. 665.01 s [vector] force: OK
  11677. 665.01 s [vector] +++ OK, passed 100 tests.
  11678. 665.01 s [vector] upd: OK
  11679. 665.01 s [vector] +++ OK, passed 100 tests.
  11680. 665.01 s [vector] accum: OK
  11681. 665.01 s [vector] +++ OK, passed 100 tests.
  11682. 665.01 s [vector] reverse: OK
  11683. 665.01 s [vector] +++ OK, passed 100 tests.
  11684. 665.01 s [vector] backpermute: OK
  11685. 665.02 s [vector] +++ OK, passed 100 tests.
  11686. 665.02 s [vector] map: OK
  11687. 665.02 s [vector] +++ OK, passed 100 tests.
  11688. 665.02 s [vector] imap: OK
  11689. 665.02 s [vector] +++ OK, passed 100 tests.
  11690. 665.02 s [vector] concatMap: OK
  11691. 665.02 s [vector] +++ OK, passed 100 tests.
  11692. 665.03 s [vector] mapM: OK
  11693. 665.03 s [vector] +++ OK, passed 100 tests.
  11694. 665.04 s [vector] mapM_: OK (0.02s)
  11695. 665.04 s [vector] +++ OK, passed 100 tests.
  11696. 665.05 s [vector] forM: OK
  11697. 665.05 s [vector] +++ OK, passed 100 tests.
  11698. 665.06 s [vector] forM_: OK (0.01s)
  11699. 665.06 s [vector] +++ OK, passed 100 tests.
  11700. 665.07 s [vector] imapM: OK
  11701. 665.07 s [vector] +++ OK, passed 100 tests.
  11702. 665.08 s [vector] imapM_: OK (0.01s)
  11703. 665.08 s [vector] +++ OK, passed 100 tests.
  11704. 665.08 s [vector] zipWith: OK
  11705. 665.08 s [vector] +++ OK, passed 100 tests.
  11706. 665.08 s [vector] zipWith3: OK
  11707. 665.08 s [vector] +++ OK, passed 100 tests.
  11708. 665.08 s [vector] izipWith: OK
  11709. 665.08 s [vector] +++ OK, passed 100 tests.
  11710. 665.08 s [vector] izipWith3: OK
  11711. 665.09 s [vector] +++ OK, passed 100 tests.
  11712. 665.09 s [vector] izipWithM: OK
  11713. 665.09 s [vector] +++ OK, passed 100 tests.
  11714. 665.10 s [vector] izipWithM_: OK (0.01s)
  11715. 665.10 s [vector] +++ OK, passed 100 tests.
  11716. 665.10 s [vector] zipWithM: OK
  11717. 665.11 s [vector] +++ OK, passed 100 tests.
  11718. 665.11 s [vector] zipWithM_: OK (0.01s)
  11719. 665.11 s [vector] +++ OK, passed 100 tests.
  11720. 665.11 s [vector] filter: OK
  11721. 665.11 s [vector] +++ OK, passed 100 tests.
  11722. 665.12 s [vector] ifilter: OK
  11723. 665.13 s [vector] +++ OK, passed 100 tests.
  11724. 665.15 s [vector] filterM: OK (0.03s)
  11725. 665.15 s [vector] +++ OK, passed 100 tests.
  11726. 665.15 s [vector] uniq: OK
  11727. 665.15 s [vector] +++ OK, passed 100 tests.
  11728. 665.15 s [vector] mapMaybe: OK
  11729. 665.15 s [vector] +++ OK, passed 100 tests.
  11730. 665.15 s [vector] imapMaybe: OK
  11731. 665.15 s [vector] +++ OK, passed 100 tests.
  11732. 665.15 s [vector] takeWhile: OK
  11733. 665.15 s [vector] +++ OK, passed 100 tests.
  11734. 665.15 s [vector] dropWhile: OK
  11735. 665.15 s [vector] +++ OK, passed 100 tests.
  11736. 665.16 s [vector] partition: OK
  11737. 665.16 s [vector] +++ OK, passed 100 tests.
  11738. 665.16 s [vector] partitionWith: OK
  11739. 665.16 s [vector] +++ OK, passed 100 tests.
  11740. 665.16 s [vector] span: OK
  11741. 665.16 s [vector] +++ OK, passed 100 tests.
  11742. 665.16 s [vector] break: OK
  11743. 665.16 s [vector] +++ OK, passed 100 tests.
  11744. 665.16 s [vector] spanR: OK
  11745. 665.16 s [vector] +++ OK, passed 100 tests.
  11746. 665.16 s [vector] breakR: OK
  11747. 665.16 s [vector] +++ OK, passed 100 tests.
  11748. 665.16 s [vector] groupBy: OK
  11749. 665.16 s [vector] +++ OK, passed 100 tests.
  11750. 665.16 s [vector] elem: OK
  11751. 665.16 s [vector] +++ OK, passed 100 tests.
  11752. 665.16 s [vector] notElem: OK
  11753. 665.16 s [vector] +++ OK, passed 100 tests.
  11754. 665.16 s [vector] find: OK
  11755. 665.16 s [vector] +++ OK, passed 100 tests.
  11756. 665.16 s [vector] findIndex: OK
  11757. 665.16 s [vector] +++ OK, passed 100 tests.
  11758. 665.17 s [vector] findIndexR: OK
  11759. 665.17 s [vector] +++ OK, passed 100 tests.
  11760. 665.17 s [vector] findIndices: OK
  11761. 665.17 s [vector] +++ OK, passed 100 tests.
  11762. 665.17 s [vector] elemIndex: OK
  11763. 665.17 s [vector] +++ OK, passed 100 tests.
  11764. 665.17 s [vector] elemIndices: OK
  11765. 665.17 s [vector] +++ OK, passed 100 tests.
  11766. 665.17 s [vector] foldl: OK
  11767. 665.17 s [vector] +++ OK, passed 100 tests.
  11768. 665.17 s [vector] foldl1: OK
  11769. 665.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11770. 665.17 s [vector] foldl': OK
  11771. 665.17 s [vector] +++ OK, passed 100 tests.
  11772. 665.17 s [vector] foldl1': OK
  11773. 665.18 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11774. 665.18 s [vector] foldr: OK
  11775. 665.18 s [vector] +++ OK, passed 100 tests.
  11776. 665.18 s [vector] foldr1: OK
  11777. 665.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11778. 665.19 s [vector] foldr': OK
  11779. 665.19 s [vector] +++ OK, passed 100 tests.
  11780. 665.19 s [vector] foldr1': OK
  11781. 665.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11782. 665.19 s [vector] ifoldl: OK
  11783. 665.19 s [vector] +++ OK, passed 100 tests.
  11784. 665.19 s [vector] ifoldl': OK
  11785. 665.19 s [vector] +++ OK, passed 100 tests.
  11786. 665.19 s [vector] ifoldr: OK
  11787. 665.20 s [vector] +++ OK, passed 100 tests.
  11788. 665.20 s [vector] ifoldr': OK
  11789. 665.20 s [vector] +++ OK, passed 100 tests.
  11790. 665.20 s [vector] ifoldM: OK
  11791. 665.21 s [vector] +++ OK, passed 100 tests.
  11792. 665.21 s [vector] ifoldM': OK
  11793. 665.21 s [vector] +++ OK, passed 100 tests.
  11794. 665.23 s [vector] ifoldM_: OK (0.02s)
  11795. 665.23 s [vector] +++ OK, passed 100 tests.
  11796. 665.24 s [vector] ifoldM'_: OK (0.02s)
  11797. 665.24 s [vector] +++ OK, passed 100 tests.
  11798. 665.24 s [vector] all: OK
  11799. 665.24 s [vector] +++ OK, passed 100 tests.
  11800. 665.24 s [vector] any: OK
  11801. 665.24 s [vector] +++ OK, passed 100 tests.
  11802. 665.24 s [vector] prescanl: OK
  11803. 665.24 s [vector] +++ OK, passed 100 tests.
  11804. 665.24 s [vector] prescanl': OK
  11805. 665.25 s [vector] +++ OK, passed 100 tests.
  11806. 665.25 s [vector] postscanl: OK
  11807. 665.25 s [vector] +++ OK, passed 100 tests.
  11808. 665.25 s [vector] postscanl': OK
  11809. 665.25 s [vector] +++ OK, passed 100 tests.
  11810. 665.25 s [vector] scanl: OK
  11811. 665.25 s [vector] +++ OK, passed 100 tests.
  11812. 665.25 s [vector] scanl': OK
  11813. 665.26 s [vector] +++ OK, passed 100 tests.
  11814. 665.26 s [vector] scanl1: OK
  11815. 665.26 s [vector] +++ OK, passed 100 tests.
  11816. 665.26 s [vector] scanl1': OK
  11817. 665.26 s [vector] +++ OK, passed 100 tests.
  11818. 665.27 s [vector] iscanl: OK
  11819. 665.27 s [vector] +++ OK, passed 100 tests.
  11820. 665.27 s [vector] iscanl': OK
  11821. 665.27 s [vector] +++ OK, passed 100 tests.
  11822. 665.28 s [vector] prescanr: OK
  11823. 665.28 s [vector] +++ OK, passed 100 tests.
  11824. 665.28 s [vector] prescanr': OK
  11825. 665.28 s [vector] +++ OK, passed 100 tests.
  11826. 665.28 s [vector] postscanr: OK
  11827. 665.28 s [vector] +++ OK, passed 100 tests.
  11828. 665.29 s [vector] postscanr': OK
  11829. 665.29 s [vector] +++ OK, passed 100 tests.
  11830. 665.29 s [vector] scanr: OK
  11831. 665.29 s [vector] +++ OK, passed 100 tests.
  11832. 665.29 s [vector] scanr': OK
  11833. 665.29 s [vector] +++ OK, passed 100 tests.
  11834. 665.30 s [vector] scanr1: OK
  11835. 665.30 s [vector] +++ OK, passed 100 tests.
  11836. 665.30 s [vector] scanr1': OK
  11837. 665.30 s [vector] +++ OK, passed 100 tests.
  11838. 665.31 s [vector] iscanr: OK
  11839. 665.31 s [vector] +++ OK, passed 100 tests.
  11840. 665.31 s [vector] iscanr': OK
  11841. 665.31 s [vector] +++ OK, passed 100 tests.
  11842. 665.31 s [vector] mut_read: OK
  11843. 665.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11844. 665.31 s [vector] mut_write: OK
  11845. 665.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11846. 665.31 s [vector] mut_modify: OK
  11847. 665.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11848. 665.31 s [vector] mut_generate: OK
  11849. 665.31 s [vector] +++ OK, passed 100 tests.
  11850. 665.33 s [vector] mut_generateM: OK
  11851. 665.33 s [vector] +++ OK, passed 100 tests.
  11852. 665.35 s [vector] mut_mapM_: OK (0.02s)
  11853. 665.35 s [vector] +++ OK, passed 100 tests.
  11854. 665.36 s [vector] mut_imapM_: OK (0.01s)
  11855. 665.36 s [vector] +++ OK, passed 100 tests.
  11856. 665.37 s [vector] mut_forM_: OK (0.02s)
  11857. 665.37 s [vector] +++ OK, passed 100 tests.
  11858. 665.38 s [vector] mut_iforM_: OK (0.02s)
  11859. 665.38 s [vector] +++ OK, passed 100 tests.
  11860. 665.39 s [vector] mut_foldr: OK
  11861. 665.39 s [vector] +++ OK, passed 100 tests.
  11862. 665.39 s [vector] mut_foldr': OK
  11863. 665.39 s [vector] +++ OK, passed 100 tests.
  11864. 665.39 s [vector] mut_foldl: OK
  11865. 665.39 s [vector] +++ OK, passed 100 tests.
  11866. 665.39 s [vector] mut_foldl': OK
  11867. 665.39 s [vector] +++ OK, passed 100 tests.
  11868. 665.39 s [vector] mut_ifoldr: OK
  11869. 665.40 s [vector] +++ OK, passed 100 tests.
  11870. 665.40 s [vector] mut_ifoldr': OK
  11871. 665.40 s [vector] +++ OK, passed 100 tests.
  11872. 665.40 s [vector] mut_ifoldl: OK
  11873. 665.40 s [vector] +++ OK, passed 100 tests.
  11874. 665.41 s [vector] mut_ifoldl': OK
  11875. 665.41 s [vector] +++ OK, passed 100 tests.
  11876. 665.41 s [vector] mut_foldM: OK
  11877. 665.41 s [vector] +++ OK, passed 100 tests.
  11878. 665.41 s [vector] mut_foldM': OK
  11879. 665.41 s [vector] +++ OK, passed 100 tests.
  11880. 665.41 s [vector] mut_foldrM: OK
  11881. 665.41 s [vector] +++ OK, passed 100 tests.
  11882. 665.42 s [vector] mut_foldrM': OK
  11883. 665.42 s [vector] +++ OK, passed 100 tests.
  11884. 665.42 s [vector] mut_ifoldM: OK
  11885. 665.42 s [vector] +++ OK, passed 100 tests.
  11886. 665.42 s [vector] mut_ifoldM': OK
  11887. 665.42 s [vector] +++ OK, passed 100 tests.
  11888. 665.42 s [vector] mut_ifoldrM: OK
  11889. 665.42 s [vector] +++ OK, passed 100 tests.
  11890. 665.43 s [vector] mut_ifoldrM': OK
  11891. 665.43 s [vector] +++ OK, passed 100 tests.
  11892. 665.43 s [vector] compare: OK
  11893. 665.43 s [vector] +++ OK, passed 100 tests.
  11894. 665.43 s [vector] maximum: OK
  11895. 665.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11896. 665.43 s [vector] minimum: OK
  11897. 665.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11898. 665.43 s [vector] minIndex: OK
  11899. 665.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11900. 665.43 s [vector] maxIndex: OK
  11901. 665.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11902. 665.43 s [vector] maximumBy: OK
  11903. 665.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11904. 665.43 s [vector] minimumBy: OK
  11905. 665.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11906. 665.43 s [vector] maximumOn: OK
  11907. 665.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11908. 665.43 s [vector] minimumOn: OK
  11909. 665.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11910. 665.43 s [vector] maxIndexBy: OK
  11911. 665.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11912. 665.43 s [vector] minIndexBy: OK
  11913. 665.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11914. 665.44 s [vector] ListFirstMaxIndexWins: OK
  11915. 665.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11916. 665.44 s [vector] FalseListFirstMaxIndexWins: OK
  11917. 665.44 s [vector] +++ OK, failed as expected. (after 1 test):
  11918. 665.44 s [vector] Exception:
  11919. 665.44 s [vector] Prelude.foldr1: empty list
  11920. 665.44 s [vector] CallStack (from HasCallStack):
  11921. 665.44 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  11922. 665.44 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  11923. 665.44 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11924. 665.44 s [vector] []
  11925. 665.44 s [vector] zip: OK
  11926. 665.44 s [vector] +++ OK, passed 100 tests.
  11927. 665.44 s [vector] zip3: OK
  11928. 665.44 s [vector] +++ OK, passed 100 tests.
  11929. 665.44 s [vector] unzip: OK
  11930. 665.44 s [vector] +++ OK, passed 100 tests.
  11931. 665.44 s [vector] unzip3: OK
  11932. 665.44 s [vector] +++ OK, passed 100 tests.
  11933. 665.44 s [vector] indexed: OK
  11934. 665.44 s [vector] +++ OK, passed 100 tests.
  11935. 665.44 s [vector] update: OK
  11936. 665.45 s [vector] +++ OK, passed 100 tests.
  11937. 665.46 s [vector] concat: OK (0.01s)
  11938. 665.46 s [vector] +++ OK, passed 100 tests.
  11939. 665.46 s [vector] mempty: OK
  11940. 665.46 s [vector] +++ OK, passed 100 tests.
  11941. 665.47 s [vector] mappend: OK
  11942. 665.47 s [vector] +++ OK, passed 100 tests.
  11943. 665.47 s [vector] mconcat: OK (0.01s)
  11944. 665.47 s [vector] +++ OK, passed 100 tests.
  11945. 665.47 s [vector] fmap: OK
  11946. 665.47 s [vector] +++ OK, passed 100 tests.
  11947. 665.47 s [vector] return: OK
  11948. 665.47 s [vector] +++ OK, passed 100 tests.
  11949. 665.49 s [vector] bind: OK
  11950. 665.49 s [vector] +++ OK, passed 100 tests.
  11951. 665.49 s [vector] mzip: OK
  11952. 665.49 s [vector] +++ OK, passed 100 tests.
  11953. 665.49 s [vector] munzip: OK
  11954. 665.49 s [vector] +++ OK, passed 100 tests.
  11955. 665.49 s [vector] applicative_pure: OK
  11956. 665.51 s [vector] +++ OK, passed 100 tests.
  11957. 665.52 s [vector] applicative_appl: OK (0.03s)
  11958. 665.52 s [vector] +++ OK, passed 100 tests.
  11959. 665.52 s [vector] alternative_empty: OK
  11960. 665.52 s [vector] +++ OK, passed 100 tests.
  11961. 665.53 s [vector] alternative_or: OK
  11962. 665.53 s [vector] +++ OK, passed 100 tests.
  11963. 665.59 s [vector] sequence: OK (0.06s)
  11964. 665.59 s [vector] +++ OK, passed 100 tests.
  11965. 665.61 s [vector] sequence_: OK (0.03s)
  11966. 665.61 s [vector] +++ OK, passed 100 tests.
  11967. 665.61 s [vector] glength: OK
  11968. 665.61 s [vector] +++ OK, passed 100 tests.
  11969. 665.61 s [vector] sum: OK
  11970. 665.61 s [vector] +++ OK, passed 100 tests.
  11971. 665.61 s [vector] product: OK
  11972. 665.61 s [vector] +++ OK, passed 100 tests.
  11973. 665.62 s [vector] enumFromN: OK
  11974. 665.62 s [vector] +++ OK, passed 100 tests.
  11975. 665.62 s [vector] enumFromThenN: OK
  11976. 665.62 s [vector] +++ OK, passed 100 tests.
  11977. 665.62 s [vector] enumFromTo: OK
  11978. 665.62 s [vector] +++ OK, passed 100 tests.
  11979. 665.62 s [vector] enumFromThenTo: OK
  11980. 665.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11981. 665.62 s [vector] unstream
  11982. 665.62 s [vector] unstream == vunstream (exact): OK
  11983. 665.62 s [vector] +++ OK, passed 100 tests.
  11984. 665.62 s [vector] unstream == vunstream (unknown): OK
  11985. 665.62 s [vector] +++ OK, passed 100 tests.
  11986. 665.62 s [vector] unstreamR ~= vunstream (exact): OK
  11987. 665.62 s [vector] +++ OK, passed 100 tests.
  11988. 665.62 s [vector] unstreamR ~= vunstream (unknown): OK
  11989. 665.62 s [vector] +++ OK, passed 100 tests.
  11990. 665.62 s [vector] Tests.Vector.Primitive
  11991. 665.62 s [vector] Int
  11992. 665.62 s [vector] fromList.toList == id: OK
  11993. 665.62 s [vector] +++ OK, passed 100 tests.
  11994. 665.62 s [vector] toList.fromList == id: OK
  11995. 665.62 s [vector] +++ OK, passed 100 tests.
  11996. 665.62 s [vector] unstream.stream == id: OK
  11997. 665.62 s [vector] +++ OK, passed 100 tests.
  11998. 665.62 s [vector] stream.unstream == id: OK
  11999. 665.62 s [vector] +++ OK, passed 100 tests.
  12000. 665.62 s [vector] eq: OK
  12001. 665.62 s [vector] +++ OK, passed 100 tests.
  12002. 665.62 s [vector] length: OK
  12003. 665.62 s [vector] +++ OK, passed 100 tests.
  12004. 665.62 s [vector] null: OK
  12005. 665.62 s [vector] +++ OK, passed 100 tests.
  12006. 665.62 s [vector] index: OK
  12007. 665.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12008. 665.62 s [vector] safeIndex: OK
  12009. 665.62 s [vector] +++ OK, passed 100 tests.
  12010. 665.62 s [vector] head: OK
  12011. 665.62 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12012. 665.62 s [vector] last: OK
  12013. 665.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12014. 665.62 s [vector] unsafeIndex: OK
  12015. 665.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12016. 665.62 s [vector] unsafeHead: OK
  12017. 665.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12018. 665.62 s [vector] unsafeLast: OK
  12019. 665.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12020. 665.62 s [vector] slice: OK
  12021. 665.62 s [vector] +++ OK, passed 100 tests.
  12022. 665.62 s [vector] init: OK
  12023. 665.62 s [vector] +++ OK, passed 100 tests; 26 discarded.
  12024. 665.63 s [vector] tail: OK
  12025. 665.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12026. 665.63 s [vector] take: OK
  12027. 665.63 s [vector] +++ OK, passed 100 tests.
  12028. 665.63 s [vector] drop: OK
  12029. 665.63 s [vector] +++ OK, passed 100 tests.
  12030. 665.63 s [vector] splitAt: OK
  12031. 665.63 s [vector] +++ OK, passed 100 tests.
  12032. 665.63 s [vector] empty: OK
  12033. 665.63 s [vector] +++ OK, passed 100 tests.
  12034. 665.63 s [vector] singleton: OK
  12035. 665.63 s [vector] +++ OK, passed 100 tests.
  12036. 665.63 s [vector] replicate: OK
  12037. 665.63 s [vector] +++ OK, passed 100 tests.
  12038. 665.63 s [vector] generate: OK
  12039. 665.64 s [vector] +++ OK, passed 100 tests.
  12040. 665.64 s [vector] iterateN: OK
  12041. 665.64 s [vector] +++ OK, passed 100 tests.
  12042. 665.65 s [vector] iterateNM: OK
  12043. 665.65 s [vector] +++ OK, passed 100 tests.
  12044. 665.67 s [vector] generateM: OK (0.01s)
  12045. 665.67 s [vector] +++ OK, passed 100 tests.
  12046. 665.67 s [vector] replicateM: OK (0.02s)
  12047. 665.67 s [vector] +++ OK, passed 100 tests.
  12048. 665.67 s [vector] create: OK
  12049. 665.67 s [vector] +++ OK, passed 100 tests.
  12050. 665.67 s [vector] createT: OK
  12051. 665.67 s [vector] +++ OK, passed 100 tests.
  12052. 665.67 s [vector] unfoldr: OK
  12053. 665.67 s [vector] +++ OK, passed 100 tests.
  12054. 665.67 s [vector] unfoldrN: OK
  12055. 665.67 s [vector] +++ OK, passed 100 tests.
  12056. 665.67 s [vector] unfoldrExactN: OK
  12057. 665.67 s [vector] +++ OK, passed 100 tests.
  12058. 665.67 s [vector] unfoldrM: OK
  12059. 665.67 s [vector] +++ OK, passed 100 tests.
  12060. 665.68 s [vector] unfoldrNM: OK
  12061. 665.69 s [vector] +++ OK, passed 100 tests.
  12062. 665.69 s [vector] unfoldrExactNM: OK (0.01s)
  12063. 665.69 s [vector] +++ OK, passed 100 tests.
  12064. 665.69 s [vector] constructN: OK
  12065. 665.70 s [vector] +++ OK, passed 100 tests.
  12066. 665.70 s [vector] constructrN: OK
  12067. 665.70 s [vector] +++ OK, passed 100 tests.
  12068. 665.70 s [vector] cons: OK
  12069. 665.70 s [vector] +++ OK, passed 100 tests.
  12070. 665.70 s [vector] snoc: OK
  12071. 665.70 s [vector] +++ OK, passed 100 tests.
  12072. 665.70 s [vector] append: OK
  12073. 665.70 s [vector] +++ OK, passed 100 tests.
  12074. 665.71 s [vector] concat: OK
  12075. 665.71 s [vector] +++ OK, passed 100 tests.
  12076. 665.71 s [vector] force: OK
  12077. 665.71 s [vector] +++ OK, passed 100 tests.
  12078. 665.72 s [vector] upd: OK
  12079. 665.72 s [vector] +++ OK, passed 100 tests.
  12080. 665.72 s [vector] accum: OK
  12081. 665.72 s [vector] +++ OK, passed 100 tests.
  12082. 665.72 s [vector] reverse: OK
  12083. 665.72 s [vector] +++ OK, passed 100 tests.
  12084. 665.72 s [vector] backpermute: OK
  12085. 665.73 s [vector] +++ OK, passed 100 tests.
  12086. 665.73 s [vector] map: OK
  12087. 665.73 s [vector] +++ OK, passed 100 tests.
  12088. 665.73 s [vector] imap: OK
  12089. 665.73 s [vector] +++ OK, passed 100 tests.
  12090. 665.73 s [vector] concatMap: OK
  12091. 665.73 s [vector] +++ OK, passed 100 tests.
  12092. 665.73 s [vector] mapM: OK
  12093. 665.75 s [vector] +++ OK, passed 100 tests.
  12094. 665.75 s [vector] mapM_: OK (0.02s)
  12095. 665.75 s [vector] +++ OK, passed 100 tests.
  12096. 665.77 s [vector] forM: OK
  12097. 665.77 s [vector] +++ OK, passed 100 tests.
  12098. 665.77 s [vector] forM_: OK (0.02s)
  12099. 665.77 s [vector] +++ OK, passed 100 tests.
  12100. 665.77 s [vector] imapM: OK
  12101. 665.77 s [vector] +++ OK, passed 100 tests.
  12102. 665.79 s [vector] imapM_: OK (0.02s)
  12103. 665.79 s [vector] +++ OK, passed 100 tests.
  12104. 665.79 s [vector] zipWith: OK
  12105. 665.79 s [vector] +++ OK, passed 100 tests.
  12106. 665.79 s [vector] zipWith3: OK
  12107. 665.79 s [vector] +++ OK, passed 100 tests.
  12108. 665.79 s [vector] izipWith: OK
  12109. 665.79 s [vector] +++ OK, passed 100 tests.
  12110. 665.80 s [vector] izipWith3: OK
  12111. 665.80 s [vector] +++ OK, passed 100 tests.
  12112. 665.80 s [vector] izipWithM: OK
  12113. 665.81 s [vector] +++ OK, passed 100 tests.
  12114. 665.81 s [vector] izipWithM_: OK (0.01s)
  12115. 665.81 s [vector] +++ OK, passed 100 tests.
  12116. 665.81 s [vector] zipWithM: OK
  12117. 665.83 s [vector] +++ OK, passed 100 tests.
  12118. 665.83 s [vector] zipWithM_: OK (0.01s)
  12119. 665.83 s [vector] +++ OK, passed 100 tests.
  12120. 665.83 s [vector] filter: OK
  12121. 665.83 s [vector] +++ OK, passed 100 tests.
  12122. 665.85 s [vector] ifilter: OK
  12123. 665.85 s [vector] +++ OK, passed 100 tests.
  12124. 665.85 s [vector] filterM: OK (0.02s)
  12125. 665.85 s [vector] +++ OK, passed 100 tests.
  12126. 665.85 s [vector] uniq: OK
  12127. 665.86 s [vector] +++ OK, passed 100 tests.
  12128. 665.86 s [vector] mapMaybe: OK
  12129. 665.86 s [vector] +++ OK, passed 100 tests.
  12130. 665.86 s [vector] imapMaybe: OK
  12131. 665.86 s [vector] +++ OK, passed 100 tests.
  12132. 665.86 s [vector] takeWhile: OK
  12133. 665.86 s [vector] +++ OK, passed 100 tests.
  12134. 665.86 s [vector] dropWhile: OK
  12135. 665.86 s [vector] +++ OK, passed 100 tests.
  12136. 665.86 s [vector] partition: OK
  12137. 665.86 s [vector] +++ OK, passed 100 tests.
  12138. 665.86 s [vector] partitionWith: OK
  12139. 665.86 s [vector] +++ OK, passed 100 tests.
  12140. 665.87 s [vector] span: OK
  12141. 665.87 s [vector] +++ OK, passed 100 tests.
  12142. 665.87 s [vector] break: OK
  12143. 665.87 s [vector] +++ OK, passed 100 tests.
  12144. 665.87 s [vector] spanR: OK
  12145. 665.87 s [vector] +++ OK, passed 100 tests.
  12146. 665.87 s [vector] breakR: OK
  12147. 665.87 s [vector] +++ OK, passed 100 tests.
  12148. 665.87 s [vector] groupBy: OK
  12149. 665.87 s [vector] +++ OK, passed 100 tests.
  12150. 665.87 s [vector] elem: OK
  12151. 665.87 s [vector] +++ OK, passed 100 tests.
  12152. 665.87 s [vector] notElem: OK
  12153. 665.87 s [vector] +++ OK, passed 100 tests.
  12154. 665.87 s [vector] find: OK
  12155. 665.87 s [vector] +++ OK, passed 100 tests.
  12156. 665.87 s [vector] findIndex: OK
  12157. 665.87 s [vector] +++ OK, passed 100 tests.
  12158. 665.87 s [vector] findIndexR: OK
  12159. 665.87 s [vector] +++ OK, passed 100 tests.
  12160. 665.88 s [vector] findIndices: OK
  12161. 665.88 s [vector] +++ OK, passed 100 tests.
  12162. 665.88 s [vector] elemIndex: OK
  12163. 665.88 s [vector] +++ OK, passed 100 tests.
  12164. 665.88 s [vector] elemIndices: OK
  12165. 665.88 s [vector] +++ OK, passed 100 tests.
  12166. 665.88 s [vector] foldl: OK
  12167. 665.88 s [vector] +++ OK, passed 100 tests.
  12168. 665.88 s [vector] foldl1: OK
  12169. 665.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12170. 665.89 s [vector] foldl': OK
  12171. 665.89 s [vector] +++ OK, passed 100 tests.
  12172. 665.89 s [vector] foldl1': OK
  12173. 665.89 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12174. 665.89 s [vector] foldr: OK
  12175. 665.89 s [vector] +++ OK, passed 100 tests.
  12176. 665.89 s [vector] foldr1: OK
  12177. 665.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12178. 665.90 s [vector] foldr': OK
  12179. 665.90 s [vector] +++ OK, passed 100 tests.
  12180. 665.90 s [vector] foldr1': OK
  12181. 665.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12182. 665.90 s [vector] ifoldl: OK
  12183. 665.91 s [vector] +++ OK, passed 100 tests.
  12184. 665.91 s [vector] ifoldl': OK
  12185. 665.91 s [vector] +++ OK, passed 100 tests.
  12186. 665.91 s [vector] ifoldr: OK
  12187. 665.91 s [vector] +++ OK, passed 100 tests.
  12188. 665.92 s [vector] ifoldr': OK
  12189. 665.92 s [vector] +++ OK, passed 100 tests.
  12190. 665.92 s [vector] ifoldM: OK
  12191. 665.92 s [vector] +++ OK, passed 100 tests.
  12192. 665.92 s [vector] ifoldM': OK
  12193. 665.92 s [vector] +++ OK, passed 100 tests.
  12194. 665.95 s [vector] ifoldM_: OK (0.01s)
  12195. 665.95 s [vector] +++ OK, passed 100 tests.
  12196. 665.96 s [vector] ifoldM'_: OK (0.02s)
  12197. 665.96 s [vector] +++ OK, passed 100 tests.
  12198. 665.96 s [vector] all: OK
  12199. 665.96 s [vector] +++ OK, passed 100 tests.
  12200. 665.96 s [vector] any: OK
  12201. 665.96 s [vector] +++ OK, passed 100 tests.
  12202. 665.96 s [vector] prescanl: OK
  12203. 665.96 s [vector] +++ OK, passed 100 tests.
  12204. 665.97 s [vector] prescanl': OK
  12205. 665.97 s [vector] +++ OK, passed 100 tests.
  12206. 665.97 s [vector] postscanl: OK
  12207. 665.97 s [vector] +++ OK, passed 100 tests.
  12208. 665.98 s [vector] postscanl': OK
  12209. 665.98 s [vector] +++ OK, passed 100 tests.
  12210. 665.98 s [vector] scanl: OK
  12211. 665.98 s [vector] +++ OK, passed 100 tests.
  12212. 665.98 s [vector] scanl': OK
  12213. 665.98 s [vector] +++ OK, passed 100 tests.
  12214. 665.99 s [vector] scanl1: OK
  12215. 665.99 s [vector] +++ OK, passed 100 tests.
  12216. 665.99 s [vector] scanl1': OK
  12217. 665.99 s [vector] +++ OK, passed 100 tests.
  12218. 665.99 s [vector] iscanl: OK
  12219. 665.99 s [vector] +++ OK, passed 100 tests.
  12220. 665.99 s [vector] iscanl': OK
  12221. 666.00 s [vector] +++ OK, passed 100 tests.
  12222. 666.00 s [vector] prescanr: OK
  12223. 666.00 s [vector] +++ OK, passed 100 tests.
  12224. 666.00 s [vector] prescanr': OK
  12225. 666.00 s [vector] +++ OK, passed 100 tests.
  12226. 666.01 s [vector] postscanr: OK
  12227. 666.01 s [vector] +++ OK, passed 100 tests.
  12228. 666.02 s [vector] postscanr': OK (0.01s)
  12229. 666.02 s [vector] +++ OK, passed 100 tests.
  12230. 666.02 s [vector] scanr: OK
  12231. 666.02 s [vector] +++ OK, passed 100 tests.
  12232. 666.02 s [vector] scanr': OK
  12233. 666.03 s [vector] +++ OK, passed 100 tests.
  12234. 666.03 s [vector] scanr1: OK
  12235. 666.03 s [vector] +++ OK, passed 100 tests.
  12236. 666.03 s [vector] scanr1': OK
  12237. 666.03 s [vector] +++ OK, passed 100 tests.
  12238. 666.04 s [vector] iscanr: OK
  12239. 666.04 s [vector] +++ OK, passed 100 tests.
  12240. 666.04 s [vector] iscanr': OK
  12241. 666.04 s [vector] +++ OK, passed 100 tests.
  12242. 666.04 s [vector] mut_read: OK
  12243. 666.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12244. 666.04 s [vector] mut_write: OK
  12245. 666.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12246. 666.04 s [vector] mut_modify: OK
  12247. 666.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12248. 666.04 s [vector] mut_generate: OK
  12249. 666.05 s [vector] +++ OK, passed 100 tests.
  12250. 666.07 s [vector] mut_generateM: OK
  12251. 666.07 s [vector] +++ OK, passed 100 tests.
  12252. 666.07 s [vector] mut_mapM_: OK (0.02s)
  12253. 666.07 s [vector] +++ OK, passed 100 tests.
  12254. 666.09 s [vector] mut_imapM_: OK (0.02s)
  12255. 666.09 s [vector] +++ OK, passed 100 tests.
  12256. 666.11 s [vector] mut_forM_: OK (0.02s)
  12257. 666.11 s [vector] +++ OK, passed 100 tests.
  12258. 666.12 s [vector] mut_iforM_: OK (0.02s)
  12259. 666.12 s [vector] +++ OK, passed 100 tests.
  12260. 666.13 s [vector] mut_foldr: OK
  12261. 666.13 s [vector] +++ OK, passed 100 tests.
  12262. 666.13 s [vector] mut_foldr': OK
  12263. 666.13 s [vector] +++ OK, passed 100 tests.
  12264. 666.13 s [vector] mut_foldl: OK
  12265. 666.13 s [vector] +++ OK, passed 100 tests.
  12266. 666.13 s [vector] mut_foldl': OK
  12267. 666.13 s [vector] +++ OK, passed 100 tests.
  12268. 666.14 s [vector] mut_ifoldr: OK
  12269. 666.14 s [vector] +++ OK, passed 100 tests.
  12270. 666.14 s [vector] mut_ifoldr': OK
  12271. 666.14 s [vector] +++ OK, passed 100 tests.
  12272. 666.14 s [vector] mut_ifoldl: OK
  12273. 666.14 s [vector] +++ OK, passed 100 tests.
  12274. 666.14 s [vector] mut_ifoldl': OK
  12275. 666.14 s [vector] +++ OK, passed 100 tests.
  12276. 666.14 s [vector] mut_foldM: OK
  12277. 666.14 s [vector] +++ OK, passed 100 tests.
  12278. 666.15 s [vector] mut_foldM': OK
  12279. 666.15 s [vector] +++ OK, passed 100 tests.
  12280. 666.15 s [vector] mut_foldrM: OK
  12281. 666.15 s [vector] +++ OK, passed 100 tests.
  12282. 666.16 s [vector] mut_foldrM': OK
  12283. 666.16 s [vector] +++ OK, passed 100 tests.
  12284. 666.16 s [vector] mut_ifoldM: OK
  12285. 666.16 s [vector] +++ OK, passed 100 tests.
  12286. 666.16 s [vector] mut_ifoldM': OK
  12287. 666.16 s [vector] +++ OK, passed 100 tests.
  12288. 666.16 s [vector] mut_ifoldrM: OK
  12289. 666.17 s [vector] +++ OK, passed 100 tests.
  12290. 666.17 s [vector] mut_ifoldrM': OK
  12291. 666.17 s [vector] +++ OK, passed 100 tests.
  12292. 666.17 s [vector] compare: OK
  12293. 666.17 s [vector] +++ OK, passed 100 tests.
  12294. 666.17 s [vector] maximum: OK
  12295. 666.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12296. 666.17 s [vector] minimum: OK
  12297. 666.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12298. 666.17 s [vector] minIndex: OK
  12299. 666.17 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12300. 666.17 s [vector] maxIndex: OK
  12301. 666.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12302. 666.17 s [vector] maximumBy: OK
  12303. 666.17 s [vector] +++ OK, passed 100 tests; 25 discarded.
  12304. 666.17 s [vector] minimumBy: OK
  12305. 666.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12306. 666.17 s [vector] maximumOn: OK
  12307. 666.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12308. 666.17 s [vector] minimumOn: OK
  12309. 666.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12310. 666.17 s [vector] maxIndexBy: OK
  12311. 666.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12312. 666.17 s [vector] minIndexBy: OK
  12313. 666.17 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12314. 666.17 s [vector] ListFirstMaxIndexWins: OK
  12315. 666.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12316. 666.17 s [vector] FalseListFirstMaxIndexWins: OK
  12317. 666.17 s [vector] +++ OK, failed as expected. (after 1 test):
  12318. 666.17 s [vector] Exception:
  12319. 666.17 s [vector] Prelude.foldr1: empty list
  12320. 666.17 s [vector] CallStack (from HasCallStack):
  12321. 666.17 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12322. 666.17 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12323. 666.17 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12324. 666.18 s [vector] []
  12325. 666.18 s [vector] mempty: OK
  12326. 666.18 s [vector] +++ OK, passed 100 tests.
  12327. 666.19 s [vector] mappend: OK
  12328. 666.19 s [vector] +++ OK, passed 100 tests.
  12329. 666.19 s [vector] mconcat: OK (0.02s)
  12330. 666.19 s [vector] +++ OK, passed 100 tests.
  12331. 666.19 s [vector] glength: OK
  12332. 666.19 s [vector] +++ OK, passed 100 tests.
  12333. 666.19 s [vector] sum: OK
  12334. 666.19 s [vector] +++ OK, passed 100 tests.
  12335. 666.19 s [vector] product: OK
  12336. 666.19 s [vector] +++ OK, passed 100 tests.
  12337. 666.19 s [vector] enumFromN: OK
  12338. 666.19 s [vector] +++ OK, passed 100 tests.
  12339. 666.19 s [vector] enumFromThenN: OK
  12340. 666.19 s [vector] +++ OK, passed 100 tests.
  12341. 666.20 s [vector] enumFromTo: OK
  12342. 666.20 s [vector] +++ OK, passed 100 tests.
  12343. 666.20 s [vector] enumFromThenTo: OK
  12344. 666.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12345. 666.20 s [vector] Double
  12346. 666.20 s [vector] fromList.toList == id: OK
  12347. 666.20 s [vector] +++ OK, passed 100 tests.
  12348. 666.20 s [vector] toList.fromList == id: OK
  12349. 666.20 s [vector] +++ OK, passed 100 tests.
  12350. 666.20 s [vector] unstream.stream == id: OK
  12351. 666.20 s [vector] +++ OK, passed 100 tests.
  12352. 666.20 s [vector] stream.unstream == id: OK
  12353. 666.20 s [vector] +++ OK, passed 100 tests.
  12354. 666.20 s [vector] eq: OK
  12355. 666.20 s [vector] +++ OK, passed 100 tests.
  12356. 666.20 s [vector] length: OK
  12357. 666.20 s [vector] +++ OK, passed 100 tests.
  12358. 666.20 s [vector] null: OK
  12359. 666.20 s [vector] +++ OK, passed 100 tests.
  12360. 666.20 s [vector] index: OK
  12361. 666.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12362. 666.20 s [vector] safeIndex: OK
  12363. 666.20 s [vector] +++ OK, passed 100 tests.
  12364. 666.20 s [vector] head: OK
  12365. 666.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12366. 666.20 s [vector] last: OK
  12367. 666.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12368. 666.21 s [vector] unsafeIndex: OK
  12369. 666.21 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12370. 666.21 s [vector] unsafeHead: OK
  12371. 666.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12372. 666.21 s [vector] unsafeLast: OK
  12373. 666.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12374. 666.21 s [vector] slice: OK
  12375. 666.21 s [vector] +++ OK, passed 100 tests.
  12376. 666.21 s [vector] init: OK
  12377. 666.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12378. 666.21 s [vector] tail: OK
  12379. 666.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12380. 666.21 s [vector] take: OK
  12381. 666.21 s [vector] +++ OK, passed 100 tests.
  12382. 666.21 s [vector] drop: OK
  12383. 666.21 s [vector] +++ OK, passed 100 tests.
  12384. 666.21 s [vector] splitAt: OK
  12385. 666.21 s [vector] +++ OK, passed 100 tests.
  12386. 666.21 s [vector] empty: OK
  12387. 666.21 s [vector] +++ OK, passed 100 tests.
  12388. 666.21 s [vector] singleton: OK
  12389. 666.21 s [vector] +++ OK, passed 100 tests.
  12390. 666.21 s [vector] replicate: OK
  12391. 666.21 s [vector] +++ OK, passed 100 tests.
  12392. 666.22 s [vector] generate: OK
  12393. 666.22 s [vector] +++ OK, passed 100 tests.
  12394. 666.23 s [vector] iterateN: OK
  12395. 666.23 s [vector] +++ OK, passed 100 tests.
  12396. 666.25 s [vector] iterateNM: OK (0.01s)
  12397. 666.25 s [vector] +++ OK, passed 100 tests.
  12398. 666.25 s [vector] generateM: OK (0.02s)
  12399. 666.25 s [vector] +++ OK, passed 100 tests.
  12400. 666.27 s [vector] replicateM: OK (0.02s)
  12401. 666.27 s [vector] +++ OK, passed 100 tests.
  12402. 666.27 s [vector] create: OK
  12403. 666.27 s [vector] +++ OK, passed 100 tests.
  12404. 666.27 s [vector] createT: OK
  12405. 666.27 s [vector] +++ OK, passed 100 tests.
  12406. 666.27 s [vector] unfoldr: OK
  12407. 666.27 s [vector] +++ OK, passed 100 tests.
  12408. 666.27 s [vector] unfoldrN: OK
  12409. 666.27 s [vector] +++ OK, passed 100 tests.
  12410. 666.27 s [vector] unfoldrExactN: OK
  12411. 666.27 s [vector] +++ OK, passed 100 tests.
  12412. 666.27 s [vector] unfoldrM: OK
  12413. 666.27 s [vector] +++ OK, passed 100 tests.
  12414. 666.27 s [vector] unfoldrNM: OK
  12415. 666.30 s [vector] +++ OK, passed 100 tests.
  12416. 666.31 s [vector] unfoldrExactNM: OK (0.03s)
  12417. 666.31 s [vector] +++ OK, passed 100 tests.
  12418. 666.33 s [vector] constructN: OK (0.02s)
  12419. 666.33 s [vector] +++ OK, passed 100 tests.
  12420. 666.35 s [vector] constructrN: OK (0.02s)
  12421. 666.35 s [vector] +++ OK, passed 100 tests.
  12422. 666.35 s [vector] cons: OK
  12423. 666.35 s [vector] +++ OK, passed 100 tests.
  12424. 666.35 s [vector] snoc: OK
  12425. 666.35 s [vector] +++ OK, passed 100 tests.
  12426. 666.35 s [vector] append: OK
  12427. 666.35 s [vector] +++ OK, passed 100 tests.
  12428. 666.37 s [vector] concat: OK (0.02s)
  12429. 666.37 s [vector] +++ OK, passed 100 tests.
  12430. 666.38 s [vector] force: OK
  12431. 666.38 s [vector] +++ OK, passed 100 tests.
  12432. 666.39 s [vector] upd: OK
  12433. 666.39 s [vector] +++ OK, passed 100 tests.
  12434. 666.39 s [vector] accum: OK (0.02s)
  12435. 666.39 s [vector] +++ OK, passed 100 tests.
  12436. 666.39 s [vector] reverse: OK
  12437. 666.39 s [vector] +++ OK, passed 100 tests.
  12438. 666.39 s [vector] backpermute: OK
  12439. 666.40 s [vector] +++ OK, passed 100 tests.
  12440. 666.41 s [vector] map: OK
  12441. 666.41 s [vector] +++ OK, passed 100 tests.
  12442. 666.42 s [vector] imap: OK
  12443. 666.42 s [vector] +++ OK, passed 100 tests.
  12444. 666.43 s [vector] concatMap: OK
  12445. 666.43 s [vector] +++ OK, passed 100 tests.
  12446. 666.43 s [vector] mapM: OK
  12447. 666.43 s [vector] +++ OK, passed 100 tests.
  12448. 666.47 s [vector] mapM_: OK (0.04s)
  12449. 666.47 s [vector] +++ OK, passed 100 tests.
  12450. 666.47 s [vector] forM: OK
  12451. 666.47 s [vector] +++ OK, passed 100 tests.
  12452. 666.52 s [vector] forM_: OK (0.03s)
  12453. 666.52 s [vector] +++ OK, passed 100 tests.
  12454. 666.53 s [vector] imapM: OK
  12455. 666.53 s [vector] +++ OK, passed 100 tests.
  12456. 666.57 s [vector] imapM_: OK (0.04s)
  12457. 666.57 s [vector] +++ OK, passed 100 tests.
  12458. 666.59 s [vector] zipWith: OK (0.01s)
  12459. 666.59 s [vector] +++ OK, passed 100 tests.
  12460. 666.59 s [vector] zipWith3: OK (0.01s)
  12461. 666.59 s [vector] +++ OK, passed 100 tests.
  12462. 666.61 s [vector] izipWith: OK (0.01s)
  12463. 666.61 s [vector] +++ OK, passed 100 tests.
  12464. 666.62 s [vector] izipWith3: OK (0.01s)
  12465. 666.62 s [vector] +++ OK, passed 100 tests.
  12466. 666.63 s [vector] izipWithM: OK (0.01s)
  12467. 666.63 s [vector] +++ OK, passed 100 tests.
  12468. 666.67 s [vector] izipWithM_: OK (0.04s)
  12469. 666.67 s [vector] +++ OK, passed 100 tests.
  12470. 666.69 s [vector] zipWithM: OK (0.01s)
  12471. 666.69 s [vector] +++ OK, passed 100 tests.
  12472. 666.71 s [vector] zipWithM_: OK (0.03s)
  12473. 666.71 s [vector] +++ OK, passed 100 tests.
  12474. 666.72 s [vector] filter: OK
  12475. 666.72 s [vector] +++ OK, passed 100 tests.
  12476. 666.73 s [vector] ifilter: OK
  12477. 666.73 s [vector] +++ OK, passed 100 tests.
  12478. 666.76 s [vector] filterM: OK (0.04s)
  12479. 666.76 s [vector] +++ OK, passed 100 tests.
  12480. 666.77 s [vector] uniq: OK
  12481. 666.77 s [vector] +++ OK, passed 100 tests.
  12482. 666.77 s [vector] mapMaybe: OK
  12483. 666.77 s [vector] +++ OK, passed 100 tests.
  12484. 666.78 s [vector] imapMaybe: OK
  12485. 666.79 s [vector] +++ OK, passed 100 tests.
  12486. 666.79 s [vector] takeWhile: OK
  12487. 666.79 s [vector] +++ OK, passed 100 tests.
  12488. 666.79 s [vector] dropWhile: OK
  12489. 666.79 s [vector] +++ OK, passed 100 tests.
  12490. 666.79 s [vector] partition: OK
  12491. 666.80 s [vector] +++ OK, passed 100 tests.
  12492. 666.81 s [vector] partitionWith: OK
  12493. 666.81 s [vector] +++ OK, passed 100 tests.
  12494. 666.81 s [vector] span: OK
  12495. 666.81 s [vector] +++ OK, passed 100 tests.
  12496. 666.81 s [vector] break: OK
  12497. 666.81 s [vector] +++ OK, passed 100 tests.
  12498. 666.81 s [vector] spanR: OK
  12499. 666.81 s [vector] +++ OK, passed 100 tests.
  12500. 666.82 s [vector] breakR: OK
  12501. 666.82 s [vector] +++ OK, passed 100 tests.
  12502. 666.82 s [vector] groupBy: OK
  12503. 666.82 s [vector] +++ OK, passed 100 tests.
  12504. 666.82 s [vector] elem: OK
  12505. 666.82 s [vector] +++ OK, passed 100 tests.
  12506. 666.82 s [vector] notElem: OK
  12507. 666.82 s [vector] +++ OK, passed 100 tests.
  12508. 666.82 s [vector] find: OK
  12509. 666.82 s [vector] +++ OK, passed 100 tests.
  12510. 666.82 s [vector] findIndex: OK
  12511. 666.82 s [vector] +++ OK, passed 100 tests.
  12512. 666.82 s [vector] findIndexR: OK
  12513. 666.82 s [vector] +++ OK, passed 100 tests.
  12514. 666.83 s [vector] findIndices: OK
  12515. 666.83 s [vector] +++ OK, passed 100 tests.
  12516. 666.83 s [vector] elemIndex: OK
  12517. 666.83 s [vector] +++ OK, passed 100 tests.
  12518. 666.83 s [vector] elemIndices: OK
  12519. 666.84 s [vector] +++ OK, passed 100 tests.
  12520. 666.85 s [vector] foldl: OK (0.01s)
  12521. 666.85 s [vector] +++ OK, passed 100 tests.
  12522. 666.87 s [vector] foldl1: OK (0.01s)
  12523. 666.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12524. 666.87 s [vector] foldl': OK (0.01s)
  12525. 666.87 s [vector] +++ OK, passed 100 tests.
  12526. 666.89 s [vector] foldl1': OK (0.01s)
  12527. 666.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12528. 666.91 s [vector] foldr: OK (0.02s)
  12529. 666.91 s [vector] +++ OK, passed 100 tests.
  12530. 666.92 s [vector] foldr1: OK (0.01s)
  12531. 666.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12532. 666.93 s [vector] foldr': OK (0.01s)
  12533. 666.93 s [vector] +++ OK, passed 100 tests.
  12534. 666.95 s [vector] foldr1': OK (0.01s)
  12535. 666.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12536. 666.95 s [vector] ifoldl: OK (0.01s)
  12537. 666.95 s [vector] +++ OK, passed 100 tests.
  12538. 666.97 s [vector] ifoldl': OK
  12539. 666.97 s [vector] +++ OK, passed 100 tests.
  12540. 666.99 s [vector] ifoldr: OK (0.02s)
  12541. 666.99 s [vector] +++ OK, passed 100 tests.
  12542. 667.01 s [vector] ifoldr': OK (0.02s)
  12543. 667.01 s [vector] +++ OK, passed 100 tests.
  12544. 667.02 s [vector] ifoldM: OK (0.02s)
  12545. 667.02 s [vector] +++ OK, passed 100 tests.
  12546. 667.03 s [vector] ifoldM': OK (0.01s)
  12547. 667.03 s [vector] +++ OK, passed 100 tests.
  12548. 667.07 s [vector] ifoldM_: OK (0.04s)
  12549. 667.07 s [vector] +++ OK, passed 100 tests.
  12550. 667.11 s [vector] ifoldM'_: OK (0.04s)
  12551. 667.11 s [vector] +++ OK, passed 100 tests.
  12552. 667.11 s [vector] all: OK
  12553. 667.11 s [vector] +++ OK, passed 100 tests.
  12554. 667.12 s [vector] any: OK
  12555. 667.12 s [vector] +++ OK, passed 100 tests.
  12556. 667.13 s [vector] prescanl: OK (0.02s)
  12557. 667.13 s [vector] +++ OK, passed 100 tests.
  12558. 667.15 s [vector] prescanl': OK (0.02s)
  12559. 667.15 s [vector] +++ OK, passed 100 tests.
  12560. 667.17 s [vector] postscanl: OK (0.01s)
  12561. 667.17 s [vector] +++ OK, passed 100 tests.
  12562. 667.19 s [vector] postscanl': OK (0.02s)
  12563. 667.19 s [vector] +++ OK, passed 100 tests.
  12564. 667.21 s [vector] scanl: OK (0.02s)
  12565. 667.21 s [vector] +++ OK, passed 100 tests.
  12566. 667.21 s [vector] scanl': OK (0.02s)
  12567. 667.21 s [vector] +++ OK, passed 100 tests.
  12568. 667.23 s [vector] scanl1: OK (0.01s)
  12569. 667.23 s [vector] +++ OK, passed 100 tests.
  12570. 667.25 s [vector] scanl1': OK (0.02s)
  12571. 667.25 s [vector] +++ OK, passed 100 tests.
  12572. 667.27 s [vector] iscanl: OK (0.02s)
  12573. 667.27 s [vector] +++ OK, passed 100 tests.
  12574. 667.29 s [vector] iscanl': OK (0.02s)
  12575. 667.29 s [vector] +++ OK, passed 100 tests.
  12576. 667.31 s [vector] prescanr: OK (0.01s)
  12577. 667.31 s [vector] +++ OK, passed 100 tests.
  12578. 667.33 s [vector] prescanr': OK (0.03s)
  12579. 667.33 s [vector] +++ OK, passed 100 tests.
  12580. 667.35 s [vector] postscanr: OK (0.01s)
  12581. 667.35 s [vector] +++ OK, passed 100 tests.
  12582. 667.36 s [vector] postscanr': OK (0.01s)
  12583. 667.36 s [vector] +++ OK, passed 100 tests.
  12584. 667.37 s [vector] scanr: OK (0.01s)
  12585. 667.37 s [vector] +++ OK, passed 100 tests.
  12586. 667.39 s [vector] scanr': OK (0.01s)
  12587. 667.39 s [vector] +++ OK, passed 100 tests.
  12588. 667.40 s [vector] scanr1: OK (0.01s)
  12589. 667.40 s [vector] +++ OK, passed 100 tests.
  12590. 667.41 s [vector] scanr1': OK (0.01s)
  12591. 667.41 s [vector] +++ OK, passed 100 tests.
  12592. 667.43 s [vector] iscanr: OK (0.01s)
  12593. 667.43 s [vector] +++ OK, passed 100 tests.
  12594. 667.43 s [vector] iscanr': OK (0.01s)
  12595. 667.43 s [vector] +++ OK, passed 100 tests.
  12596. 667.43 s [vector] mut_read: OK
  12597. 667.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12598. 667.43 s [vector] mut_write: OK
  12599. 667.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12600. 667.43 s [vector] mut_modify: OK
  12601. 667.43 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12602. 667.45 s [vector] mut_generate: OK
  12603. 667.45 s [vector] +++ OK, passed 100 tests.
  12604. 667.47 s [vector] mut_generateM: OK (0.01s)
  12605. 667.47 s [vector] +++ OK, passed 100 tests.
  12606. 667.49 s [vector] mut_mapM_: OK (0.03s)
  12607. 667.49 s [vector] +++ OK, passed 100 tests.
  12608. 667.53 s [vector] mut_imapM_: OK (0.03s)
  12609. 667.53 s [vector] +++ OK, passed 100 tests.
  12610. 667.57 s [vector] mut_forM_: OK (0.04s)
  12611. 667.57 s [vector] +++ OK, passed 100 tests.
  12612. 667.59 s [vector] mut_iforM_: OK (0.03s)
  12613. 667.59 s [vector] +++ OK, passed 100 tests.
  12614. 667.61 s [vector] mut_foldr: OK (0.01s)
  12615. 667.61 s [vector] +++ OK, passed 100 tests.
  12616. 667.63 s [vector] mut_foldr': OK (0.01s)
  12617. 667.63 s [vector] +++ OK, passed 100 tests.
  12618. 667.63 s [vector] mut_foldl: OK (0.01s)
  12619. 667.63 s [vector] +++ OK, passed 100 tests.
  12620. 667.65 s [vector] mut_foldl': OK
  12621. 667.65 s [vector] +++ OK, passed 100 tests.
  12622. 667.67 s [vector] mut_ifoldr: OK (0.02s)
  12623. 667.67 s [vector] +++ OK, passed 100 tests.
  12624. 667.69 s [vector] mut_ifoldr': OK (0.02s)
  12625. 667.69 s [vector] +++ OK, passed 100 tests.
  12626. 667.70 s [vector] mut_ifoldl: OK (0.01s)
  12627. 667.70 s [vector] +++ OK, passed 100 tests.
  12628. 667.71 s [vector] mut_ifoldl': OK (0.02s)
  12629. 667.71 s [vector] +++ OK, passed 100 tests.
  12630. 667.73 s [vector] mut_foldM: OK (0.02s)
  12631. 667.73 s [vector] +++ OK, passed 100 tests.
  12632. 667.75 s [vector] mut_foldM': OK (0.02s)
  12633. 667.75 s [vector] +++ OK, passed 100 tests.
  12634. 667.77 s [vector] mut_foldrM: OK (0.01s)
  12635. 667.77 s [vector] +++ OK, passed 100 tests.
  12636. 667.77 s [vector] mut_foldrM': OK (0.02s)
  12637. 667.77 s [vector] +++ OK, passed 100 tests.
  12638. 667.79 s [vector] mut_ifoldM: OK (0.02s)
  12639. 667.79 s [vector] +++ OK, passed 100 tests.
  12640. 667.81 s [vector] mut_ifoldM': OK (0.02s)
  12641. 667.81 s [vector] +++ OK, passed 100 tests.
  12642. 667.83 s [vector] mut_ifoldrM: OK (0.01s)
  12643. 667.83 s [vector] +++ OK, passed 100 tests.
  12644. 667.83 s [vector] mut_ifoldrM': OK (0.02s)
  12645. 667.83 s [vector] +++ OK, passed 100 tests.
  12646. 667.83 s [vector] compare: OK
  12647. 667.83 s [vector] +++ OK, passed 100 tests.
  12648. 667.83 s [vector] maximum: OK
  12649. 667.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12650. 667.83 s [vector] minimum: OK
  12651. 667.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12652. 667.83 s [vector] minIndex: OK
  12653. 667.83 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12654. 667.83 s [vector] maxIndex: OK
  12655. 667.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12656. 667.84 s [vector] maximumBy: OK
  12657. 667.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12658. 667.84 s [vector] minimumBy: OK
  12659. 667.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12660. 667.84 s [vector] maximumOn: OK
  12661. 667.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12662. 667.84 s [vector] minimumOn: OK
  12663. 667.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12664. 667.84 s [vector] maxIndexBy: OK
  12665. 667.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12666. 667.84 s [vector] minIndexBy: OK
  12667. 667.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12668. 667.84 s [vector] ListFirstMaxIndexWins: OK
  12669. 667.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12670. 667.84 s [vector] FalseListFirstMaxIndexWins: OK
  12671. 667.84 s [vector] +++ OK, failed as expected. (after 1 test):
  12672. 667.84 s [vector] Exception:
  12673. 667.84 s [vector] Prelude.foldr1: empty list
  12674. 667.84 s [vector] CallStack (from HasCallStack):
  12675. 667.84 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  12676. 667.84 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  12677. 667.84 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12678. 667.84 s [vector] []
  12679. 667.84 s [vector] mempty: OK
  12680. 667.84 s [vector] +++ OK, passed 100 tests.
  12681. 667.84 s [vector] mappend: OK
  12682. 667.85 s [vector] +++ OK, passed 100 tests.
  12683. 667.87 s [vector] mconcat: OK (0.02s)
  12684. 667.87 s [vector] +++ OK, passed 100 tests.
  12685. 667.87 s [vector] glength: OK
  12686. 667.87 s [vector] +++ OK, passed 100 tests.
  12687. 667.87 s [vector] sum: OK
  12688. 667.87 s [vector] +++ OK, passed 100 tests.
  12689. 667.87 s [vector] product: OK
  12690. 667.87 s [vector] +++ OK, passed 100 tests.
  12691. 667.87 s [vector] enumFromN: OK
  12692. 667.87 s [vector] +++ OK, passed 100 tests.
  12693. 667.87 s [vector] enumFromThenN: OK
  12694. 667.87 s [vector] +++ OK, passed 100 tests.
  12695. 667.87 s [vector] enumFromTo: OK
  12696. 667.87 s [vector] +++ OK, passed 100 tests.
  12697. 667.87 s [vector] enumFromThenTo: OK
  12698. 667.87 s [vector] +++ OK, passed 100 tests; 6 discarded.
  12699. 667.87 s [vector] unstream
  12700. 667.87 s [vector] unstream == vunstream (exact): OK
  12701. 667.87 s [vector] +++ OK, passed 100 tests.
  12702. 667.87 s [vector] unstream == vunstream (unknown): OK
  12703. 667.87 s [vector] +++ OK, passed 100 tests.
  12704. 667.87 s [vector] unstreamR ~= vunstream (exact): OK
  12705. 667.87 s [vector] +++ OK, passed 100 tests.
  12706. 667.87 s [vector] unstreamR ~= vunstream (unknown): OK
  12707. 667.87 s [vector] +++ OK, passed 100 tests.
  12708. 667.87 s [vector] Tests.Vector.Storable
  12709. 667.87 s [vector] Data.Vector.Storable.Vector (Int)
  12710. 667.87 s [vector] fromList.toList == id: OK
  12711. 667.87 s [vector] +++ OK, passed 100 tests.
  12712. 667.87 s [vector] toList.fromList == id: OK
  12713. 667.87 s [vector] +++ OK, passed 100 tests.
  12714. 667.87 s [vector] unstream.stream == id: OK
  12715. 667.87 s [vector] +++ OK, passed 100 tests.
  12716. 667.87 s [vector] stream.unstream == id: OK
  12717. 667.88 s [vector] +++ OK, passed 100 tests.
  12718. 667.88 s [vector] eq: OK
  12719. 667.88 s [vector] +++ OK, passed 100 tests.
  12720. 667.88 s [vector] length: OK
  12721. 667.88 s [vector] +++ OK, passed 100 tests.
  12722. 667.88 s [vector] null: OK
  12723. 667.88 s [vector] +++ OK, passed 100 tests.
  12724. 667.88 s [vector] index: OK
  12725. 667.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12726. 667.88 s [vector] safeIndex: OK
  12727. 667.88 s [vector] +++ OK, passed 100 tests.
  12728. 667.88 s [vector] head: OK
  12729. 667.88 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12730. 667.88 s [vector] last: OK
  12731. 667.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12732. 667.88 s [vector] unsafeIndex: OK
  12733. 667.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12734. 667.88 s [vector] unsafeHead: OK
  12735. 667.88 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12736. 667.88 s [vector] unsafeLast: OK
  12737. 667.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12738. 667.88 s [vector] slice: OK
  12739. 667.88 s [vector] +++ OK, passed 100 tests.
  12740. 667.88 s [vector] init: OK
  12741. 667.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12742. 667.88 s [vector] tail: OK
  12743. 667.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12744. 667.88 s [vector] take: OK
  12745. 667.88 s [vector] +++ OK, passed 100 tests.
  12746. 667.88 s [vector] drop: OK
  12747. 667.88 s [vector] +++ OK, passed 100 tests.
  12748. 667.88 s [vector] splitAt: OK
  12749. 667.88 s [vector] +++ OK, passed 100 tests.
  12750. 667.88 s [vector] empty: OK
  12751. 667.88 s [vector] +++ OK, passed 100 tests.
  12752. 667.88 s [vector] singleton: OK
  12753. 667.88 s [vector] +++ OK, passed 100 tests.
  12754. 667.88 s [vector] replicate: OK
  12755. 667.88 s [vector] +++ OK, passed 100 tests.
  12756. 667.89 s [vector] generate: OK
  12757. 667.89 s [vector] +++ OK, passed 100 tests.
  12758. 667.89 s [vector] iterateN: OK
  12759. 667.89 s [vector] +++ OK, passed 100 tests.
  12760. 667.95 s [vector] iterateNM: OK (0.02s)
  12761. 668.39 s [vector] +++ OK, passed 100 tests.
  12762. 668.39 s [vector] generateM: OK (0.02s)
  12763. 668.39 s [vector] +++ OK, passed 100 tests.
  12764. 668.39 s [vector] replicateM: OK (0.01s)
  12765. 668.39 s [vector] +++ OK, passed 100 tests.
  12766. 668.39 s [vector] create: OK
  12767. 668.39 s [vector] +++ OK, passed 100 tests.
  12768. 668.39 s [vector] createT: OK
  12769. 668.39 s [vector] +++ OK, passed 100 tests.
  12770. 668.39 s [vector] unfoldr: OK
  12771. 668.39 s [vector] +++ OK, passed 100 tests.
  12772. 668.39 s [vector] unfoldrN: OK
  12773. 668.39 s [vector] +++ OK, passed 100 tests.
  12774. 668.39 s [vector] unfoldrExactN: OK
  12775. 668.39 s [vector] +++ OK, passed 100 tests.
  12776. 668.39 s [vector] unfoldrM: OK
  12777. 668.39 s [vector] +++ OK, passed 100 tests.
  12778. 668.39 s [vector] unfoldrNM: OK
  12779. 668.39 s [vector] +++ OK, passed 100 tests.
  12780. 668.39 s [vector] unfoldrExactNM: OK (0.02s)
  12781. 668.39 s [vector] +++ OK, passed 100 tests.
  12782. 668.39 s [vector] constructN: OK (0.02s)
  12783. 668.39 s [vector] +++ OK, passed 100 tests.
  12784. 668.39 s [vector] constructrN: OK
  12785. 668.39 s [vector] +++ OK, passed 100 tests.
  12786. 668.39 s [vector] cons: OK
  12787. 668.39 s [vector] +++ OK, passed 100 tests.
  12788. 668.39 s [vector] snoc: OK
  12789. 668.39 s [vector] +++ OK, passed 100 tests.
  12790. 668.39 s [vector] append: OK
  12791. 668.39 s [vector] +++ OK, passed 100 tests.
  12792. 668.39 s [vector] concat: OK (0.02s)
  12793. 668.39 s [vector] +++ OK, passed 100 tests.
  12794. 668.39 s [vector] force: OK
  12795. 668.39 s [vector] +++ OK, passed 100 tests.
  12796. 668.39 s [vector] upd: OK
  12797. 668.39 s [vector] +++ OK, passed 100 tests.
  12798. 668.39 s [vector] accum: OK
  12799. 668.39 s [vector] +++ OK, passed 100 tests.
  12800. 668.39 s [vector] reverse: OK
  12801. 668.39 s [vector] +++ OK, passed 100 tests.
  12802. 668.39 s [vector] backpermute: OK
  12803. 668.39 s [vector] +++ OK, passed 100 tests.
  12804. 668.39 s [vector] map: OK
  12805. 668.39 s [vector] +++ OK, passed 100 tests.
  12806. 668.39 s [vector] imap: OK
  12807. 668.39 s [vector] +++ OK, passed 100 tests.
  12808. 668.39 s [vector] concatMap: OK
  12809. 668.39 s [vector] +++ OK, passed 100 tests.
  12810. 668.39 s [vector] mapM: OK
  12811. 668.39 s [vector] +++ OK, passed 100 tests.
  12812. 668.39 s [vector] mapM_: OK (0.02s)
  12813. 668.39 s [vector] +++ OK, passed 100 tests.
  12814. 668.39 s [vector] forM: OK
  12815. 668.39 s [vector] +++ OK, passed 100 tests.
  12816. 668.39 s [vector] forM_: OK (0.02s)
  12817. 668.39 s [vector] +++ OK, passed 100 tests.
  12818. 668.39 s [vector] imapM: OK
  12819. 668.39 s [vector] +++ OK, passed 100 tests.
  12820. 668.39 s [vector] imapM_: OK (0.02s)
  12821. 668.39 s [vector] +++ OK, passed 100 tests.
  12822. 668.39 s [vector] zipWith: OK
  12823. 668.39 s [vector] +++ OK, passed 100 tests.
  12824. 668.39 s [vector] zipWith3: OK
  12825. 668.39 s [vector] +++ OK, passed 100 tests.
  12826. 668.39 s [vector] izipWith: OK
  12827. 668.39 s [vector] +++ OK, passed 100 tests.
  12828. 668.39 s [vector] izipWith3: OK
  12829. 668.39 s [vector] +++ OK, passed 100 tests.
  12830. 668.39 s [vector] izipWithM: OK
  12831. 668.39 s [vector] +++ OK, passed 100 tests.
  12832. 668.39 s [vector] izipWithM_: OK (0.01s)
  12833. 668.39 s [vector] +++ OK, passed 100 tests.
  12834. 668.39 s [vector] zipWithM: OK
  12835. 668.39 s [vector] +++ OK, passed 100 tests.
  12836. 668.39 s [vector] zipWithM_: OK (0.01s)
  12837. 668.39 s [vector] +++ OK, passed 100 tests.
  12838. 668.39 s [vector] filter: OK
  12839. 668.39 s [vector] +++ OK, passed 100 tests.
  12840. 668.39 s [vector] ifilter: OK
  12841. 668.39 s [vector] +++ OK, passed 100 tests.
  12842. 668.39 s [vector] filterM: OK (0.03s)
  12843. 668.39 s [vector] +++ OK, passed 100 tests.
  12844. 668.39 s [vector] uniq: OK
  12845. 668.39 s [vector] +++ OK, passed 100 tests.
  12846. 668.39 s [vector] mapMaybe: OK
  12847. 668.39 s [vector] +++ OK, passed 100 tests.
  12848. 668.39 s [vector] imapMaybe: OK
  12849. 668.39 s [vector] +++ OK, passed 100 tests.
  12850. 668.39 s [vector] takeWhile: OK
  12851. 668.39 s [vector] +++ OK, passed 100 tests.
  12852. 668.39 s [vector] dropWhile: OK
  12853. 668.39 s [vector] +++ OK, passed 100 tests.
  12854. 668.39 s [vector] partition: OK
  12855. 668.39 s [vector] +++ OK, passed 100 tests.
  12856. 668.39 s [vector] partitionWith: OK
  12857. 668.39 s [vector] +++ OK, passed 100 tests.
  12858. 668.39 s [vector] span: OK
  12859. 668.39 s [vector] +++ OK, passed 100 tests.
  12860. 668.39 s [vector] break: OK
  12861. 668.39 s [vector] +++ OK, passed 100 tests.
  12862. 668.39 s [vector] spanR: OK
  12863. 668.39 s [vector] +++ OK, passed 100 tests.
  12864. 668.39 s [vector] breakR: OK
  12865. 668.39 s [vector] +++ OK, passed 100 tests.
  12866. 668.39 s [vector] groupBy: OK
  12867. 668.39 s [vector] +++ OK, passed 100 tests.
  12868. 668.39 s [vector] elem: OK
  12869. 668.39 s [vector] +++ OK, passed 100 tests.
  12870. 668.39 s [vector] notElem: OK
  12871. 668.39 s [vector] +++ OK, passed 100 tests.
  12872. 668.39 s [vector] find: OK
  12873. 668.39 s [vector] +++ OK, passed 100 tests.
  12874. 668.39 s [vector] findIndex: OK
  12875. 668.39 s [vector] +++ OK, passed 100 tests.
  12876. 668.39 s [vector] findIndexR: OK
  12877. 668.40 s [vector] +++ OK, passed 100 tests.
  12878. 668.40 s [vector] findIndices: OK
  12879. 668.40 s [vector] +++ OK, passed 100 tests.
  12880. 668.40 s [vector] elemIndex: OK
  12881. 668.40 s [vector] +++ OK, passed 100 tests.
  12882. 668.40 s [vector] elemIndices: OK
  12883. 668.40 s [vector] +++ OK, passed 100 tests.
  12884. 668.40 s [vector] foldl: OK
  12885. 668.40 s [vector] +++ OK, passed 100 tests.
  12886. 668.40 s [vector] foldl1: OK
  12887. 668.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12888. 668.40 s [vector] foldl': OK
  12889. 668.40 s [vector] +++ OK, passed 100 tests.
  12890. 668.40 s [vector] foldl1': OK
  12891. 668.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12892. 668.40 s [vector] foldr: OK
  12893. 668.40 s [vector] +++ OK, passed 100 tests.
  12894. 668.40 s [vector] foldr1: OK
  12895. 668.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12896. 668.40 s [vector] foldr': OK
  12897. 668.40 s [vector] +++ OK, passed 100 tests.
  12898. 668.40 s [vector] foldr1': OK
  12899. 668.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12900. 668.40 s [vector] ifoldl: OK
  12901. 668.40 s [vector] +++ OK, passed 100 tests.
  12902. 668.40 s [vector] ifoldl': OK
  12903. 668.40 s [vector] +++ OK, passed 100 tests.
  12904. 668.40 s [vector] ifoldr: OK
  12905. 668.40 s [vector] +++ OK, passed 100 tests.
  12906. 668.40 s [vector] ifoldr': OK
  12907. 668.40 s [vector] +++ OK, passed 100 tests.
  12908. 668.40 s [vector] ifoldM: OK
  12909. 668.40 s [vector] +++ OK, passed 100 tests.
  12910. 668.40 s [vector] ifoldM': OK
  12911. 668.40 s [vector] +++ OK, passed 100 tests.
  12912. 668.40 s [vector] ifoldM_: OK (0.01s)
  12913. 668.40 s [vector] +++ OK, passed 100 tests.
  12914. 668.40 s [vector] ifoldM'_: OK (0.02s)
  12915. 668.40 s [vector] +++ OK, passed 100 tests.
  12916. 668.40 s [vector] all: OK
  12917. 668.40 s [vector] +++ OK, passed 100 tests.
  12918. 668.40 s [vector] any: OK
  12919. 668.40 s [vector] +++ OK, passed 100 tests.
  12920. 668.40 s [vector] prescanl: OK
  12921. 668.40 s [vector] +++ OK, passed 100 tests.
  12922. 668.40 s [vector] prescanl': OK
  12923. 668.40 s [vector] +++ OK, passed 100 tests.
  12924. 668.40 s [vector] postscanl: OK
  12925. 668.40 s [vector] +++ OK, passed 100 tests.
  12926. 668.40 s [vector] postscanl': OK
  12927. 668.40 s [vector] +++ OK, passed 100 tests.
  12928. 668.40 s [vector] scanl: OK
  12929. 668.40 s [vector] +++ OK, passed 100 tests.
  12930. 668.40 s [vector] scanl': OK
  12931. 668.40 s [vector] +++ OK, passed 100 tests.
  12932. 668.40 s [vector] scanl1: OK
  12933. 668.40 s [vector] +++ OK, passed 100 tests.
  12934. 668.40 s [vector] scanl1': OK
  12935. 668.40 s [vector] +++ OK, passed 100 tests.
  12936. 668.40 s [vector] iscanl: OK
  12937. 668.40 s [vector] +++ OK, passed 100 tests.
  12938. 668.40 s [vector] iscanl': OK
  12939. 668.40 s [vector] +++ OK, passed 100 tests.
  12940. 668.40 s [vector] prescanr: OK
  12941. 668.40 s [vector] +++ OK, passed 100 tests.
  12942. 668.40 s [vector] prescanr': OK
  12943. 668.40 s [vector] +++ OK, passed 100 tests.
  12944. 668.40 s [vector] postscanr: OK
  12945. 668.40 s [vector] +++ OK, passed 100 tests.
  12946. 668.40 s [vector] postscanr': OK
  12947. 668.40 s [vector] +++ OK, passed 100 tests.
  12948. 668.40 s [vector] scanr: OK
  12949. 668.40 s [vector] +++ OK, passed 100 tests.
  12950. 668.40 s [vector] scanr': OK
  12951. 668.40 s [vector] +++ OK, passed 100 tests.
  12952. 668.40 s [vector] scanr1: OK
  12953. 668.40 s [vector] +++ OK, passed 100 tests.
  12954. 668.40 s [vector] scanr1': OK
  12955. 668.40 s [vector] +++ OK, passed 100 tests.
  12956. 668.40 s [vector] iscanr: OK
  12957. 668.40 s [vector] +++ OK, passed 100 tests.
  12958. 668.40 s [vector] iscanr': OK
  12959. 668.40 s [vector] +++ OK, passed 100 tests.
  12960. 668.40 s [vector] mut_read: OK
  12961. 668.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12962. 668.40 s [vector] mut_write: OK
  12963. 668.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12964. 668.40 s [vector] mut_modify: OK
  12965. 668.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12966. 668.40 s [vector] mut_generate: OK
  12967. 668.40 s [vector] +++ OK, passed 100 tests.
  12968. 668.40 s [vector] mut_generateM: OK (0.01s)
  12969. 668.40 s [vector] +++ OK, passed 100 tests.
  12970. 668.40 s [vector] mut_mapM_: OK (0.01s)
  12971. 668.40 s [vector] +++ OK, passed 100 tests.
  12972. 668.40 s [vector] mut_imapM_: OK (0.02s)
  12973. 668.40 s [vector] +++ OK, passed 100 tests.
  12974. 668.40 s [vector] mut_forM_: OK (0.01s)
  12975. 668.40 s [vector] +++ OK, passed 100 tests.
  12976. 668.40 s [vector] mut_iforM_: OK (0.01s)
  12977. 668.40 s [vector] +++ OK, passed 100 tests.
  12978. 668.40 s [vector] mut_foldr: OK
  12979. 668.40 s [vector] +++ OK, passed 100 tests.
  12980. 668.40 s [vector] mut_foldr': OK
  12981. 668.40 s [vector] +++ OK, passed 100 tests.
  12982. 668.40 s [vector] mut_foldl: OK
  12983. 668.40 s [vector] +++ OK, passed 100 tests.
  12984. 668.40 s [vector] mut_foldl': OK
  12985. 668.40 s [vector] +++ OK, passed 100 tests.
  12986. 668.40 s [vector] mut_ifoldr: OK
  12987. 668.40 s [vector] +++ OK, passed 100 tests.
  12988. 668.40 s [vector] mut_ifoldr': OK
  12989. 668.40 s [vector] +++ OK, passed 100 tests.
  12990. 668.40 s [vector] mut_ifoldl: OK
  12991. 668.40 s [vector] +++ OK, passed 100 tests.
  12992. 668.40 s [vector] mut_ifoldl': OK
  12993. 668.40 s [vector] +++ OK, passed 100 tests.
  12994. 668.40 s [vector] mut_foldM: OK
  12995. 668.40 s [vector] +++ OK, passed 100 tests.
  12996. 668.40 s [vector] mut_foldM': OK
  12997. 668.40 s [vector] +++ OK, passed 100 tests.
  12998. 668.40 s [vector] mut_foldrM: OK
  12999. 668.40 s [vector] +++ OK, passed 100 tests.
  13000. 668.40 s [vector] mut_foldrM': OK
  13001. 668.40 s [vector] +++ OK, passed 100 tests.
  13002. 668.40 s [vector] mut_ifoldM: OK
  13003. 668.41 s [vector] +++ OK, passed 100 tests.
  13004. 668.41 s [vector] mut_ifoldM': OK
  13005. 668.41 s [vector] +++ OK, passed 100 tests.
  13006. 668.41 s [vector] mut_ifoldrM: OK
  13007. 668.41 s [vector] +++ OK, passed 100 tests.
  13008. 668.41 s [vector] mut_ifoldrM': OK
  13009. 668.41 s [vector] +++ OK, passed 100 tests.
  13010. 668.41 s [vector] compare: OK
  13011. 668.41 s [vector] +++ OK, passed 100 tests.
  13012. 668.41 s [vector] maximum: OK
  13013. 668.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13014. 668.41 s [vector] minimum: OK
  13015. 668.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13016. 668.41 s [vector] minIndex: OK
  13017. 668.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13018. 668.42 s [vector] maxIndex: OK
  13019. 668.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13020. 668.42 s [vector] maximumBy: OK
  13021. 668.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13022. 668.42 s [vector] minimumBy: OK
  13023. 668.42 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13024. 668.42 s [vector] maximumOn: OK
  13025. 668.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13026. 668.42 s [vector] minimumOn: OK
  13027. 668.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13028. 668.42 s [vector] maxIndexBy: OK
  13029. 668.42 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13030. 668.42 s [vector] minIndexBy: OK
  13031. 668.42 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13032. 668.42 s [vector] ListFirstMaxIndexWins: OK
  13033. 668.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13034. 668.42 s [vector] FalseListFirstMaxIndexWins: OK
  13035. 668.42 s [vector] +++ OK, failed as expected. (after 1 test):
  13036. 668.42 s [vector] Exception:
  13037. 668.42 s [vector] Prelude.foldr1: empty list
  13038. 668.42 s [vector] CallStack (from HasCallStack):
  13039. 668.42 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13040. 668.42 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13041. 668.42 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13042. 668.42 s [vector] []
  13043. 668.42 s [vector] mempty: OK
  13044. 668.42 s [vector] +++ OK, passed 100 tests.
  13045. 668.42 s [vector] mappend: OK
  13046. 668.43 s [vector] +++ OK, passed 100 tests.
  13047. 668.43 s [vector] mconcat: OK (0.01s)
  13048. 668.43 s [vector] +++ OK, passed 100 tests.
  13049. 668.43 s [vector] glength: OK
  13050. 668.43 s [vector] +++ OK, passed 100 tests.
  13051. 668.43 s [vector] sum: OK
  13052. 668.43 s [vector] +++ OK, passed 100 tests.
  13053. 668.44 s [vector] product: OK
  13054. 668.44 s [vector] +++ OK, passed 100 tests.
  13055. 668.44 s [vector] enumFromN: OK
  13056. 668.44 s [vector] +++ OK, passed 100 tests.
  13057. 668.44 s [vector] enumFromThenN: OK
  13058. 668.44 s [vector] +++ OK, passed 100 tests.
  13059. 668.44 s [vector] enumFromTo: OK
  13060. 668.44 s [vector] +++ OK, passed 100 tests.
  13061. 668.44 s [vector] enumFromThenTo: OK
  13062. 668.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13063. 668.44 s [vector] Data.Vector.Storable.Vector (Double)
  13064. 668.44 s [vector] fromList.toList == id: OK
  13065. 668.44 s [vector] +++ OK, passed 100 tests.
  13066. 668.44 s [vector] toList.fromList == id: OK
  13067. 668.44 s [vector] +++ OK, passed 100 tests.
  13068. 668.44 s [vector] unstream.stream == id: OK
  13069. 668.44 s [vector] +++ OK, passed 100 tests.
  13070. 668.44 s [vector] stream.unstream == id: OK
  13071. 668.44 s [vector] +++ OK, passed 100 tests.
  13072. 668.44 s [vector] eq: OK
  13073. 668.44 s [vector] +++ OK, passed 100 tests.
  13074. 668.44 s [vector] length: OK
  13075. 668.44 s [vector] +++ OK, passed 100 tests.
  13076. 668.44 s [vector] null: OK
  13077. 668.44 s [vector] +++ OK, passed 100 tests.
  13078. 668.44 s [vector] index: OK
  13079. 668.44 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13080. 668.44 s [vector] safeIndex: OK
  13081. 668.44 s [vector] +++ OK, passed 100 tests.
  13082. 668.44 s [vector] head: OK
  13083. 668.44 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13084. 668.44 s [vector] last: OK
  13085. 668.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13086. 668.44 s [vector] unsafeIndex: OK
  13087. 668.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13088. 668.44 s [vector] unsafeHead: OK
  13089. 668.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13090. 668.45 s [vector] unsafeLast: OK
  13091. 668.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13092. 668.45 s [vector] slice: OK
  13093. 668.45 s [vector] +++ OK, passed 100 tests.
  13094. 668.45 s [vector] init: OK
  13095. 668.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13096. 668.45 s [vector] tail: OK
  13097. 668.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13098. 668.45 s [vector] take: OK
  13099. 668.45 s [vector] +++ OK, passed 100 tests.
  13100. 668.45 s [vector] drop: OK
  13101. 668.45 s [vector] +++ OK, passed 100 tests.
  13102. 668.45 s [vector] splitAt: OK
  13103. 668.45 s [vector] +++ OK, passed 100 tests.
  13104. 668.45 s [vector] empty: OK
  13105. 668.45 s [vector] +++ OK, passed 100 tests.
  13106. 668.45 s [vector] singleton: OK
  13107. 668.45 s [vector] +++ OK, passed 100 tests.
  13108. 668.45 s [vector] replicate: OK
  13109. 668.45 s [vector] +++ OK, passed 100 tests.
  13110. 668.46 s [vector] generate: OK
  13111. 668.46 s [vector] +++ OK, passed 100 tests.
  13112. 668.46 s [vector] iterateN: OK
  13113. 668.47 s [vector] +++ OK, passed 100 tests.
  13114. 668.49 s [vector] iterateNM: OK (0.03s)
  13115. 668.49 s [vector] +++ OK, passed 100 tests.
  13116. 668.53 s [vector] generateM: OK (0.03s)
  13117. 668.53 s [vector] +++ OK, passed 100 tests.
  13118. 668.54 s [vector] replicateM: OK (0.03s)
  13119. 668.54 s [vector] +++ OK, passed 100 tests.
  13120. 668.56 s [vector] create: OK
  13121. 668.56 s [vector] +++ OK, passed 100 tests.
  13122. 668.56 s [vector] createT: OK (0.01s)
  13123. 668.56 s [vector] +++ OK, passed 100 tests.
  13124. 668.56 s [vector] unfoldr: OK
  13125. 668.56 s [vector] +++ OK, passed 100 tests.
  13126. 668.56 s [vector] unfoldrN: OK
  13127. 668.56 s [vector] +++ OK, passed 100 tests.
  13128. 668.56 s [vector] unfoldrExactN: OK
  13129. 668.56 s [vector] +++ OK, passed 100 tests.
  13130. 668.57 s [vector] unfoldrM: OK
  13131. 668.57 s [vector] +++ OK, passed 100 tests.
  13132. 668.57 s [vector] unfoldrNM: OK
  13133. 668.57 s [vector] +++ OK, passed 100 tests.
  13134. 668.59 s [vector] unfoldrExactNM: OK
  13135. 668.59 s [vector] +++ OK, passed 100 tests.
  13136. 668.61 s [vector] constructN: OK (0.02s)
  13137. 668.61 s [vector] +++ OK, passed 100 tests.
  13138. 668.62 s [vector] constructrN: OK (0.02s)
  13139. 668.62 s [vector] +++ OK, passed 100 tests.
  13140. 668.62 s [vector] cons: OK
  13141. 668.62 s [vector] +++ OK, passed 100 tests.
  13142. 668.62 s [vector] snoc: OK
  13143. 668.62 s [vector] +++ OK, passed 100 tests.
  13144. 668.63 s [vector] append: OK
  13145. 668.63 s [vector] +++ OK, passed 100 tests.
  13146. 668.65 s [vector] concat: OK (0.03s)
  13147. 668.65 s [vector] +++ OK, passed 100 tests.
  13148. 668.65 s [vector] force: OK
  13149. 668.65 s [vector] +++ OK, passed 100 tests.
  13150. 668.65 s [vector] upd: OK
  13151. 668.67 s [vector] +++ OK, passed 100 tests.
  13152. 668.67 s [vector] accum: OK (0.02s)
  13153. 668.67 s [vector] +++ OK, passed 100 tests.
  13154. 668.67 s [vector] reverse: OK
  13155. 668.67 s [vector] +++ OK, passed 100 tests.
  13156. 668.68 s [vector] backpermute: OK
  13157. 668.68 s [vector] +++ OK, passed 100 tests.
  13158. 668.68 s [vector] map: OK
  13159. 668.69 s [vector] +++ OK, passed 100 tests.
  13160. 668.70 s [vector] imap: OK (0.01s)
  13161. 668.70 s [vector] +++ OK, passed 100 tests.
  13162. 668.70 s [vector] concatMap: OK
  13163. 668.70 s [vector] +++ OK, passed 100 tests.
  13164. 668.71 s [vector] mapM: OK
  13165. 668.71 s [vector] +++ OK, passed 100 tests.
  13166. 668.75 s [vector] mapM_: OK (0.04s)
  13167. 668.75 s [vector] +++ OK, passed 100 tests.
  13168. 668.75 s [vector] forM: OK
  13169. 668.77 s [vector] +++ OK, passed 100 tests.
  13170. 668.79 s [vector] forM_: OK (0.03s)
  13171. 668.79 s [vector] +++ OK, passed 100 tests.
  13172. 668.79 s [vector] imapM: OK
  13173. 668.81 s [vector] +++ OK, passed 100 tests.
  13174. 668.84 s [vector] imapM_: OK (0.04s)
  13175. 668.84 s [vector] +++ OK, passed 100 tests.
  13176. 668.85 s [vector] zipWith: OK
  13177. 668.85 s [vector] +++ OK, passed 100 tests.
  13178. 668.85 s [vector] zipWith3: OK (0.01s)
  13179. 668.85 s [vector] +++ OK, passed 100 tests.
  13180. 668.86 s [vector] izipWith: OK
  13181. 668.87 s [vector] +++ OK, passed 100 tests.
  13182. 668.88 s [vector] izipWith3: OK (0.01s)
  13183. 668.88 s [vector] +++ OK, passed 100 tests.
  13184. 668.88 s [vector] izipWithM: OK
  13185. 668.89 s [vector] +++ OK, passed 100 tests.
  13186. 668.91 s [vector] izipWithM_: OK (0.03s)
  13187. 668.91 s [vector] +++ OK, passed 100 tests.
  13188. 668.93 s [vector] zipWithM: OK (0.01s)
  13189. 668.93 s [vector] +++ OK, passed 100 tests.
  13190. 668.96 s [vector] zipWithM_: OK (0.03s)
  13191. 668.96 s [vector] +++ OK, passed 100 tests.
  13192. 668.97 s [vector] filter: OK
  13193. 668.99 s [vector] +++ OK, passed 100 tests.
  13194. 668.99 s [vector] ifilter: OK
  13195. 668.99 s [vector] +++ OK, passed 100 tests.
  13196. 669.04 s [vector] filterM: OK (0.07s)
  13197. 669.04 s [vector] +++ OK, passed 100 tests.
  13198. 669.04 s [vector] uniq: OK
  13199. 669.04 s [vector] +++ OK, passed 100 tests.
  13200. 669.05 s [vector] mapMaybe: OK
  13201. 669.05 s [vector] +++ OK, passed 100 tests.
  13202. 669.05 s [vector] imapMaybe: OK
  13203. 669.05 s [vector] +++ OK, passed 100 tests.
  13204. 669.05 s [vector] takeWhile: OK
  13205. 669.05 s [vector] +++ OK, passed 100 tests.
  13206. 669.05 s [vector] dropWhile: OK
  13207. 669.06 s [vector] +++ OK, passed 100 tests.
  13208. 669.07 s [vector] partition: OK
  13209. 669.07 s [vector] +++ OK, passed 100 tests.
  13210. 669.07 s [vector] partitionWith: OK
  13211. 669.07 s [vector] +++ OK, passed 100 tests.
  13212. 669.08 s [vector] span: OK
  13213. 669.08 s [vector] +++ OK, passed 100 tests.
  13214. 669.08 s [vector] break: OK
  13215. 669.08 s [vector] +++ OK, passed 100 tests.
  13216. 669.08 s [vector] spanR: OK
  13217. 669.08 s [vector] +++ OK, passed 100 tests.
  13218. 669.09 s [vector] breakR: OK
  13219. 669.09 s [vector] +++ OK, passed 100 tests.
  13220. 669.09 s [vector] groupBy: OK (0.01s)
  13221. 669.09 s [vector] +++ OK, passed 100 tests.
  13222. 669.10 s [vector] elem: OK
  13223. 669.10 s [vector] +++ OK, passed 100 tests.
  13224. 669.10 s [vector] notElem: OK
  13225. 669.10 s [vector] +++ OK, passed 100 tests.
  13226. 669.10 s [vector] find: OK
  13227. 669.10 s [vector] +++ OK, passed 100 tests.
  13228. 669.10 s [vector] findIndex: OK
  13229. 669.10 s [vector] +++ OK, passed 100 tests.
  13230. 669.11 s [vector] findIndexR: OK
  13231. 669.11 s [vector] +++ OK, passed 100 tests.
  13232. 669.11 s [vector] findIndices: OK
  13233. 669.11 s [vector] +++ OK, passed 100 tests.
  13234. 669.11 s [vector] elemIndex: OK
  13235. 669.11 s [vector] +++ OK, passed 100 tests.
  13236. 669.12 s [vector] elemIndices: OK
  13237. 669.13 s [vector] +++ OK, passed 100 tests.
  13238. 669.13 s [vector] foldl: OK (0.01s)
  13239. 669.13 s [vector] +++ OK, passed 100 tests.
  13240. 669.15 s [vector] foldl1: OK (0.02s)
  13241. 669.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13242. 669.16 s [vector] foldl': OK (0.02s)
  13243. 669.16 s [vector] +++ OK, passed 100 tests.
  13244. 669.17 s [vector] foldl1': OK
  13245. 669.19 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13246. 669.19 s [vector] foldr: OK (0.01s)
  13247. 669.19 s [vector] +++ OK, passed 100 tests.
  13248. 669.21 s [vector] foldr1: OK (0.01s)
  13249. 669.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13250. 669.22 s [vector] foldr': OK (0.01s)
  13251. 669.22 s [vector] +++ OK, passed 100 tests.
  13252. 669.23 s [vector] foldr1': OK (0.01s)
  13253. 669.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13254. 669.24 s [vector] ifoldl: OK (0.01s)
  13255. 669.24 s [vector] +++ OK, passed 100 tests.
  13256. 669.25 s [vector] ifoldl': OK (0.01s)
  13257. 669.25 s [vector] +++ OK, passed 100 tests.
  13258. 669.26 s [vector] ifoldr: OK (0.01s)
  13259. 669.26 s [vector] +++ OK, passed 100 tests.
  13260. 669.27 s [vector] ifoldr': OK
  13261. 669.28 s [vector] +++ OK, passed 100 tests.
  13262. 669.29 s [vector] ifoldM: OK (0.01s)
  13263. 669.29 s [vector] +++ OK, passed 100 tests.
  13264. 669.30 s [vector] ifoldM': OK (0.02s)
  13265. 669.30 s [vector] +++ OK, passed 100 tests.
  13266. 669.35 s [vector] ifoldM_: OK (0.03s)
  13267. 669.35 s [vector] +++ OK, passed 100 tests.
  13268. 669.37 s [vector] ifoldM'_: OK (0.03s)
  13269. 669.37 s [vector] +++ OK, passed 100 tests.
  13270. 669.37 s [vector] all: OK
  13271. 669.37 s [vector] +++ OK, passed 100 tests.
  13272. 669.37 s [vector] any: OK
  13273. 669.38 s [vector] +++ OK, passed 100 tests.
  13274. 669.39 s [vector] prescanl: OK (0.01s)
  13275. 669.39 s [vector] +++ OK, passed 100 tests.
  13276. 669.41 s [vector] prescanl': OK (0.02s)
  13277. 669.41 s [vector] +++ OK, passed 100 tests.
  13278. 669.43 s [vector] postscanl: OK (0.01s)
  13279. 669.43 s [vector] +++ OK, passed 100 tests.
  13280. 669.44 s [vector] postscanl': OK (0.01s)
  13281. 669.44 s [vector] +++ OK, passed 100 tests.
  13282. 669.44 s [vector] scanl: OK (0.01s)
  13283. 669.44 s [vector] +++ OK, passed 100 tests.
  13284. 669.47 s [vector] scanl': OK
  13285. 669.47 s [vector] +++ OK, passed 100 tests.
  13286. 669.49 s [vector] scanl1: OK (0.01s)
  13287. 669.49 s [vector] +++ OK, passed 100 tests.
  13288. 669.49 s [vector] scanl1': OK (0.01s)
  13289. 669.49 s [vector] +++ OK, passed 100 tests.
  13290. 669.51 s [vector] iscanl: OK (0.02s)
  13291. 669.51 s [vector] +++ OK, passed 100 tests.
  13292. 669.53 s [vector] iscanl': OK (0.02s)
  13293. 669.53 s [vector] +++ OK, passed 100 tests.
  13294. 669.55 s [vector] prescanr: OK (0.01s)
  13295. 669.55 s [vector] +++ OK, passed 100 tests.
  13296. 669.58 s [vector] prescanr': OK (0.02s)
  13297. 669.58 s [vector] +++ OK, passed 100 tests.
  13298. 669.58 s [vector] postscanr: OK (0.02s)
  13299. 669.58 s [vector] +++ OK, passed 100 tests.
  13300. 669.59 s [vector] postscanr': OK (0.02s)
  13301. 669.59 s [vector] +++ OK, passed 100 tests.
  13302. 669.61 s [vector] scanr: OK (0.01s)
  13303. 669.61 s [vector] +++ OK, passed 100 tests.
  13304. 669.62 s [vector] scanr': OK (0.01s)
  13305. 669.63 s [vector] +++ OK, passed 100 tests.
  13306. 669.63 s [vector] scanr1: OK (0.01s)
  13307. 669.63 s [vector] +++ OK, passed 100 tests.
  13308. 669.65 s [vector] scanr1': OK (0.01s)
  13309. 669.65 s [vector] +++ OK, passed 100 tests.
  13310. 669.66 s [vector] iscanr: OK (0.01s)
  13311. 669.66 s [vector] +++ OK, passed 100 tests.
  13312. 669.66 s [vector] iscanr': OK (0.01s)
  13313. 669.66 s [vector] +++ OK, passed 100 tests.
  13314. 669.66 s [vector] mut_read: OK
  13315. 669.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13316. 669.67 s [vector] mut_write: OK
  13317. 669.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13318. 669.67 s [vector] mut_modify: OK
  13319. 669.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13320. 669.67 s [vector] mut_generate: OK
  13321. 669.68 s [vector] +++ OK, passed 100 tests.
  13322. 669.69 s [vector] mut_generateM: OK (0.02s)
  13323. 669.69 s [vector] +++ OK, passed 100 tests.
  13324. 669.73 s [vector] mut_mapM_: OK (0.03s)
  13325. 669.73 s [vector] +++ OK, passed 100 tests.
  13326. 669.77 s [vector] mut_imapM_: OK (0.03s)
  13327. 669.77 s [vector] +++ OK, passed 100 tests.
  13328. 669.79 s [vector] mut_forM_: OK (0.04s)
  13329. 669.79 s [vector] +++ OK, passed 100 tests.
  13330. 669.83 s [vector] mut_iforM_: OK (0.04s)
  13331. 669.83 s [vector] +++ OK, passed 100 tests.
  13332. 669.85 s [vector] mut_foldr: OK (0.01s)
  13333. 669.85 s [vector] +++ OK, passed 100 tests.
  13334. 669.85 s [vector] mut_foldr': OK (0.01s)
  13335. 669.85 s [vector] +++ OK, passed 100 tests.
  13336. 669.87 s [vector] mut_foldl: OK (0.01s)
  13337. 669.87 s [vector] +++ OK, passed 100 tests.
  13338. 669.89 s [vector] mut_foldl': OK (0.01s)
  13339. 669.89 s [vector] +++ OK, passed 100 tests.
  13340. 669.91 s [vector] mut_ifoldr: OK (0.02s)
  13341. 669.91 s [vector] +++ OK, passed 100 tests.
  13342. 669.91 s [vector] mut_ifoldr': OK (0.02s)
  13343. 669.91 s [vector] +++ OK, passed 100 tests.
  13344. 669.93 s [vector] mut_ifoldl: OK (0.01s)
  13345. 669.93 s [vector] +++ OK, passed 100 tests.
  13346. 669.95 s [vector] mut_ifoldl': OK (0.01s)
  13347. 669.95 s [vector] +++ OK, passed 100 tests.
  13348. 669.96 s [vector] mut_foldM: OK (0.01s)
  13349. 669.96 s [vector] +++ OK, passed 100 tests.
  13350. 669.97 s [vector] mut_foldM': OK (0.01s)
  13351. 669.97 s [vector] +++ OK, passed 100 tests.
  13352. 669.99 s [vector] mut_foldrM: OK (0.01s)
  13353. 669.99 s [vector] +++ OK, passed 100 tests.
  13354. 670.00 s [vector] mut_foldrM': OK (0.01s)
  13355. 670.00 s [vector] +++ OK, passed 100 tests.
  13356. 670.01 s [vector] mut_ifoldM: OK (0.01s)
  13357. 670.01 s [vector] +++ OK, passed 100 tests.
  13358. 670.03 s [vector] mut_ifoldM': OK (0.02s)
  13359. 670.03 s [vector] +++ OK, passed 100 tests.
  13360. 670.05 s [vector] mut_ifoldrM: OK (0.01s)
  13361. 670.05 s [vector] +++ OK, passed 100 tests.
  13362. 670.05 s [vector] mut_ifoldrM': OK (0.02s)
  13363. 670.05 s [vector] +++ OK, passed 100 tests.
  13364. 670.05 s [vector] compare: OK
  13365. 670.05 s [vector] +++ OK, passed 100 tests.
  13366. 670.06 s [vector] maximum: OK
  13367. 670.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13368. 670.06 s [vector] minimum: OK
  13369. 670.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13370. 670.06 s [vector] minIndex: OK
  13371. 670.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13372. 670.06 s [vector] maxIndex: OK
  13373. 670.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13374. 670.06 s [vector] maximumBy: OK
  13375. 670.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13376. 670.06 s [vector] minimumBy: OK
  13377. 670.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13378. 670.06 s [vector] maximumOn: OK
  13379. 670.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13380. 670.06 s [vector] minimumOn: OK
  13381. 670.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13382. 670.06 s [vector] maxIndexBy: OK
  13383. 670.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13384. 670.07 s [vector] minIndexBy: OK
  13385. 670.07 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13386. 670.07 s [vector] ListFirstMaxIndexWins: OK
  13387. 670.07 s [vector] +++ OK, passed 100 tests; 21 discarded.
  13388. 670.07 s [vector] FalseListFirstMaxIndexWins: OK
  13389. 670.07 s [vector] +++ OK, failed as expected. (after 1 test):
  13390. 670.07 s [vector] Exception:
  13391. 670.07 s [vector] Prelude.foldr1: empty list
  13392. 670.07 s [vector] CallStack (from HasCallStack):
  13393. 670.07 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13394. 670.07 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13395. 670.07 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13396. 670.07 s [vector] []
  13397. 670.07 s [vector] mempty: OK
  13398. 670.07 s [vector] +++ OK, passed 100 tests.
  13399. 670.07 s [vector] mappend: OK
  13400. 670.07 s [vector] +++ OK, passed 100 tests.
  13401. 670.10 s [vector] mconcat: OK (0.03s)
  13402. 670.10 s [vector] +++ OK, passed 100 tests.
  13403. 670.10 s [vector] glength: OK
  13404. 670.10 s [vector] +++ OK, passed 100 tests.
  13405. 670.10 s [vector] sum: OK
  13406. 670.10 s [vector] +++ OK, passed 100 tests.
  13407. 670.10 s [vector] product: OK
  13408. 670.10 s [vector] +++ OK, passed 100 tests.
  13409. 670.10 s [vector] enumFromN: OK
  13410. 670.10 s [vector] +++ OK, passed 100 tests.
  13411. 670.10 s [vector] enumFromThenN: OK
  13412. 670.10 s [vector] +++ OK, passed 100 tests.
  13413. 670.10 s [vector] enumFromTo: OK
  13414. 670.10 s [vector] +++ OK, passed 100 tests.
  13415. 670.10 s [vector] enumFromThenTo: OK
  13416. 670.10 s [vector] +++ OK, passed 100 tests.
  13417. 670.10 s [vector] unstream
  13418. 670.10 s [vector] unstream == vunstream (exact): OK
  13419. 670.10 s [vector] +++ OK, passed 100 tests.
  13420. 670.10 s [vector] unstream == vunstream (unknown): OK
  13421. 670.10 s [vector] +++ OK, passed 100 tests.
  13422. 670.10 s [vector] unstreamR ~= vunstream (exact): OK
  13423. 670.10 s [vector] +++ OK, passed 100 tests.
  13424. 670.10 s [vector] unstreamR ~= vunstream (unknown): OK
  13425. 670.10 s [vector] +++ OK, passed 100 tests.
  13426. 670.10 s [vector] Tests.Vector.Strict
  13427. 670.10 s [vector] Bool
  13428. 670.10 s [vector] fromList.toList == id: OK
  13429. 670.10 s [vector] +++ OK, passed 100 tests.
  13430. 670.10 s [vector] toList.fromList == id: OK
  13431. 670.10 s [vector] +++ OK, passed 100 tests.
  13432. 670.10 s [vector] unstream.stream == id: OK
  13433. 670.10 s [vector] +++ OK, passed 100 tests.
  13434. 670.10 s [vector] stream.unstream == id: OK
  13435. 670.10 s [vector] +++ OK, passed 100 tests.
  13436. 670.10 s [vector] eq: OK
  13437. 670.10 s [vector] +++ OK, passed 100 tests.
  13438. 670.10 s [vector] length: OK
  13439. 670.10 s [vector] +++ OK, passed 100 tests.
  13440. 670.10 s [vector] null: OK
  13441. 670.10 s [vector] +++ OK, passed 100 tests.
  13442. 670.10 s [vector] index: OK
  13443. 670.10 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13444. 670.10 s [vector] safeIndex: OK
  13445. 670.10 s [vector] +++ OK, passed 100 tests.
  13446. 670.10 s [vector] head: OK
  13447. 670.10 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13448. 670.10 s [vector] last: OK
  13449. 670.10 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13450. 670.10 s [vector] unsafeIndex: OK
  13451. 670.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13452. 670.10 s [vector] unsafeHead: OK
  13453. 670.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13454. 670.10 s [vector] unsafeLast: OK
  13455. 670.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13456. 670.10 s [vector] slice: OK
  13457. 670.10 s [vector] +++ OK, passed 100 tests.
  13458. 670.10 s [vector] init: OK
  13459. 670.10 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13460. 670.10 s [vector] tail: OK
  13461. 670.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13462. 670.10 s [vector] take: OK
  13463. 670.10 s [vector] +++ OK, passed 100 tests.
  13464. 670.10 s [vector] drop: OK
  13465. 670.10 s [vector] +++ OK, passed 100 tests.
  13466. 670.10 s [vector] splitAt: OK
  13467. 670.10 s [vector] +++ OK, passed 100 tests.
  13468. 670.10 s [vector] empty: OK
  13469. 670.10 s [vector] +++ OK, passed 100 tests.
  13470. 670.10 s [vector] singleton: OK
  13471. 670.10 s [vector] +++ OK, passed 100 tests.
  13472. 670.11 s [vector] replicate: OK
  13473. 670.11 s [vector] +++ OK, passed 100 tests.
  13474. 670.11 s [vector] generate: OK
  13475. 670.11 s [vector] +++ OK, passed 100 tests.
  13476. 670.11 s [vector] iterateN: OK
  13477. 670.11 s [vector] +++ OK, passed 100 tests.
  13478. 670.17 s [vector] iterateNM: OK (0.05s)
  13479. 670.17 s [vector] +++ OK, passed 100 tests.
  13480. 670.19 s [vector] generateM: OK (0.01s)
  13481. 670.19 s [vector] +++ OK, passed 100 tests.
  13482. 670.19 s [vector] replicateM: OK (0.01s)
  13483. 670.19 s [vector] +++ OK, passed 100 tests.
  13484. 670.20 s [vector] create: OK
  13485. 670.20 s [vector] +++ OK, passed 100 tests.
  13486. 670.20 s [vector] createT: OK
  13487. 670.20 s [vector] +++ OK, passed 100 tests.
  13488. 670.20 s [vector] unfoldr: OK
  13489. 670.20 s [vector] +++ OK, passed 100 tests.
  13490. 670.20 s [vector] unfoldrN: OK
  13491. 670.20 s [vector] +++ OK, passed 100 tests.
  13492. 670.21 s [vector] unfoldrExactN: OK
  13493. 670.21 s [vector] +++ OK, passed 100 tests.
  13494. 670.21 s [vector] unfoldrM: OK
  13495. 670.21 s [vector] +++ OK, passed 100 tests.
  13496. 670.22 s [vector] unfoldrNM: OK
  13497. 670.22 s [vector] +++ OK, passed 100 tests.
  13498. 670.22 s [vector] unfoldrExactNM: OK (0.01s)
  13499. 670.22 s [vector] +++ OK, passed 100 tests.
  13500. 670.23 s [vector] constructN: OK
  13501. 670.23 s [vector] +++ OK, passed 100 tests.
  13502. 670.23 s [vector] constructrN: OK
  13503. 670.23 s [vector] +++ OK, passed 100 tests.
  13504. 670.23 s [vector] cons: OK
  13505. 670.23 s [vector] +++ OK, passed 100 tests.
  13506. 670.23 s [vector] snoc: OK
  13507. 670.23 s [vector] +++ OK, passed 100 tests.
  13508. 670.23 s [vector] append: OK
  13509. 670.24 s [vector] +++ OK, passed 100 tests.
  13510. 670.24 s [vector] concat: OK
  13511. 670.24 s [vector] +++ OK, passed 100 tests.
  13512. 670.24 s [vector] force: OK
  13513. 670.24 s [vector] +++ OK, passed 100 tests.
  13514. 670.24 s [vector] upd: OK
  13515. 670.24 s [vector] +++ OK, passed 100 tests.
  13516. 670.24 s [vector] accum: OK
  13517. 670.24 s [vector] +++ OK, passed 100 tests.
  13518. 670.25 s [vector] reverse: OK
  13519. 670.25 s [vector] +++ OK, passed 100 tests.
  13520. 670.25 s [vector] backpermute: OK
  13521. 670.25 s [vector] +++ OK, passed 100 tests.
  13522. 670.25 s [vector] map: OK
  13523. 670.25 s [vector] +++ OK, passed 100 tests.
  13524. 670.25 s [vector] imap: OK
  13525. 670.25 s [vector] +++ OK, passed 100 tests.
  13526. 670.25 s [vector] concatMap: OK
  13527. 670.25 s [vector] +++ OK, passed 100 tests.
  13528. 670.25 s [vector] mapM: OK
  13529. 670.26 s [vector] +++ OK, passed 100 tests.
  13530. 670.26 s [vector] mapM_: OK
  13531. 670.26 s [vector] +++ OK, passed 100 tests.
  13532. 670.26 s [vector] forM: OK
  13533. 670.27 s [vector] +++ OK, passed 100 tests.
  13534. 670.27 s [vector] forM_: OK (0.01s)
  13535. 670.27 s [vector] +++ OK, passed 100 tests.
  13536. 670.27 s [vector] imapM: OK
  13537. 670.28 s [vector] +++ OK, passed 100 tests.
  13538. 670.29 s [vector] imapM_: OK (0.01s)
  13539. 670.29 s [vector] +++ OK, passed 100 tests.
  13540. 670.29 s [vector] zipWith: OK
  13541. 670.29 s [vector] +++ OK, passed 100 tests.
  13542. 670.29 s [vector] zipWith3: OK
  13543. 670.29 s [vector] +++ OK, passed 100 tests.
  13544. 670.29 s [vector] izipWith: OK
  13545. 670.29 s [vector] +++ OK, passed 100 tests.
  13546. 670.29 s [vector] izipWith3: OK
  13547. 670.29 s [vector] +++ OK, passed 100 tests.
  13548. 670.29 s [vector] izipWithM: OK
  13549. 670.30 s [vector] +++ OK, passed 100 tests.
  13550. 670.30 s [vector] izipWithM_: OK
  13551. 670.30 s [vector] +++ OK, passed 100 tests.
  13552. 670.30 s [vector] zipWithM: OK
  13553. 670.31 s [vector] +++ OK, passed 100 tests.
  13554. 670.31 s [vector] zipWithM_: OK
  13555. 670.31 s [vector] +++ OK, passed 100 tests.
  13556. 670.31 s [vector] filter: OK
  13557. 670.31 s [vector] +++ OK, passed 100 tests.
  13558. 670.33 s [vector] ifilter: OK
  13559. 670.33 s [vector] +++ OK, passed 100 tests.
  13560. 670.33 s [vector] filterM: OK (0.02s)
  13561. 670.33 s [vector] +++ OK, passed 100 tests.
  13562. 670.33 s [vector] uniq: OK
  13563. 670.33 s [vector] +++ OK, passed 100 tests.
  13564. 670.33 s [vector] mapMaybe: OK
  13565. 670.34 s [vector] +++ OK, passed 100 tests.
  13566. 670.34 s [vector] imapMaybe: OK
  13567. 670.34 s [vector] +++ OK, passed 100 tests.
  13568. 670.34 s [vector] takeWhile: OK
  13569. 670.34 s [vector] +++ OK, passed 100 tests.
  13570. 670.34 s [vector] dropWhile: OK
  13571. 670.34 s [vector] +++ OK, passed 100 tests.
  13572. 670.34 s [vector] partition: OK
  13573. 670.34 s [vector] +++ OK, passed 100 tests.
  13574. 670.34 s [vector] partitionWith: OK
  13575. 670.34 s [vector] +++ OK, passed 100 tests.
  13576. 670.34 s [vector] span: OK
  13577. 670.34 s [vector] +++ OK, passed 100 tests.
  13578. 670.34 s [vector] break: OK
  13579. 670.34 s [vector] +++ OK, passed 100 tests.
  13580. 670.34 s [vector] spanR: OK
  13581. 670.34 s [vector] +++ OK, passed 100 tests.
  13582. 670.34 s [vector] breakR: OK
  13583. 670.34 s [vector] +++ OK, passed 100 tests.
  13584. 670.34 s [vector] groupBy: OK
  13585. 670.34 s [vector] +++ OK, passed 100 tests.
  13586. 670.34 s [vector] elem: OK
  13587. 670.34 s [vector] +++ OK, passed 100 tests.
  13588. 670.34 s [vector] notElem: OK
  13589. 670.34 s [vector] +++ OK, passed 100 tests.
  13590. 670.34 s [vector] find: OK
  13591. 670.34 s [vector] +++ OK, passed 100 tests.
  13592. 670.34 s [vector] findIndex: OK
  13593. 670.34 s [vector] +++ OK, passed 100 tests.
  13594. 670.34 s [vector] findIndexR: OK
  13595. 670.34 s [vector] +++ OK, passed 100 tests.
  13596. 670.34 s [vector] findIndices: OK
  13597. 670.34 s [vector] +++ OK, passed 100 tests.
  13598. 670.34 s [vector] elemIndex: OK
  13599. 670.35 s [vector] +++ OK, passed 100 tests.
  13600. 670.35 s [vector] elemIndices: OK
  13601. 670.35 s [vector] +++ OK, passed 100 tests.
  13602. 670.35 s [vector] foldl: OK
  13603. 670.35 s [vector] +++ OK, passed 100 tests.
  13604. 670.35 s [vector] foldl1: OK
  13605. 670.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13606. 670.35 s [vector] foldl': OK
  13607. 670.35 s [vector] +++ OK, passed 100 tests.
  13608. 670.35 s [vector] foldl1': OK
  13609. 670.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13610. 670.35 s [vector] foldr: OK
  13611. 670.35 s [vector] +++ OK, passed 100 tests.
  13612. 670.35 s [vector] foldr1: OK
  13613. 670.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13614. 670.35 s [vector] foldr': OK
  13615. 670.35 s [vector] +++ OK, passed 100 tests.
  13616. 670.35 s [vector] foldr1': OK
  13617. 670.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13618. 670.35 s [vector] ifoldl: OK
  13619. 670.35 s [vector] +++ OK, passed 100 tests.
  13620. 670.36 s [vector] ifoldl': OK
  13621. 670.36 s [vector] +++ OK, passed 100 tests.
  13622. 670.36 s [vector] ifoldr: OK
  13623. 670.36 s [vector] +++ OK, passed 100 tests.
  13624. 670.36 s [vector] ifoldr': OK
  13625. 670.36 s [vector] +++ OK, passed 100 tests.
  13626. 670.36 s [vector] ifoldM: OK
  13627. 670.36 s [vector] +++ OK, passed 100 tests.
  13628. 670.36 s [vector] ifoldM': OK
  13629. 670.37 s [vector] +++ OK, passed 100 tests.
  13630. 670.37 s [vector] ifoldM_: OK
  13631. 670.37 s [vector] +++ OK, passed 100 tests.
  13632. 670.38 s [vector] ifoldM'_: OK
  13633. 670.38 s [vector] +++ OK, passed 100 tests.
  13634. 670.38 s [vector] all: OK
  13635. 670.38 s [vector] +++ OK, passed 100 tests.
  13636. 670.38 s [vector] any: OK
  13637. 670.38 s [vector] +++ OK, passed 100 tests.
  13638. 670.38 s [vector] prescanl: OK
  13639. 670.38 s [vector] +++ OK, passed 100 tests.
  13640. 670.38 s [vector] prescanl': OK
  13641. 670.38 s [vector] +++ OK, passed 100 tests.
  13642. 670.38 s [vector] postscanl: OK
  13643. 670.38 s [vector] +++ OK, passed 100 tests.
  13644. 670.38 s [vector] postscanl': OK
  13645. 670.38 s [vector] +++ OK, passed 100 tests.
  13646. 670.38 s [vector] scanl: OK
  13647. 670.38 s [vector] +++ OK, passed 100 tests.
  13648. 670.38 s [vector] scanl': OK
  13649. 670.38 s [vector] +++ OK, passed 100 tests.
  13650. 670.38 s [vector] scanl1: OK
  13651. 670.38 s [vector] +++ OK, passed 100 tests.
  13652. 670.39 s [vector] scanl1': OK
  13653. 670.39 s [vector] +++ OK, passed 100 tests.
  13654. 670.39 s [vector] iscanl: OK
  13655. 670.39 s [vector] +++ OK, passed 100 tests.
  13656. 670.39 s [vector] iscanl': OK
  13657. 670.39 s [vector] +++ OK, passed 100 tests.
  13658. 670.39 s [vector] prescanr: OK
  13659. 670.39 s [vector] +++ OK, passed 100 tests.
  13660. 670.39 s [vector] prescanr': OK
  13661. 670.39 s [vector] +++ OK, passed 100 tests.
  13662. 670.39 s [vector] postscanr: OK
  13663. 670.39 s [vector] +++ OK, passed 100 tests.
  13664. 670.39 s [vector] postscanr': OK
  13665. 670.39 s [vector] +++ OK, passed 100 tests.
  13666. 670.39 s [vector] scanr: OK
  13667. 670.39 s [vector] +++ OK, passed 100 tests.
  13668. 670.40 s [vector] scanr': OK
  13669. 670.40 s [vector] +++ OK, passed 100 tests.
  13670. 670.40 s [vector] scanr1: OK
  13671. 670.40 s [vector] +++ OK, passed 100 tests.
  13672. 670.40 s [vector] scanr1': OK
  13673. 670.40 s [vector] +++ OK, passed 100 tests.
  13674. 670.40 s [vector] iscanr: OK
  13675. 670.40 s [vector] +++ OK, passed 100 tests.
  13676. 670.40 s [vector] iscanr': OK
  13677. 670.40 s [vector] +++ OK, passed 100 tests.
  13678. 670.40 s [vector] mut_read: OK
  13679. 670.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13680. 670.40 s [vector] mut_write: OK
  13681. 670.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13682. 670.40 s [vector] mut_modify: OK
  13683. 670.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13684. 670.40 s [vector] mut_generate: OK
  13685. 670.41 s [vector] +++ OK, passed 100 tests.
  13686. 670.41 s [vector] mut_generateM: OK
  13687. 670.41 s [vector] +++ OK, passed 100 tests.
  13688. 670.42 s [vector] mut_mapM_: OK
  13689. 670.42 s [vector] +++ OK, passed 100 tests.
  13690. 670.42 s [vector] mut_imapM_: OK
  13691. 670.42 s [vector] +++ OK, passed 100 tests.
  13692. 670.43 s [vector] mut_forM_: OK
  13693. 670.44 s [vector] +++ OK, passed 100 tests.
  13694. 670.44 s [vector] mut_iforM_: OK (0.01s)
  13695. 670.44 s [vector] +++ OK, passed 100 tests.
  13696. 670.44 s [vector] mut_foldr: OK
  13697. 670.44 s [vector] +++ OK, passed 100 tests.
  13698. 670.44 s [vector] mut_foldr': OK
  13699. 670.44 s [vector] +++ OK, passed 100 tests.
  13700. 670.44 s [vector] mut_foldl: OK
  13701. 670.44 s [vector] +++ OK, passed 100 tests.
  13702. 670.45 s [vector] mut_foldl': OK
  13703. 670.45 s [vector] +++ OK, passed 100 tests.
  13704. 670.45 s [vector] mut_ifoldr: OK
  13705. 670.45 s [vector] +++ OK, passed 100 tests.
  13706. 670.45 s [vector] mut_ifoldr': OK
  13707. 670.45 s [vector] +++ OK, passed 100 tests.
  13708. 670.45 s [vector] mut_ifoldl: OK
  13709. 670.46 s [vector] +++ OK, passed 100 tests.
  13710. 670.46 s [vector] mut_ifoldl': OK
  13711. 670.46 s [vector] +++ OK, passed 100 tests.
  13712. 670.46 s [vector] mut_foldM: OK
  13713. 670.46 s [vector] +++ OK, passed 100 tests.
  13714. 670.46 s [vector] mut_foldM': OK
  13715. 670.46 s [vector] +++ OK, passed 100 tests.
  13716. 670.46 s [vector] mut_foldrM: OK
  13717. 670.46 s [vector] +++ OK, passed 100 tests.
  13718. 670.46 s [vector] mut_foldrM': OK
  13719. 670.46 s [vector] +++ OK, passed 100 tests.
  13720. 670.46 s [vector] mut_ifoldM: OK
  13721. 670.46 s [vector] +++ OK, passed 100 tests.
  13722. 670.46 s [vector] mut_ifoldM': OK
  13723. 670.46 s [vector] +++ OK, passed 100 tests.
  13724. 670.46 s [vector] mut_ifoldrM: OK
  13725. 670.46 s [vector] +++ OK, passed 100 tests.
  13726. 670.46 s [vector] mut_ifoldrM': OK
  13727. 670.46 s [vector] +++ OK, passed 100 tests.
  13728. 670.46 s [vector] compare: OK
  13729. 670.46 s [vector] +++ OK, passed 100 tests.
  13730. 670.46 s [vector] maximum: OK
  13731. 670.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13732. 670.46 s [vector] minimum: OK
  13733. 670.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13734. 670.46 s [vector] minIndex: OK
  13735. 670.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13736. 670.46 s [vector] maxIndex: OK
  13737. 670.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13738. 670.47 s [vector] maximumBy: OK
  13739. 670.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13740. 670.47 s [vector] minimumBy: OK
  13741. 670.47 s [vector] +++ OK, passed 100 tests; 25 discarded.
  13742. 670.47 s [vector] maximumOn: OK
  13743. 670.47 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13744. 670.47 s [vector] minimumOn: OK
  13745. 670.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13746. 670.47 s [vector] maxIndexBy: OK
  13747. 670.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13748. 670.47 s [vector] minIndexBy: OK
  13749. 670.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13750. 670.47 s [vector] ListFirstMaxIndexWins: OK
  13751. 670.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13752. 670.47 s [vector] FalseListFirstMaxIndexWins: OK
  13753. 670.47 s [vector] +++ OK, failed as expected. (after 1 test):
  13754. 670.47 s [vector] Exception:
  13755. 670.47 s [vector] Prelude.foldr1: empty list
  13756. 670.47 s [vector] CallStack (from HasCallStack):
  13757. 670.47 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  13758. 670.47 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  13759. 670.47 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13760. 670.47 s [vector] []
  13761. 670.47 s [vector] zip: OK
  13762. 670.47 s [vector] +++ OK, passed 100 tests.
  13763. 670.47 s [vector] zip3: OK
  13764. 670.47 s [vector] +++ OK, passed 100 tests.
  13765. 670.47 s [vector] unzip: OK
  13766. 670.47 s [vector] +++ OK, passed 100 tests.
  13767. 670.47 s [vector] unzip3: OK
  13768. 670.47 s [vector] +++ OK, passed 100 tests.
  13769. 670.47 s [vector] indexed: OK
  13770. 670.48 s [vector] +++ OK, passed 100 tests.
  13771. 670.48 s [vector] update: OK
  13772. 670.48 s [vector] +++ OK, passed 100 tests.
  13773. 670.48 s [vector] concat: OK
  13774. 670.48 s [vector] +++ OK, passed 100 tests.
  13775. 670.48 s [vector] mempty: OK
  13776. 670.49 s [vector] +++ OK, passed 100 tests.
  13777. 670.49 s [vector] mappend: OK
  13778. 670.49 s [vector] +++ OK, passed 100 tests.
  13779. 670.49 s [vector] mconcat: OK
  13780. 670.49 s [vector] +++ OK, passed 100 tests.
  13781. 670.49 s [vector] fmap: OK
  13782. 670.49 s [vector] +++ OK, passed 100 tests.
  13783. 670.50 s [vector] return: OK
  13784. 670.50 s [vector] +++ OK, passed 100 tests.
  13785. 670.50 s [vector] bind: OK
  13786. 670.50 s [vector] +++ OK, passed 100 tests.
  13787. 670.50 s [vector] mzip: OK
  13788. 670.50 s [vector] +++ OK, passed 100 tests.
  13789. 670.50 s [vector] munzip: OK
  13790. 670.50 s [vector] +++ OK, passed 100 tests.
  13791. 670.50 s [vector] applicative_pure: OK
  13792. 670.51 s [vector] +++ OK, passed 100 tests.
  13793. 670.51 s [vector] applicative_appl: OK (0.01s)
  13794. 670.51 s [vector] +++ OK, passed 100 tests.
  13795. 670.51 s [vector] alternative_empty: OK
  13796. 670.51 s [vector] +++ OK, passed 100 tests.
  13797. 670.51 s [vector] alternative_or: OK
  13798. 670.51 s [vector] +++ OK, passed 100 tests.
  13799. 670.56 s [vector] sequence: OK (0.04s)
  13800. 670.56 s [vector] +++ OK, passed 100 tests.
  13801. 670.56 s [vector] sequence_: OK (0.01s)
  13802. 670.56 s [vector] +++ OK, passed 100 tests.
  13803. 670.56 s [vector] glength: OK
  13804. 670.56 s [vector] +++ OK, passed 100 tests.
  13805. 670.56 s [vector] and: OK
  13806. 670.56 s [vector] +++ OK, passed 100 tests.
  13807. 670.56 s [vector] or: OK
  13808. 670.56 s [vector] +++ OK, passed 100 tests.
  13809. 670.56 s [vector] Int
  13810. 670.56 s [vector] fromList.toList == id: OK
  13811. 670.56 s [vector] +++ OK, passed 100 tests.
  13812. 670.56 s [vector] toList.fromList == id: OK
  13813. 670.57 s [vector] +++ OK, passed 100 tests.
  13814. 670.57 s [vector] unstream.stream == id: OK
  13815. 670.57 s [vector] +++ OK, passed 100 tests.
  13816. 670.57 s [vector] stream.unstream == id: OK
  13817. 670.57 s [vector] +++ OK, passed 100 tests.
  13818. 670.57 s [vector] eq: OK
  13819. 670.57 s [vector] +++ OK, passed 100 tests.
  13820. 670.57 s [vector] length: OK
  13821. 670.57 s [vector] +++ OK, passed 100 tests.
  13822. 670.57 s [vector] null: OK
  13823. 670.57 s [vector] +++ OK, passed 100 tests.
  13824. 670.57 s [vector] index: OK
  13825. 670.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13826. 670.57 s [vector] safeIndex: OK
  13827. 670.57 s [vector] +++ OK, passed 100 tests.
  13828. 670.57 s [vector] head: OK
  13829. 670.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13830. 670.57 s [vector] last: OK
  13831. 670.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13832. 670.57 s [vector] unsafeIndex: OK
  13833. 670.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13834. 670.57 s [vector] unsafeHead: OK
  13835. 670.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13836. 670.57 s [vector] unsafeLast: OK
  13837. 670.57 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13838. 670.57 s [vector] slice: OK
  13839. 670.57 s [vector] +++ OK, passed 100 tests.
  13840. 670.57 s [vector] init: OK
  13841. 670.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13842. 670.57 s [vector] tail: OK
  13843. 670.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13844. 670.57 s [vector] take: OK
  13845. 670.57 s [vector] +++ OK, passed 100 tests.
  13846. 670.57 s [vector] drop: OK
  13847. 670.57 s [vector] +++ OK, passed 100 tests.
  13848. 670.57 s [vector] splitAt: OK
  13849. 670.57 s [vector] +++ OK, passed 100 tests.
  13850. 670.57 s [vector] empty: OK
  13851. 670.57 s [vector] +++ OK, passed 100 tests.
  13852. 670.57 s [vector] singleton: OK
  13853. 670.57 s [vector] +++ OK, passed 100 tests.
  13854. 670.57 s [vector] replicate: OK
  13855. 670.57 s [vector] +++ OK, passed 100 tests.
  13856. 670.57 s [vector] generate: OK
  13857. 670.57 s [vector] +++ OK, passed 100 tests.
  13858. 670.58 s [vector] iterateN: OK
  13859. 670.58 s [vector] +++ OK, passed 100 tests.
  13860. 670.60 s [vector] iterateNM: OK (0.02s)
  13861. 670.60 s [vector] +++ OK, passed 100 tests.
  13862. 670.64 s [vector] generateM: OK (0.04s)
  13863. 670.64 s [vector] +++ OK, passed 100 tests.
  13864. 670.66 s [vector] replicateM: OK (0.03s)
  13865. 670.66 s [vector] +++ OK, passed 100 tests.
  13866. 670.66 s [vector] create: OK
  13867. 670.66 s [vector] +++ OK, passed 100 tests.
  13868. 670.66 s [vector] createT: OK
  13869. 670.66 s [vector] +++ OK, passed 100 tests.
  13870. 670.66 s [vector] unfoldr: OK
  13871. 670.66 s [vector] +++ OK, passed 100 tests.
  13872. 670.66 s [vector] unfoldrN: OK
  13873. 670.66 s [vector] +++ OK, passed 100 tests.
  13874. 670.66 s [vector] unfoldrExactN: OK
  13875. 670.66 s [vector] +++ OK, passed 100 tests.
  13876. 670.66 s [vector] unfoldrM: OK
  13877. 670.66 s [vector] +++ OK, passed 100 tests.
  13878. 670.66 s [vector] unfoldrNM: OK
  13879. 670.68 s [vector] +++ OK, passed 100 tests.
  13880. 670.69 s [vector] unfoldrExactNM: OK (0.02s)
  13881. 670.69 s [vector] +++ OK, passed 100 tests.
  13882. 670.69 s [vector] constructN: OK
  13883. 670.69 s [vector] +++ OK, passed 100 tests.
  13884. 670.69 s [vector] constructrN: OK
  13885. 670.69 s [vector] +++ OK, passed 100 tests.
  13886. 670.69 s [vector] cons: OK
  13887. 670.69 s [vector] +++ OK, passed 100 tests.
  13888. 670.69 s [vector] snoc: OK
  13889. 670.69 s [vector] +++ OK, passed 100 tests.
  13890. 670.69 s [vector] append: OK
  13891. 670.70 s [vector] +++ OK, passed 100 tests.
  13892. 670.70 s [vector] concat: OK
  13893. 670.70 s [vector] +++ OK, passed 100 tests.
  13894. 670.70 s [vector] force: OK
  13895. 670.70 s [vector] +++ OK, passed 100 tests.
  13896. 670.70 s [vector] upd: OK
  13897. 670.70 s [vector] +++ OK, passed 100 tests.
  13898. 670.71 s [vector] accum: OK
  13899. 670.71 s [vector] +++ OK, passed 100 tests.
  13900. 670.71 s [vector] reverse: OK
  13901. 670.71 s [vector] +++ OK, passed 100 tests.
  13902. 670.71 s [vector] backpermute: OK
  13903. 670.71 s [vector] +++ OK, passed 100 tests.
  13904. 670.71 s [vector] map: OK
  13905. 670.71 s [vector] +++ OK, passed 100 tests.
  13906. 670.71 s [vector] imap: OK
  13907. 670.71 s [vector] +++ OK, passed 100 tests.
  13908. 670.71 s [vector] concatMap: OK
  13909. 670.71 s [vector] +++ OK, passed 100 tests.
  13910. 670.72 s [vector] mapM: OK
  13911. 670.72 s [vector] +++ OK, passed 100 tests.
  13912. 670.73 s [vector] mapM_: OK (0.01s)
  13913. 670.73 s [vector] +++ OK, passed 100 tests.
  13914. 670.73 s [vector] forM: OK
  13915. 670.74 s [vector] +++ OK, passed 100 tests.
  13916. 670.75 s [vector] forM_: OK (0.02s)
  13917. 670.75 s [vector] +++ OK, passed 100 tests.
  13918. 670.76 s [vector] imapM: OK
  13919. 670.76 s [vector] +++ OK, passed 100 tests.
  13920. 670.76 s [vector] imapM_: OK (0.01s)
  13921. 670.76 s [vector] +++ OK, passed 100 tests.
  13922. 670.77 s [vector] zipWith: OK
  13923. 670.77 s [vector] +++ OK, passed 100 tests.
  13924. 670.77 s [vector] zipWith3: OK
  13925. 670.77 s [vector] +++ OK, passed 100 tests.
  13926. 670.77 s [vector] izipWith: OK
  13927. 670.77 s [vector] +++ OK, passed 100 tests.
  13928. 670.77 s [vector] izipWith3: OK
  13929. 670.77 s [vector] +++ OK, passed 100 tests.
  13930. 670.78 s [vector] izipWithM: OK
  13931. 670.78 s [vector] +++ OK, passed 100 tests.
  13932. 670.79 s [vector] izipWithM_: OK (0.01s)
  13933. 670.79 s [vector] +++ OK, passed 100 tests.
  13934. 670.79 s [vector] zipWithM: OK
  13935. 670.79 s [vector] +++ OK, passed 100 tests.
  13936. 670.80 s [vector] zipWithM_: OK (0.01s)
  13937. 670.80 s [vector] +++ OK, passed 100 tests.
  13938. 670.80 s [vector] filter: OK
  13939. 670.80 s [vector] +++ OK, passed 100 tests.
  13940. 670.80 s [vector] ifilter: OK
  13941. 670.82 s [vector] +++ OK, passed 100 tests.
  13942. 670.84 s [vector] filterM: OK (0.03s)
  13943. 670.84 s [vector] +++ OK, passed 100 tests.
  13944. 670.84 s [vector] uniq: OK
  13945. 670.84 s [vector] +++ OK, passed 100 tests.
  13946. 670.84 s [vector] mapMaybe: OK
  13947. 670.84 s [vector] +++ OK, passed 100 tests.
  13948. 670.84 s [vector] imapMaybe: OK
  13949. 670.84 s [vector] +++ OK, passed 100 tests.
  13950. 670.84 s [vector] takeWhile: OK
  13951. 670.84 s [vector] +++ OK, passed 100 tests.
  13952. 670.84 s [vector] dropWhile: OK
  13953. 670.84 s [vector] +++ OK, passed 100 tests.
  13954. 670.84 s [vector] partition: OK
  13955. 670.84 s [vector] +++ OK, passed 100 tests.
  13956. 670.84 s [vector] partitionWith: OK
  13957. 670.84 s [vector] +++ OK, passed 100 tests.
  13958. 670.84 s [vector] span: OK
  13959. 670.85 s [vector] +++ OK, passed 100 tests.
  13960. 670.85 s [vector] break: OK
  13961. 670.85 s [vector] +++ OK, passed 100 tests.
  13962. 670.85 s [vector] spanR: OK
  13963. 670.85 s [vector] +++ OK, passed 100 tests.
  13964. 670.85 s [vector] breakR: OK
  13965. 670.85 s [vector] +++ OK, passed 100 tests.
  13966. 670.85 s [vector] groupBy: OK
  13967. 670.85 s [vector] +++ OK, passed 100 tests.
  13968. 670.85 s [vector] elem: OK
  13969. 670.85 s [vector] +++ OK, passed 100 tests.
  13970. 670.85 s [vector] notElem: OK
  13971. 670.85 s [vector] +++ OK, passed 100 tests.
  13972. 670.85 s [vector] find: OK
  13973. 670.85 s [vector] +++ OK, passed 100 tests.
  13974. 670.85 s [vector] findIndex: OK
  13975. 670.85 s [vector] +++ OK, passed 100 tests.
  13976. 670.85 s [vector] findIndexR: OK
  13977. 670.85 s [vector] +++ OK, passed 100 tests.
  13978. 670.85 s [vector] findIndices: OK
  13979. 670.85 s [vector] +++ OK, passed 100 tests.
  13980. 670.85 s [vector] elemIndex: OK
  13981. 670.85 s [vector] +++ OK, passed 100 tests.
  13982. 670.86 s [vector] elemIndices: OK
  13983. 670.86 s [vector] +++ OK, passed 100 tests.
  13984. 670.86 s [vector] foldl: OK
  13985. 670.86 s [vector] +++ OK, passed 100 tests.
  13986. 670.86 s [vector] foldl1: OK
  13987. 670.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13988. 670.86 s [vector] foldl': OK
  13989. 670.86 s [vector] +++ OK, passed 100 tests.
  13990. 670.86 s [vector] foldl1': OK
  13991. 670.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13992. 670.87 s [vector] foldr: OK
  13993. 670.87 s [vector] +++ OK, passed 100 tests.
  13994. 670.87 s [vector] foldr1: OK
  13995. 670.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13996. 670.87 s [vector] foldr': OK
  13997. 670.87 s [vector] +++ OK, passed 100 tests.
  13998. 670.87 s [vector] foldr1': OK
  13999. 670.87 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14000. 670.87 s [vector] ifoldl: OK
  14001. 670.88 s [vector] +++ OK, passed 100 tests.
  14002. 670.88 s [vector] ifoldl': OK
  14003. 670.88 s [vector] +++ OK, passed 100 tests.
  14004. 670.88 s [vector] ifoldr: OK
  14005. 670.88 s [vector] +++ OK, passed 100 tests.
  14006. 670.88 s [vector] ifoldr': OK
  14007. 670.88 s [vector] +++ OK, passed 100 tests.
  14008. 670.88 s [vector] ifoldM: OK
  14009. 670.89 s [vector] +++ OK, passed 100 tests.
  14010. 670.89 s [vector] ifoldM': OK
  14011. 670.90 s [vector] +++ OK, passed 100 tests.
  14012. 670.92 s [vector] ifoldM_: OK (0.02s)
  14013. 670.92 s [vector] +++ OK, passed 100 tests.
  14014. 670.92 s [vector] ifoldM'_: OK (0.02s)
  14015. 670.92 s [vector] +++ OK, passed 100 tests.
  14016. 670.92 s [vector] all: OK
  14017. 670.92 s [vector] +++ OK, passed 100 tests.
  14018. 670.92 s [vector] any: OK
  14019. 670.92 s [vector] +++ OK, passed 100 tests.
  14020. 670.93 s [vector] prescanl: OK
  14021. 670.93 s [vector] +++ OK, passed 100 tests.
  14022. 670.93 s [vector] prescanl': OK
  14023. 670.93 s [vector] +++ OK, passed 100 tests.
  14024. 670.93 s [vector] postscanl: OK
  14025. 670.93 s [vector] +++ OK, passed 100 tests.
  14026. 670.93 s [vector] postscanl': OK
  14027. 670.93 s [vector] +++ OK, passed 100 tests.
  14028. 670.94 s [vector] scanl: OK
  14029. 670.94 s [vector] +++ OK, passed 100 tests.
  14030. 670.94 s [vector] scanl': OK
  14031. 670.94 s [vector] +++ OK, passed 100 tests.
  14032. 670.94 s [vector] scanl1: OK
  14033. 670.94 s [vector] +++ OK, passed 100 tests.
  14034. 670.94 s [vector] scanl1': OK
  14035. 670.94 s [vector] +++ OK, passed 100 tests.
  14036. 670.94 s [vector] iscanl: OK
  14037. 670.94 s [vector] +++ OK, passed 100 tests.
  14038. 670.95 s [vector] iscanl': OK
  14039. 670.95 s [vector] +++ OK, passed 100 tests.
  14040. 670.95 s [vector] prescanr: OK
  14041. 670.95 s [vector] +++ OK, passed 100 tests.
  14042. 670.95 s [vector] prescanr': OK
  14043. 670.95 s [vector] +++ OK, passed 100 tests.
  14044. 670.96 s [vector] postscanr: OK
  14045. 670.96 s [vector] +++ OK, passed 100 tests.
  14046. 670.96 s [vector] postscanr': OK
  14047. 670.96 s [vector] +++ OK, passed 100 tests.
  14048. 670.96 s [vector] scanr: OK
  14049. 670.96 s [vector] +++ OK, passed 100 tests.
  14050. 670.96 s [vector] scanr': OK
  14051. 670.97 s [vector] +++ OK, passed 100 tests.
  14052. 670.97 s [vector] scanr1: OK
  14053. 670.97 s [vector] +++ OK, passed 100 tests.
  14054. 670.97 s [vector] scanr1': OK
  14055. 670.97 s [vector] +++ OK, passed 100 tests.
  14056. 670.98 s [vector] iscanr: OK
  14057. 670.98 s [vector] +++ OK, passed 100 tests.
  14058. 670.98 s [vector] iscanr': OK
  14059. 670.98 s [vector] +++ OK, passed 100 tests.
  14060. 670.98 s [vector] mut_read: OK
  14061. 670.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14062. 670.98 s [vector] mut_write: OK
  14063. 670.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14064. 670.98 s [vector] mut_modify: OK
  14065. 670.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14066. 670.99 s [vector] mut_generate: OK
  14067. 670.99 s [vector] +++ OK, passed 100 tests.
  14068. 671.00 s [vector] mut_generateM: OK
  14069. 671.00 s [vector] +++ OK, passed 100 tests.
  14070. 671.01 s [vector] mut_mapM_: OK (0.01s)
  14071. 671.01 s [vector] +++ OK, passed 100 tests.
  14072. 671.02 s [vector] mut_imapM_: OK (0.01s)
  14073. 671.02 s [vector] +++ OK, passed 100 tests.
  14074. 671.04 s [vector] mut_forM_: OK (0.01s)
  14075. 671.04 s [vector] +++ OK, passed 100 tests.
  14076. 671.04 s [vector] mut_iforM_: OK (0.02s)
  14077. 671.04 s [vector] +++ OK, passed 100 tests.
  14078. 671.05 s [vector] mut_foldr: OK
  14079. 671.05 s [vector] +++ OK, passed 100 tests.
  14080. 671.05 s [vector] mut_foldr': OK
  14081. 671.05 s [vector] +++ OK, passed 100 tests.
  14082. 671.05 s [vector] mut_foldl: OK
  14083. 671.05 s [vector] +++ OK, passed 100 tests.
  14084. 671.05 s [vector] mut_foldl': OK
  14085. 671.05 s [vector] +++ OK, passed 100 tests.
  14086. 671.06 s [vector] mut_ifoldr: OK
  14087. 671.06 s [vector] +++ OK, passed 100 tests.
  14088. 671.06 s [vector] mut_ifoldr': OK
  14089. 671.06 s [vector] +++ OK, passed 100 tests.
  14090. 671.06 s [vector] mut_ifoldl: OK
  14091. 671.06 s [vector] +++ OK, passed 100 tests.
  14092. 671.06 s [vector] mut_ifoldl': OK
  14093. 671.06 s [vector] +++ OK, passed 100 tests.
  14094. 671.06 s [vector] mut_foldM: OK
  14095. 671.06 s [vector] +++ OK, passed 100 tests.
  14096. 671.07 s [vector] mut_foldM': OK
  14097. 671.07 s [vector] +++ OK, passed 100 tests.
  14098. 671.07 s [vector] mut_foldrM: OK
  14099. 671.07 s [vector] +++ OK, passed 100 tests.
  14100. 671.07 s [vector] mut_foldrM': OK
  14101. 671.07 s [vector] +++ OK, passed 100 tests.
  14102. 671.07 s [vector] mut_ifoldM: OK
  14103. 671.07 s [vector] +++ OK, passed 100 tests.
  14104. 671.08 s [vector] mut_ifoldM': OK
  14105. 671.08 s [vector] +++ OK, passed 100 tests.
  14106. 671.08 s [vector] mut_ifoldrM: OK
  14107. 671.08 s [vector] +++ OK, passed 100 tests.
  14108. 671.08 s [vector] mut_ifoldrM': OK
  14109. 671.08 s [vector] +++ OK, passed 100 tests.
  14110. 671.08 s [vector] compare: OK
  14111. 671.08 s [vector] +++ OK, passed 100 tests.
  14112. 671.08 s [vector] maximum: OK
  14113. 671.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14114. 671.08 s [vector] minimum: OK
  14115. 671.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14116. 671.08 s [vector] minIndex: OK
  14117. 671.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14118. 671.08 s [vector] maxIndex: OK
  14119. 671.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14120. 671.08 s [vector] maximumBy: OK
  14121. 671.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14122. 671.08 s [vector] minimumBy: OK
  14123. 671.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14124. 671.08 s [vector] maximumOn: OK
  14125. 671.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14126. 671.08 s [vector] minimumOn: OK
  14127. 671.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14128. 671.09 s [vector] maxIndexBy: OK
  14129. 671.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14130. 671.09 s [vector] minIndexBy: OK
  14131. 671.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14132. 671.09 s [vector] ListFirstMaxIndexWins: OK
  14133. 671.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14134. 671.09 s [vector] FalseListFirstMaxIndexWins: OK
  14135. 671.09 s [vector] +++ OK, failed as expected. (after 1 test):
  14136. 671.09 s [vector] Exception:
  14137. 671.09 s [vector] Prelude.foldr1: empty list
  14138. 671.09 s [vector] CallStack (from HasCallStack):
  14139. 671.09 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14140. 671.09 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14141. 671.09 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14142. 671.09 s [vector] []
  14143. 671.09 s [vector] zip: OK
  14144. 671.09 s [vector] +++ OK, passed 100 tests.
  14145. 671.09 s [vector] zip3: OK
  14146. 671.09 s [vector] +++ OK, passed 100 tests.
  14147. 671.09 s [vector] unzip: OK
  14148. 671.09 s [vector] +++ OK, passed 100 tests.
  14149. 671.09 s [vector] unzip3: OK
  14150. 671.09 s [vector] +++ OK, passed 100 tests.
  14151. 671.09 s [vector] indexed: OK
  14152. 671.09 s [vector] +++ OK, passed 100 tests.
  14153. 671.10 s [vector] update: OK
  14154. 671.10 s [vector] +++ OK, passed 100 tests.
  14155. 671.10 s [vector] concat: OK
  14156. 671.10 s [vector] +++ OK, passed 100 tests.
  14157. 671.10 s [vector] mempty: OK
  14158. 671.10 s [vector] +++ OK, passed 100 tests.
  14159. 671.11 s [vector] mappend: OK
  14160. 671.11 s [vector] +++ OK, passed 100 tests.
  14161. 671.11 s [vector] mconcat: OK
  14162. 671.11 s [vector] +++ OK, passed 100 tests.
  14163. 671.11 s [vector] fmap: OK
  14164. 671.11 s [vector] +++ OK, passed 100 tests.
  14165. 671.11 s [vector] return: OK
  14166. 671.12 s [vector] +++ OK, passed 100 tests.
  14167. 671.13 s [vector] bind: OK (0.02s)
  14168. 671.13 s [vector] +++ OK, passed 100 tests.
  14169. 671.13 s [vector] mzip: OK
  14170. 671.13 s [vector] +++ OK, passed 100 tests.
  14171. 671.13 s [vector] munzip: OK
  14172. 671.13 s [vector] +++ OK, passed 100 tests.
  14173. 671.14 s [vector] applicative_pure: OK
  14174. 671.14 s [vector] +++ OK, passed 100 tests.
  14175. 671.17 s [vector] applicative_appl: OK (0.03s)
  14176. 671.17 s [vector] +++ OK, passed 100 tests.
  14177. 671.17 s [vector] alternative_empty: OK
  14178. 671.17 s [vector] +++ OK, passed 100 tests.
  14179. 671.17 s [vector] alternative_or: OK
  14180. 671.18 s [vector] +++ OK, passed 100 tests.
  14181. 671.21 s [vector] sequence: OK (0.03s)
  14182. 671.21 s [vector] +++ OK, passed 100 tests.
  14183. 671.21 s [vector] sequence_: OK
  14184. 671.21 s [vector] +++ OK, passed 100 tests.
  14185. 671.21 s [vector] glength: OK
  14186. 671.21 s [vector] +++ OK, passed 100 tests.
  14187. 671.21 s [vector] sum: OK
  14188. 671.21 s [vector] +++ OK, passed 100 tests.
  14189. 671.21 s [vector] product: OK
  14190. 671.21 s [vector] +++ OK, passed 100 tests.
  14191. 671.21 s [vector] enumFromN: OK
  14192. 671.21 s [vector] +++ OK, passed 100 tests.
  14193. 671.21 s [vector] enumFromThenN: OK
  14194. 671.21 s [vector] +++ OK, passed 100 tests.
  14195. 671.21 s [vector] enumFromTo: OK
  14196. 671.21 s [vector] +++ OK, passed 100 tests.
  14197. 671.21 s [vector] enumFromThenTo: OK
  14198. 671.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14199. 671.21 s [vector] unstream
  14200. 671.21 s [vector] unstream == vunstream (exact): OK
  14201. 671.21 s [vector] +++ OK, passed 100 tests.
  14202. 671.21 s [vector] unstream == vunstream (unknown): OK
  14203. 671.21 s [vector] +++ OK, passed 100 tests.
  14204. 671.21 s [vector] unstreamR ~= vunstream (exact): OK
  14205. 671.21 s [vector] +++ OK, passed 100 tests.
  14206. 671.21 s [vector] unstreamR ~= vunstream (unknown): OK
  14207. 671.21 s [vector] +++ OK, passed 100 tests.
  14208. 671.21 s [vector] Tests.Vector.Unboxed
  14209. 671.21 s [vector] ()
  14210. 671.21 s [vector] fromList.toList == id: OK
  14211. 671.21 s [vector] +++ OK, passed 100 tests.
  14212. 671.22 s [vector] toList.fromList == id: OK
  14213. 671.22 s [vector] +++ OK, passed 100 tests.
  14214. 671.22 s [vector] unstream.stream == id: OK
  14215. 671.22 s [vector] +++ OK, passed 100 tests.
  14216. 671.22 s [vector] stream.unstream == id: OK
  14217. 671.22 s [vector] +++ OK, passed 100 tests.
  14218. 671.22 s [vector] eq: OK
  14219. 671.22 s [vector] +++ OK, passed 100 tests.
  14220. 671.22 s [vector] length: OK
  14221. 671.22 s [vector] +++ OK, passed 100 tests.
  14222. 671.22 s [vector] null: OK
  14223. 671.22 s [vector] +++ OK, passed 100 tests.
  14224. 671.22 s [vector] index: OK
  14225. 671.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14226. 671.22 s [vector] safeIndex: OK
  14227. 671.22 s [vector] +++ OK, passed 100 tests.
  14228. 671.22 s [vector] head: OK
  14229. 671.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14230. 671.22 s [vector] last: OK
  14231. 671.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  14232. 671.22 s [vector] unsafeIndex: OK
  14233. 671.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14234. 671.22 s [vector] unsafeHead: OK
  14235. 671.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14236. 671.22 s [vector] unsafeLast: OK
  14237. 671.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14238. 671.22 s [vector] slice: OK
  14239. 671.22 s [vector] +++ OK, passed 100 tests.
  14240. 671.22 s [vector] init: OK
  14241. 671.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14242. 671.22 s [vector] tail: OK
  14243. 671.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14244. 671.22 s [vector] take: OK
  14245. 671.22 s [vector] +++ OK, passed 100 tests.
  14246. 671.22 s [vector] drop: OK
  14247. 671.22 s [vector] +++ OK, passed 100 tests.
  14248. 671.22 s [vector] splitAt: OK
  14249. 671.22 s [vector] +++ OK, passed 100 tests.
  14250. 671.22 s [vector] empty: OK
  14251. 671.22 s [vector] +++ OK, passed 100 tests.
  14252. 671.22 s [vector] singleton: OK
  14253. 671.22 s [vector] +++ OK, passed 100 tests.
  14254. 671.22 s [vector] replicate: OK
  14255. 671.22 s [vector] +++ OK, passed 100 tests.
  14256. 671.22 s [vector] generate: OK
  14257. 671.22 s [vector] +++ OK, passed 100 tests.
  14258. 671.24 s [vector] iterateN: OK
  14259. 671.25 s [vector] +++ OK, passed 100 tests.
  14260. 671.26 s [vector] iterateNM: OK (0.03s)
  14261. 671.26 s [vector] +++ OK, passed 100 tests.
  14262. 671.28 s [vector] generateM: OK (0.01s)
  14263. 671.28 s [vector] +++ OK, passed 100 tests.
  14264. 671.29 s [vector] replicateM: OK (0.02s)
  14265. 671.29 s [vector] +++ OK, passed 100 tests.
  14266. 671.29 s [vector] create: OK
  14267. 671.29 s [vector] +++ OK, passed 100 tests.
  14268. 671.29 s [vector] createT: OK
  14269. 671.29 s [vector] +++ OK, passed 100 tests.
  14270. 671.29 s [vector] unfoldr: OK
  14271. 671.29 s [vector] +++ OK, passed 100 tests.
  14272. 671.29 s [vector] unfoldrN: OK
  14273. 671.29 s [vector] +++ OK, passed 100 tests.
  14274. 671.29 s [vector] unfoldrExactN: OK
  14275. 671.29 s [vector] +++ OK, passed 100 tests.
  14276. 671.29 s [vector] unfoldrM: OK
  14277. 671.29 s [vector] +++ OK, passed 100 tests.
  14278. 671.30 s [vector] unfoldrNM: OK
  14279. 671.30 s [vector] +++ OK, passed 100 tests.
  14280. 671.31 s [vector] unfoldrExactNM: OK (0.02s)
  14281. 671.31 s [vector] +++ OK, passed 100 tests.
  14282. 671.31 s [vector] constructN: OK
  14283. 671.31 s [vector] +++ OK, passed 100 tests.
  14284. 671.31 s [vector] constructrN: OK
  14285. 671.31 s [vector] +++ OK, passed 100 tests.
  14286. 671.31 s [vector] cons: OK
  14287. 671.31 s [vector] +++ OK, passed 100 tests.
  14288. 671.31 s [vector] snoc: OK
  14289. 671.32 s [vector] +++ OK, passed 100 tests.
  14290. 671.32 s [vector] append: OK
  14291. 671.32 s [vector] +++ OK, passed 100 tests.
  14292. 671.32 s [vector] concat: OK
  14293. 671.32 s [vector] +++ OK, passed 100 tests.
  14294. 671.33 s [vector] force: OK
  14295. 671.33 s [vector] +++ OK, passed 100 tests.
  14296. 671.33 s [vector] upd: OK
  14297. 671.33 s [vector] +++ OK, passed 100 tests.
  14298. 671.33 s [vector] accum: OK
  14299. 671.33 s [vector] +++ OK, passed 100 tests.
  14300. 671.33 s [vector] reverse: OK
  14301. 671.33 s [vector] +++ OK, passed 100 tests.
  14302. 671.33 s [vector] backpermute: OK
  14303. 671.33 s [vector] +++ OK, passed 100 tests.
  14304. 671.33 s [vector] map: OK
  14305. 671.33 s [vector] +++ OK, passed 100 tests.
  14306. 671.33 s [vector] imap: OK
  14307. 671.33 s [vector] +++ OK, passed 100 tests.
  14308. 671.33 s [vector] concatMap: OK
  14309. 671.33 s [vector] +++ OK, passed 100 tests.
  14310. 671.34 s [vector] mapM: OK
  14311. 671.34 s [vector] +++ OK, passed 100 tests.
  14312. 671.34 s [vector] mapM_: OK
  14313. 671.34 s [vector] +++ OK, passed 100 tests.
  14314. 671.34 s [vector] forM: OK
  14315. 671.35 s [vector] +++ OK, passed 100 tests.
  14316. 671.35 s [vector] forM_: OK
  14317. 671.35 s [vector] +++ OK, passed 100 tests.
  14318. 671.36 s [vector] imapM: OK
  14319. 671.36 s [vector] +++ OK, passed 100 tests.
  14320. 671.36 s [vector] imapM_: OK
  14321. 671.36 s [vector] +++ OK, passed 100 tests.
  14322. 671.37 s [vector] zipWith: OK
  14323. 671.37 s [vector] +++ OK, passed 100 tests.
  14324. 671.38 s [vector] zipWith3: OK
  14325. 671.39 s [vector] +++ OK, passed 100 tests.
  14326. 671.39 s [vector] izipWith: OK
  14327. 671.39 s [vector] +++ OK, passed 100 tests.
  14328. 671.39 s [vector] izipWith3: OK
  14329. 671.40 s [vector] +++ OK, passed 100 tests.
  14330. 671.41 s [vector] izipWithM: OK
  14331. 671.41 s [vector] +++ OK, passed 100 tests.
  14332. 671.42 s [vector] izipWithM_: OK (0.02s)
  14333. 671.42 s [vector] +++ OK, passed 100 tests.
  14334. 671.42 s [vector] zipWithM: OK (0.01s)
  14335. 671.43 s [vector] +++ OK, passed 100 tests.
  14336. 671.44 s [vector] zipWithM_: OK
  14337. 671.44 s [vector] +++ OK, passed 100 tests.
  14338. 671.44 s [vector] filter: OK
  14339. 671.44 s [vector] +++ OK, passed 100 tests.
  14340. 671.46 s [vector] ifilter: OK
  14341. 671.46 s [vector] +++ OK, passed 100 tests.
  14342. 671.50 s [vector] filterM: OK (0.05s)
  14343. 671.50 s [vector] +++ OK, passed 100 tests.
  14344. 671.50 s [vector] uniq: OK
  14345. 671.50 s [vector] +++ OK, passed 100 tests.
  14346. 671.50 s [vector] mapMaybe: OK
  14347. 671.50 s [vector] +++ OK, passed 100 tests.
  14348. 671.50 s [vector] imapMaybe: OK
  14349. 671.50 s [vector] +++ OK, passed 100 tests.
  14350. 671.50 s [vector] takeWhile: OK
  14351. 671.50 s [vector] +++ OK, passed 100 tests.
  14352. 671.51 s [vector] dropWhile: OK
  14353. 671.51 s [vector] +++ OK, passed 100 tests.
  14354. 671.51 s [vector] partition: OK
  14355. 671.51 s [vector] +++ OK, passed 100 tests.
  14356. 671.51 s [vector] partitionWith: OK
  14357. 671.51 s [vector] +++ OK, passed 100 tests.
  14358. 671.51 s [vector] span: OK
  14359. 671.51 s [vector] +++ OK, passed 100 tests.
  14360. 671.51 s [vector] break: OK
  14361. 671.51 s [vector] +++ OK, passed 100 tests.
  14362. 671.51 s [vector] spanR: OK
  14363. 671.51 s [vector] +++ OK, passed 100 tests.
  14364. 671.51 s [vector] breakR: OK
  14365. 671.51 s [vector] +++ OK, passed 100 tests.
  14366. 671.51 s [vector] groupBy: OK
  14367. 671.51 s [vector] +++ OK, passed 100 tests.
  14368. 671.51 s [vector] elem: OK
  14369. 671.51 s [vector] +++ OK, passed 100 tests.
  14370. 671.51 s [vector] notElem: OK
  14371. 671.51 s [vector] +++ OK, passed 100 tests.
  14372. 671.51 s [vector] find: OK
  14373. 671.51 s [vector] +++ OK, passed 100 tests.
  14374. 671.51 s [vector] findIndex: OK
  14375. 671.51 s [vector] +++ OK, passed 100 tests.
  14376. 671.51 s [vector] findIndexR: OK
  14377. 671.51 s [vector] +++ OK, passed 100 tests.
  14378. 671.51 s [vector] findIndices: OK
  14379. 671.51 s [vector] +++ OK, passed 100 tests.
  14380. 671.51 s [vector] elemIndex: OK
  14381. 671.51 s [vector] +++ OK, passed 100 tests.
  14382. 671.51 s [vector] elemIndices: OK
  14383. 671.51 s [vector] +++ OK, passed 100 tests.
  14384. 671.51 s [vector] foldl: OK
  14385. 671.51 s [vector] +++ OK, passed 100 tests.
  14386. 671.51 s [vector] foldl1: OK
  14387. 671.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14388. 671.52 s [vector] foldl': OK
  14389. 671.52 s [vector] +++ OK, passed 100 tests.
  14390. 671.52 s [vector] foldl1': OK
  14391. 671.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14392. 671.52 s [vector] foldr: OK
  14393. 671.52 s [vector] +++ OK, passed 100 tests.
  14394. 671.52 s [vector] foldr1: OK
  14395. 671.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14396. 671.52 s [vector] foldr': OK
  14397. 671.52 s [vector] +++ OK, passed 100 tests.
  14398. 671.52 s [vector] foldr1': OK
  14399. 671.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14400. 671.52 s [vector] ifoldl: OK
  14401. 671.52 s [vector] +++ OK, passed 100 tests.
  14402. 671.52 s [vector] ifoldl': OK
  14403. 671.52 s [vector] +++ OK, passed 100 tests.
  14404. 671.52 s [vector] ifoldr: OK
  14405. 671.52 s [vector] +++ OK, passed 100 tests.
  14406. 671.52 s [vector] ifoldr': OK
  14407. 671.52 s [vector] +++ OK, passed 100 tests.
  14408. 671.52 s [vector] ifoldM: OK
  14409. 671.52 s [vector] +++ OK, passed 100 tests.
  14410. 671.53 s [vector] ifoldM': OK
  14411. 671.53 s [vector] +++ OK, passed 100 tests.
  14412. 671.54 s [vector] ifoldM_: OK
  14413. 671.54 s [vector] +++ OK, passed 100 tests.
  14414. 671.54 s [vector] ifoldM'_: OK
  14415. 671.54 s [vector] +++ OK, passed 100 tests.
  14416. 671.54 s [vector] all: OK
  14417. 671.54 s [vector] +++ OK, passed 100 tests.
  14418. 671.54 s [vector] any: OK
  14419. 671.54 s [vector] +++ OK, passed 100 tests.
  14420. 671.54 s [vector] prescanl: OK
  14421. 671.54 s [vector] +++ OK, passed 100 tests.
  14422. 671.54 s [vector] prescanl': OK
  14423. 671.54 s [vector] +++ OK, passed 100 tests.
  14424. 671.54 s [vector] postscanl: OK
  14425. 671.54 s [vector] +++ OK, passed 100 tests.
  14426. 671.54 s [vector] postscanl': OK
  14427. 671.54 s [vector] +++ OK, passed 100 tests.
  14428. 671.54 s [vector] scanl: OK
  14429. 671.54 s [vector] +++ OK, passed 100 tests.
  14430. 671.54 s [vector] scanl': OK
  14431. 671.54 s [vector] +++ OK, passed 100 tests.
  14432. 671.54 s [vector] scanl1: OK
  14433. 671.54 s [vector] +++ OK, passed 100 tests.
  14434. 671.54 s [vector] scanl1': OK
  14435. 671.54 s [vector] +++ OK, passed 100 tests.
  14436. 671.54 s [vector] iscanl: OK
  14437. 671.54 s [vector] +++ OK, passed 100 tests.
  14438. 671.54 s [vector] iscanl': OK
  14439. 671.54 s [vector] +++ OK, passed 100 tests.
  14440. 671.54 s [vector] prescanr: OK
  14441. 671.55 s [vector] +++ OK, passed 100 tests.
  14442. 671.55 s [vector] prescanr': OK
  14443. 671.55 s [vector] +++ OK, passed 100 tests.
  14444. 671.55 s [vector] postscanr: OK
  14445. 671.55 s [vector] +++ OK, passed 100 tests.
  14446. 671.55 s [vector] postscanr': OK
  14447. 671.55 s [vector] +++ OK, passed 100 tests.
  14448. 671.55 s [vector] scanr: OK
  14449. 671.55 s [vector] +++ OK, passed 100 tests.
  14450. 671.55 s [vector] scanr': OK
  14451. 671.55 s [vector] +++ OK, passed 100 tests.
  14452. 671.55 s [vector] scanr1: OK
  14453. 671.55 s [vector] +++ OK, passed 100 tests.
  14454. 671.55 s [vector] scanr1': OK
  14455. 671.55 s [vector] +++ OK, passed 100 tests.
  14456. 671.55 s [vector] iscanr: OK
  14457. 671.55 s [vector] +++ OK, passed 100 tests.
  14458. 671.55 s [vector] iscanr': OK
  14459. 671.55 s [vector] +++ OK, passed 100 tests.
  14460. 671.55 s [vector] mut_read: OK
  14461. 671.55 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14462. 671.55 s [vector] mut_write: OK
  14463. 671.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14464. 671.55 s [vector] mut_modify: OK
  14465. 671.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14466. 671.55 s [vector] mut_generate: OK
  14467. 671.55 s [vector] +++ OK, passed 100 tests.
  14468. 671.56 s [vector] mut_generateM: OK
  14469. 671.57 s [vector] +++ OK, passed 100 tests.
  14470. 671.57 s [vector] mut_mapM_: OK
  14471. 671.57 s [vector] +++ OK, passed 100 tests.
  14472. 671.57 s [vector] mut_imapM_: OK
  14473. 671.57 s [vector] +++ OK, passed 100 tests.
  14474. 671.59 s [vector] mut_forM_: OK
  14475. 671.59 s [vector] +++ OK, passed 100 tests.
  14476. 671.59 s [vector] mut_iforM_: OK (0.01s)
  14477. 671.59 s [vector] +++ OK, passed 100 tests.
  14478. 671.59 s [vector] mut_foldr: OK
  14479. 671.59 s [vector] +++ OK, passed 100 tests.
  14480. 671.59 s [vector] mut_foldr': OK
  14481. 671.59 s [vector] +++ OK, passed 100 tests.
  14482. 671.59 s [vector] mut_foldl: OK
  14483. 671.59 s [vector] +++ OK, passed 100 tests.
  14484. 671.59 s [vector] mut_foldl': OK
  14485. 671.59 s [vector] +++ OK, passed 100 tests.
  14486. 671.60 s [vector] mut_ifoldr: OK
  14487. 671.60 s [vector] +++ OK, passed 100 tests.
  14488. 671.60 s [vector] mut_ifoldr': OK
  14489. 671.60 s [vector] +++ OK, passed 100 tests.
  14490. 671.60 s [vector] mut_ifoldl: OK
  14491. 671.60 s [vector] +++ OK, passed 100 tests.
  14492. 671.60 s [vector] mut_ifoldl': OK
  14493. 671.60 s [vector] +++ OK, passed 100 tests.
  14494. 671.60 s [vector] mut_foldM: OK
  14495. 671.60 s [vector] +++ OK, passed 100 tests.
  14496. 671.60 s [vector] mut_foldM': OK
  14497. 671.60 s [vector] +++ OK, passed 100 tests.
  14498. 671.60 s [vector] mut_foldrM: OK
  14499. 671.60 s [vector] +++ OK, passed 100 tests.
  14500. 671.60 s [vector] mut_foldrM': OK
  14501. 671.60 s [vector] +++ OK, passed 100 tests.
  14502. 671.60 s [vector] mut_ifoldM: OK
  14503. 671.60 s [vector] +++ OK, passed 100 tests.
  14504. 671.60 s [vector] mut_ifoldM': OK
  14505. 671.60 s [vector] +++ OK, passed 100 tests.
  14506. 671.60 s [vector] mut_ifoldrM: OK
  14507. 671.60 s [vector] +++ OK, passed 100 tests.
  14508. 671.60 s [vector] mut_ifoldrM': OK
  14509. 671.60 s [vector] +++ OK, passed 100 tests.
  14510. 671.60 s [vector] compare: OK
  14511. 671.60 s [vector] +++ OK, passed 100 tests.
  14512. 671.60 s [vector] maximum: OK
  14513. 671.60 s [vector] +++ OK, passed 100 tests; 22 discarded.
  14514. 671.60 s [vector] minimum: OK
  14515. 671.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14516. 671.60 s [vector] minIndex: OK
  14517. 671.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14518. 671.60 s [vector] maxIndex: OK
  14519. 671.60 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14520. 671.60 s [vector] maximumBy: OK
  14521. 671.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14522. 671.61 s [vector] minimumBy: OK
  14523. 671.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14524. 671.61 s [vector] maximumOn: OK
  14525. 671.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14526. 671.61 s [vector] minimumOn: OK
  14527. 671.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14528. 671.61 s [vector] maxIndexBy: OK
  14529. 671.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14530. 671.61 s [vector] minIndexBy: OK
  14531. 671.61 s [vector] +++ OK, passed 100 tests; 21 discarded.
  14532. 671.61 s [vector] ListFirstMaxIndexWins: OK
  14533. 671.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14534. 671.61 s [vector] FalseListFirstMaxIndexWins: OK
  14535. 671.61 s [vector] +++ OK, failed as expected. (after 1 test):
  14536. 671.61 s [vector] Exception:
  14537. 671.61 s [vector] Prelude.foldr1: empty list
  14538. 671.61 s [vector] CallStack (from HasCallStack):
  14539. 671.61 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14540. 671.61 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14541. 671.61 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14542. 671.61 s [vector] []
  14543. 671.61 s [vector] zip: OK
  14544. 671.61 s [vector] +++ OK, passed 100 tests.
  14545. 671.61 s [vector] zip3: OK
  14546. 671.61 s [vector] +++ OK, passed 100 tests.
  14547. 671.61 s [vector] unzip: OK
  14548. 671.61 s [vector] +++ OK, passed 100 tests.
  14549. 671.61 s [vector] unzip3: OK
  14550. 671.61 s [vector] +++ OK, passed 100 tests.
  14551. 671.61 s [vector] indexed: OK
  14552. 671.61 s [vector] +++ OK, passed 100 tests.
  14553. 671.61 s [vector] update: OK
  14554. 671.61 s [vector] +++ OK, passed 100 tests.
  14555. 671.62 s [vector] mempty: OK
  14556. 671.62 s [vector] +++ OK, passed 100 tests.
  14557. 671.62 s [vector] mappend: OK
  14558. 671.62 s [vector] +++ OK, passed 100 tests.
  14559. 671.63 s [vector] mconcat: OK
  14560. 671.63 s [vector] +++ OK, passed 100 tests.
  14561. 671.63 s [vector] glength: OK
  14562. 671.63 s [vector] +++ OK, passed 100 tests.
  14563. 671.63 s [vector] (Bool)
  14564. 671.63 s [vector] fromList.toList == id: OK
  14565. 671.63 s [vector] +++ OK, passed 100 tests.
  14566. 671.63 s [vector] toList.fromList == id: OK
  14567. 671.63 s [vector] +++ OK, passed 100 tests.
  14568. 671.63 s [vector] unstream.stream == id: OK
  14569. 671.63 s [vector] +++ OK, passed 100 tests.
  14570. 671.63 s [vector] stream.unstream == id: OK
  14571. 671.63 s [vector] +++ OK, passed 100 tests.
  14572. 671.63 s [vector] eq: OK
  14573. 671.63 s [vector] +++ OK, passed 100 tests.
  14574. 671.63 s [vector] length: OK
  14575. 671.63 s [vector] +++ OK, passed 100 tests.
  14576. 671.63 s [vector] null: OK
  14577. 671.63 s [vector] +++ OK, passed 100 tests.
  14578. 671.63 s [vector] index: OK
  14579. 671.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14580. 671.63 s [vector] safeIndex: OK
  14581. 671.63 s [vector] +++ OK, passed 100 tests.
  14582. 671.63 s [vector] head: OK
  14583. 671.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14584. 671.63 s [vector] last: OK
  14585. 671.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14586. 671.63 s [vector] unsafeIndex: OK
  14587. 671.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14588. 671.63 s [vector] unsafeHead: OK
  14589. 671.63 s [vector] +++ OK, passed 100 tests; 11 discarded.
  14590. 671.63 s [vector] unsafeLast: OK
  14591. 671.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  14592. 671.63 s [vector] slice: OK
  14593. 671.63 s [vector] +++ OK, passed 100 tests.
  14594. 671.63 s [vector] init: OK
  14595. 671.63 s [vector] +++ OK, passed 100 tests; 25 discarded.
  14596. 671.63 s [vector] tail: OK
  14597. 671.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14598. 671.63 s [vector] take: OK
  14599. 671.63 s [vector] +++ OK, passed 100 tests.
  14600. 671.63 s [vector] drop: OK
  14601. 671.64 s [vector] +++ OK, passed 100 tests.
  14602. 671.64 s [vector] splitAt: OK
  14603. 671.64 s [vector] +++ OK, passed 100 tests.
  14604. 671.64 s [vector] empty: OK
  14605. 671.64 s [vector] +++ OK, passed 100 tests.
  14606. 671.64 s [vector] singleton: OK
  14607. 671.64 s [vector] +++ OK, passed 100 tests.
  14608. 671.64 s [vector] replicate: OK
  14609. 671.64 s [vector] +++ OK, passed 100 tests.
  14610. 671.64 s [vector] generate: OK
  14611. 671.64 s [vector] +++ OK, passed 100 tests.
  14612. 671.64 s [vector] iterateN: OK
  14613. 671.64 s [vector] +++ OK, passed 100 tests.
  14614. 671.68 s [vector] iterateNM: OK (0.03s)
  14615. 671.68 s [vector] +++ OK, passed 100 tests.
  14616. 671.70 s [vector] generateM: OK (0.02s)
  14617. 671.70 s [vector] +++ OK, passed 100 tests.
  14618. 671.71 s [vector] replicateM: OK (0.02s)
  14619. 671.71 s [vector] +++ OK, passed 100 tests.
  14620. 671.71 s [vector] create: OK
  14621. 671.71 s [vector] +++ OK, passed 100 tests.
  14622. 671.71 s [vector] createT: OK
  14623. 671.71 s [vector] +++ OK, passed 100 tests.
  14624. 671.71 s [vector] unfoldr: OK
  14625. 671.71 s [vector] +++ OK, passed 100 tests.
  14626. 671.71 s [vector] unfoldrN: OK
  14627. 671.71 s [vector] +++ OK, passed 100 tests.
  14628. 671.71 s [vector] unfoldrExactN: OK
  14629. 671.71 s [vector] +++ OK, passed 100 tests.
  14630. 671.72 s [vector] unfoldrM: OK
  14631. 671.72 s [vector] +++ OK, passed 100 tests.
  14632. 671.72 s [vector] unfoldrNM: OK
  14633. 671.72 s [vector] +++ OK, passed 100 tests.
  14634. 671.73 s [vector] unfoldrExactNM: OK (0.01s)
  14635. 671.73 s [vector] +++ OK, passed 100 tests.
  14636. 671.74 s [vector] constructN: OK
  14637. 671.74 s [vector] +++ OK, passed 100 tests.
  14638. 671.74 s [vector] constructrN: OK
  14639. 671.74 s [vector] +++ OK, passed 100 tests.
  14640. 671.74 s [vector] cons: OK
  14641. 671.74 s [vector] +++ OK, passed 100 tests.
  14642. 671.74 s [vector] snoc: OK
  14643. 671.74 s [vector] +++ OK, passed 100 tests.
  14644. 671.75 s [vector] append: OK
  14645. 671.75 s [vector] +++ OK, passed 100 tests.
  14646. 671.75 s [vector] concat: OK (0.01s)
  14647. 671.75 s [vector] +++ OK, passed 100 tests.
  14648. 671.75 s [vector] force: OK
  14649. 671.75 s [vector] +++ OK, passed 100 tests.
  14650. 671.76 s [vector] upd: OK
  14651. 671.76 s [vector] +++ OK, passed 100 tests.
  14652. 671.76 s [vector] accum: OK
  14653. 671.76 s [vector] +++ OK, passed 100 tests.
  14654. 671.76 s [vector] reverse: OK
  14655. 671.76 s [vector] +++ OK, passed 100 tests.
  14656. 671.76 s [vector] backpermute: OK
  14657. 671.76 s [vector] +++ OK, passed 100 tests.
  14658. 671.76 s [vector] map: OK
  14659. 671.76 s [vector] +++ OK, passed 100 tests.
  14660. 671.76 s [vector] imap: OK
  14661. 671.76 s [vector] +++ OK, passed 100 tests.
  14662. 671.76 s [vector] concatMap: OK
  14663. 671.76 s [vector] +++ OK, passed 100 tests.
  14664. 671.76 s [vector] mapM: OK
  14665. 671.77 s [vector] +++ OK, passed 100 tests.
  14666. 671.77 s [vector] mapM_: OK
  14667. 671.77 s [vector] +++ OK, passed 100 tests.
  14668. 671.78 s [vector] forM: OK
  14669. 671.78 s [vector] +++ OK, passed 100 tests.
  14670. 671.78 s [vector] forM_: OK
  14671. 671.78 s [vector] +++ OK, passed 100 tests.
  14672. 671.78 s [vector] imapM: OK
  14673. 671.79 s [vector] +++ OK, passed 100 tests.
  14674. 671.79 s [vector] imapM_: OK
  14675. 671.79 s [vector] +++ OK, passed 100 tests.
  14676. 671.79 s [vector] zipWith: OK
  14677. 671.80 s [vector] +++ OK, passed 100 tests.
  14678. 671.80 s [vector] zipWith3: OK
  14679. 671.80 s [vector] +++ OK, passed 100 tests.
  14680. 671.80 s [vector] izipWith: OK
  14681. 671.80 s [vector] +++ OK, passed 100 tests.
  14682. 671.80 s [vector] izipWith3: OK
  14683. 671.80 s [vector] +++ OK, passed 100 tests.
  14684. 671.81 s [vector] izipWithM: OK
  14685. 671.81 s [vector] +++ OK, passed 100 tests.
  14686. 671.81 s [vector] izipWithM_: OK
  14687. 671.81 s [vector] +++ OK, passed 100 tests.
  14688. 671.81 s [vector] zipWithM: OK
  14689. 671.82 s [vector] +++ OK, passed 100 tests.
  14690. 671.82 s [vector] zipWithM_: OK
  14691. 671.82 s [vector] +++ OK, passed 100 tests.
  14692. 671.82 s [vector] filter: OK
  14693. 671.82 s [vector] +++ OK, passed 100 tests.
  14694. 671.82 s [vector] ifilter: OK
  14695. 671.84 s [vector] +++ OK, passed 100 tests.
  14696. 671.84 s [vector] filterM: OK (0.02s)
  14697. 671.84 s [vector] +++ OK, passed 100 tests.
  14698. 671.84 s [vector] uniq: OK
  14699. 671.84 s [vector] +++ OK, passed 100 tests.
  14700. 671.84 s [vector] mapMaybe: OK
  14701. 671.84 s [vector] +++ OK, passed 100 tests.
  14702. 671.84 s [vector] imapMaybe: OK
  14703. 671.84 s [vector] +++ OK, passed 100 tests.
  14704. 671.84 s [vector] takeWhile: OK
  14705. 671.84 s [vector] +++ OK, passed 100 tests.
  14706. 671.84 s [vector] dropWhile: OK
  14707. 671.84 s [vector] +++ OK, passed 100 tests.
  14708. 671.84 s [vector] partition: OK
  14709. 671.85 s [vector] +++ OK, passed 100 tests.
  14710. 671.85 s [vector] partitionWith: OK
  14711. 671.85 s [vector] +++ OK, passed 100 tests.
  14712. 671.85 s [vector] span: OK
  14713. 671.85 s [vector] +++ OK, passed 100 tests.
  14714. 671.85 s [vector] break: OK
  14715. 671.85 s [vector] +++ OK, passed 100 tests.
  14716. 671.85 s [vector] spanR: OK
  14717. 671.85 s [vector] +++ OK, passed 100 tests.
  14718. 671.85 s [vector] breakR: OK
  14719. 671.85 s [vector] +++ OK, passed 100 tests.
  14720. 671.85 s [vector] groupBy: OK
  14721. 671.85 s [vector] +++ OK, passed 100 tests.
  14722. 671.85 s [vector] elem: OK
  14723. 671.85 s [vector] +++ OK, passed 100 tests.
  14724. 671.85 s [vector] notElem: OK
  14725. 671.85 s [vector] +++ OK, passed 100 tests.
  14726. 671.85 s [vector] find: OK
  14727. 671.85 s [vector] +++ OK, passed 100 tests.
  14728. 671.85 s [vector] findIndex: OK
  14729. 671.85 s [vector] +++ OK, passed 100 tests.
  14730. 671.85 s [vector] findIndexR: OK
  14731. 671.85 s [vector] +++ OK, passed 100 tests.
  14732. 671.85 s [vector] findIndices: OK
  14733. 671.85 s [vector] +++ OK, passed 100 tests.
  14734. 671.85 s [vector] elemIndex: OK
  14735. 671.85 s [vector] +++ OK, passed 100 tests.
  14736. 671.86 s [vector] elemIndices: OK
  14737. 671.86 s [vector] +++ OK, passed 100 tests.
  14738. 671.86 s [vector] foldl: OK
  14739. 671.86 s [vector] +++ OK, passed 100 tests.
  14740. 671.86 s [vector] foldl1: OK
  14741. 671.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14742. 671.86 s [vector] foldl': OK
  14743. 671.86 s [vector] +++ OK, passed 100 tests.
  14744. 671.86 s [vector] foldl1': OK
  14745. 671.86 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14746. 671.86 s [vector] foldr: OK
  14747. 671.86 s [vector] +++ OK, passed 100 tests.
  14748. 671.86 s [vector] foldr1: OK
  14749. 671.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  14750. 671.86 s [vector] foldr': OK
  14751. 671.86 s [vector] +++ OK, passed 100 tests.
  14752. 671.87 s [vector] foldr1': OK
  14753. 671.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14754. 671.87 s [vector] ifoldl: OK
  14755. 671.87 s [vector] +++ OK, passed 100 tests.
  14756. 671.87 s [vector] ifoldl': OK
  14757. 671.87 s [vector] +++ OK, passed 100 tests.
  14758. 671.87 s [vector] ifoldr: OK
  14759. 671.87 s [vector] +++ OK, passed 100 tests.
  14760. 671.87 s [vector] ifoldr': OK
  14761. 671.88 s [vector] +++ OK, passed 100 tests.
  14762. 671.88 s [vector] ifoldM: OK
  14763. 671.88 s [vector] +++ OK, passed 100 tests.
  14764. 671.88 s [vector] ifoldM': OK
  14765. 671.88 s [vector] +++ OK, passed 100 tests.
  14766. 671.90 s [vector] ifoldM_: OK (0.01s)
  14767. 671.90 s [vector] +++ OK, passed 100 tests.
  14768. 671.90 s [vector] ifoldM'_: OK (0.01s)
  14769. 671.90 s [vector] +++ OK, passed 100 tests.
  14770. 671.90 s [vector] all: OK
  14771. 671.90 s [vector] +++ OK, passed 100 tests.
  14772. 671.90 s [vector] any: OK
  14773. 671.90 s [vector] +++ OK, passed 100 tests.
  14774. 671.90 s [vector] prescanl: OK
  14775. 671.90 s [vector] +++ OK, passed 100 tests.
  14776. 671.91 s [vector] prescanl': OK
  14777. 671.91 s [vector] +++ OK, passed 100 tests.
  14778. 671.91 s [vector] postscanl: OK
  14779. 671.91 s [vector] +++ OK, passed 100 tests.
  14780. 671.91 s [vector] postscanl': OK
  14781. 671.91 s [vector] +++ OK, passed 100 tests.
  14782. 671.91 s [vector] scanl: OK
  14783. 671.91 s [vector] +++ OK, passed 100 tests.
  14784. 671.91 s [vector] scanl': OK
  14785. 671.91 s [vector] +++ OK, passed 100 tests.
  14786. 671.91 s [vector] scanl1: OK
  14787. 671.91 s [vector] +++ OK, passed 100 tests.
  14788. 671.91 s [vector] scanl1': OK
  14789. 671.91 s [vector] +++ OK, passed 100 tests.
  14790. 671.91 s [vector] iscanl: OK
  14791. 671.91 s [vector] +++ OK, passed 100 tests.
  14792. 671.91 s [vector] iscanl': OK
  14793. 671.91 s [vector] +++ OK, passed 100 tests.
  14794. 671.91 s [vector] prescanr: OK
  14795. 671.92 s [vector] +++ OK, passed 100 tests.
  14796. 671.92 s [vector] prescanr': OK
  14797. 671.92 s [vector] +++ OK, passed 100 tests.
  14798. 671.92 s [vector] postscanr: OK
  14799. 671.92 s [vector] +++ OK, passed 100 tests.
  14800. 671.92 s [vector] postscanr': OK
  14801. 671.92 s [vector] +++ OK, passed 100 tests.
  14802. 671.92 s [vector] scanr: OK
  14803. 671.92 s [vector] +++ OK, passed 100 tests.
  14804. 671.92 s [vector] scanr': OK
  14805. 671.92 s [vector] +++ OK, passed 100 tests.
  14806. 671.92 s [vector] scanr1: OK
  14807. 671.92 s [vector] +++ OK, passed 100 tests.
  14808. 671.92 s [vector] scanr1': OK
  14809. 671.92 s [vector] +++ OK, passed 100 tests.
  14810. 671.93 s [vector] iscanr: OK
  14811. 671.93 s [vector] +++ OK, passed 100 tests.
  14812. 671.93 s [vector] iscanr': OK
  14813. 671.93 s [vector] +++ OK, passed 100 tests.
  14814. 671.93 s [vector] mut_read: OK
  14815. 671.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14816. 671.93 s [vector] mut_write: OK
  14817. 671.93 s [vector] +++ OK, passed 100 tests; 13 discarded.
  14818. 671.93 s [vector] mut_modify: OK
  14819. 671.93 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14820. 671.93 s [vector] mut_generate: OK
  14821. 671.94 s [vector] +++ OK, passed 100 tests.
  14822. 671.94 s [vector] mut_generateM: OK
  14823. 671.94 s [vector] +++ OK, passed 100 tests.
  14824. 671.95 s [vector] mut_mapM_: OK
  14825. 671.95 s [vector] +++ OK, passed 100 tests.
  14826. 671.96 s [vector] mut_imapM_: OK
  14827. 671.96 s [vector] +++ OK, passed 100 tests.
  14828. 671.97 s [vector] mut_forM_: OK
  14829. 671.97 s [vector] +++ OK, passed 100 tests.
  14830. 671.97 s [vector] mut_iforM_: OK
  14831. 671.97 s [vector] +++ OK, passed 100 tests.
  14832. 671.97 s [vector] mut_foldr: OK
  14833. 671.97 s [vector] +++ OK, passed 100 tests.
  14834. 671.98 s [vector] mut_foldr': OK
  14835. 671.98 s [vector] +++ OK, passed 100 tests.
  14836. 671.98 s [vector] mut_foldl: OK
  14837. 671.98 s [vector] +++ OK, passed 100 tests.
  14838. 671.98 s [vector] mut_foldl': OK
  14839. 671.98 s [vector] +++ OK, passed 100 tests.
  14840. 671.98 s [vector] mut_ifoldr: OK
  14841. 671.98 s [vector] +++ OK, passed 100 tests.
  14842. 671.98 s [vector] mut_ifoldr': OK
  14843. 671.98 s [vector] +++ OK, passed 100 tests.
  14844. 671.98 s [vector] mut_ifoldl: OK
  14845. 671.98 s [vector] +++ OK, passed 100 tests.
  14846. 671.98 s [vector] mut_ifoldl': OK
  14847. 671.99 s [vector] +++ OK, passed 100 tests.
  14848. 671.99 s [vector] mut_foldM: OK
  14849. 671.99 s [vector] +++ OK, passed 100 tests.
  14850. 671.99 s [vector] mut_foldM': OK
  14851. 671.99 s [vector] +++ OK, passed 100 tests.
  14852. 671.99 s [vector] mut_foldrM: OK
  14853. 671.99 s [vector] +++ OK, passed 100 tests.
  14854. 671.99 s [vector] mut_foldrM': OK
  14855. 671.99 s [vector] +++ OK, passed 100 tests.
  14856. 671.99 s [vector] mut_ifoldM: OK
  14857. 671.99 s [vector] +++ OK, passed 100 tests.
  14858. 671.99 s [vector] mut_ifoldM': OK
  14859. 671.99 s [vector] +++ OK, passed 100 tests.
  14860. 671.99 s [vector] mut_ifoldrM: OK
  14861. 671.99 s [vector] +++ OK, passed 100 tests.
  14862. 671.99 s [vector] mut_ifoldrM': OK
  14863. 671.99 s [vector] +++ OK, passed 100 tests.
  14864. 671.99 s [vector] compare: OK
  14865. 671.99 s [vector] +++ OK, passed 100 tests.
  14866. 671.99 s [vector] maximum: OK
  14867. 671.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14868. 671.99 s [vector] minimum: OK
  14869. 671.99 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14870. 671.99 s [vector] minIndex: OK
  14871. 671.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14872. 671.99 s [vector] maxIndex: OK
  14873. 671.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14874. 672.00 s [vector] maximumBy: OK
  14875. 672.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14876. 672.00 s [vector] minimumBy: OK
  14877. 672.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14878. 672.00 s [vector] maximumOn: OK
  14879. 672.00 s [vector] +++ OK, passed 100 tests; 23 discarded.
  14880. 672.00 s [vector] minimumOn: OK
  14881. 672.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14882. 672.00 s [vector] maxIndexBy: OK
  14883. 672.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14884. 672.00 s [vector] minIndexBy: OK
  14885. 672.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14886. 672.00 s [vector] ListFirstMaxIndexWins: OK
  14887. 672.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14888. 672.00 s [vector] FalseListFirstMaxIndexWins: OK
  14889. 672.00 s [vector] +++ OK, failed as expected. (after 1 test):
  14890. 672.00 s [vector] Exception:
  14891. 672.00 s [vector] Prelude.foldr1: empty list
  14892. 672.00 s [vector] CallStack (from HasCallStack):
  14893. 672.00 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  14894. 672.00 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  14895. 672.00 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  14896. 672.00 s [vector] []
  14897. 672.00 s [vector] zip: OK
  14898. 672.00 s [vector] +++ OK, passed 100 tests.
  14899. 672.00 s [vector] zip3: OK
  14900. 672.00 s [vector] +++ OK, passed 100 tests.
  14901. 672.00 s [vector] unzip: OK
  14902. 672.00 s [vector] +++ OK, passed 100 tests.
  14903. 672.00 s [vector] unzip3: OK
  14904. 672.00 s [vector] +++ OK, passed 100 tests.
  14905. 672.00 s [vector] indexed: OK
  14906. 672.00 s [vector] +++ OK, passed 100 tests.
  14907. 672.00 s [vector] update: OK
  14908. 672.01 s [vector] +++ OK, passed 100 tests.
  14909. 672.01 s [vector] mempty: OK
  14910. 672.01 s [vector] +++ OK, passed 100 tests.
  14911. 672.04 s [vector] mappend: OK
  14912. 672.04 s [vector] +++ OK, passed 100 tests.
  14913. 672.04 s [vector] mconcat: OK (0.03s)
  14914. 672.04 s [vector] +++ OK, passed 100 tests.
  14915. 672.05 s [vector] glength: OK
  14916. 672.05 s [vector] +++ OK, passed 100 tests.
  14917. 672.05 s [vector] and: OK
  14918. 672.05 s [vector] +++ OK, passed 100 tests.
  14919. 672.05 s [vector] or: OK
  14920. 672.05 s [vector] +++ OK, passed 100 tests.
  14921. 672.05 s [vector] (Int)
  14922. 672.05 s [vector] fromList.toList == id: OK
  14923. 672.05 s [vector] +++ OK, passed 100 tests.
  14924. 672.05 s [vector] toList.fromList == id: OK
  14925. 672.05 s [vector] +++ OK, passed 100 tests.
  14926. 672.05 s [vector] unstream.stream == id: OK
  14927. 672.05 s [vector] +++ OK, passed 100 tests.
  14928. 672.05 s [vector] stream.unstream == id: OK
  14929. 672.05 s [vector] +++ OK, passed 100 tests.
  14930. 672.05 s [vector] eq: OK
  14931. 672.05 s [vector] +++ OK, passed 100 tests.
  14932. 672.05 s [vector] length: OK
  14933. 672.05 s [vector] +++ OK, passed 100 tests.
  14934. 672.05 s [vector] null: OK
  14935. 672.05 s [vector] +++ OK, passed 100 tests.
  14936. 672.05 s [vector] index: OK
  14937. 672.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  14938. 672.05 s [vector] safeIndex: OK
  14939. 672.05 s [vector] +++ OK, passed 100 tests.
  14940. 672.05 s [vector] head: OK
  14941. 672.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14942. 672.05 s [vector] last: OK
  14943. 672.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14944. 672.06 s [vector] unsafeIndex: OK
  14945. 672.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14946. 672.06 s [vector] unsafeHead: OK
  14947. 672.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  14948. 672.06 s [vector] unsafeLast: OK
  14949. 672.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  14950. 672.06 s [vector] slice: OK
  14951. 672.06 s [vector] +++ OK, passed 100 tests.
  14952. 672.06 s [vector] init: OK
  14953. 672.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  14954. 672.06 s [vector] tail: OK
  14955. 672.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  14956. 672.06 s [vector] take: OK
  14957. 672.06 s [vector] +++ OK, passed 100 tests.
  14958. 672.06 s [vector] drop: OK
  14959. 672.06 s [vector] +++ OK, passed 100 tests.
  14960. 672.06 s [vector] splitAt: OK
  14961. 672.06 s [vector] +++ OK, passed 100 tests.
  14962. 672.06 s [vector] empty: OK
  14963. 672.06 s [vector] +++ OK, passed 100 tests.
  14964. 672.06 s [vector] singleton: OK
  14965. 672.06 s [vector] +++ OK, passed 100 tests.
  14966. 672.06 s [vector] replicate: OK
  14967. 672.06 s [vector] +++ OK, passed 100 tests.
  14968. 672.06 s [vector] generate: OK
  14969. 672.06 s [vector] +++ OK, passed 100 tests.
  14970. 672.07 s [vector] iterateN: OK
  14971. 672.07 s [vector] +++ OK, passed 100 tests.
  14972. 672.08 s [vector] iterateNM: OK (0.02s)
  14973. 672.08 s [vector] +++ OK, passed 100 tests.
  14974. 672.10 s [vector] generateM: OK (0.02s)
  14975. 672.10 s [vector] +++ OK, passed 100 tests.
  14976. 672.10 s [vector] replicateM: OK
  14977. 672.10 s [vector] +++ OK, passed 100 tests.
  14978. 672.10 s [vector] create: OK
  14979. 672.10 s [vector] +++ OK, passed 100 tests.
  14980. 672.10 s [vector] createT: OK
  14981. 672.10 s [vector] +++ OK, passed 100 tests.
  14982. 672.10 s [vector] unfoldr: OK
  14983. 672.10 s [vector] +++ OK, passed 100 tests.
  14984. 672.10 s [vector] unfoldrN: OK
  14985. 672.10 s [vector] +++ OK, passed 100 tests.
  14986. 672.10 s [vector] unfoldrExactN: OK
  14987. 672.11 s [vector] +++ OK, passed 100 tests.
  14988. 672.11 s [vector] unfoldrM: OK
  14989. 672.11 s [vector] +++ OK, passed 100 tests.
  14990. 672.12 s [vector] unfoldrNM: OK
  14991. 672.12 s [vector] +++ OK, passed 100 tests.
  14992. 672.12 s [vector] unfoldrExactNM: OK
  14993. 672.13 s [vector] +++ OK, passed 100 tests.
  14994. 672.13 s [vector] constructN: OK
  14995. 672.13 s [vector] +++ OK, passed 100 tests.
  14996. 672.13 s [vector] constructrN: OK
  14997. 672.13 s [vector] +++ OK, passed 100 tests.
  14998. 672.13 s [vector] cons: OK
  14999. 672.13 s [vector] +++ OK, passed 100 tests.
  15000. 672.13 s [vector] snoc: OK
  15001. 672.13 s [vector] +++ OK, passed 100 tests.
  15002. 672.13 s [vector] append: OK
  15003. 672.14 s [vector] +++ OK, passed 100 tests.
  15004. 672.14 s [vector] concat: OK (0.02s)
  15005. 672.14 s [vector] +++ OK, passed 100 tests.
  15006. 672.14 s [vector] force: OK
  15007. 672.14 s [vector] +++ OK, passed 100 tests.
  15008. 672.14 s [vector] upd: OK
  15009. 672.14 s [vector] +++ OK, passed 100 tests.
  15010. 672.15 s [vector] accum: OK
  15011. 672.15 s [vector] +++ OK, passed 100 tests.
  15012. 672.15 s [vector] reverse: OK
  15013. 672.15 s [vector] +++ OK, passed 100 tests.
  15014. 672.16 s [vector] backpermute: OK
  15015. 672.16 s [vector] +++ OK, passed 100 tests.
  15016. 672.16 s [vector] map: OK
  15017. 672.16 s [vector] +++ OK, passed 100 tests.
  15018. 672.16 s [vector] imap: OK
  15019. 672.16 s [vector] +++ OK, passed 100 tests.
  15020. 672.16 s [vector] concatMap: OK
  15021. 672.16 s [vector] +++ OK, passed 100 tests.
  15022. 672.18 s [vector] mapM: OK
  15023. 672.18 s [vector] +++ OK, passed 100 tests.
  15024. 672.18 s [vector] mapM_: OK (0.02s)
  15025. 672.18 s [vector] +++ OK, passed 100 tests.
  15026. 672.19 s [vector] forM: OK
  15027. 672.19 s [vector] +++ OK, passed 100 tests.
  15028. 672.19 s [vector] forM_: OK (0.01s)
  15029. 672.19 s [vector] +++ OK, passed 100 tests.
  15030. 672.20 s [vector] imapM: OK
  15031. 672.20 s [vector] +++ OK, passed 100 tests.
  15032. 672.21 s [vector] imapM_: OK (0.01s)
  15033. 672.21 s [vector] +++ OK, passed 100 tests.
  15034. 672.21 s [vector] zipWith: OK
  15035. 672.21 s [vector] +++ OK, passed 100 tests.
  15036. 672.21 s [vector] zipWith3: OK
  15037. 672.21 s [vector] +++ OK, passed 100 tests.
  15038. 672.21 s [vector] izipWith: OK
  15039. 672.22 s [vector] +++ OK, passed 100 tests.
  15040. 672.22 s [vector] izipWith3: OK
  15041. 672.22 s [vector] +++ OK, passed 100 tests.
  15042. 672.23 s [vector] izipWithM: OK
  15043. 672.23 s [vector] +++ OK, passed 100 tests.
  15044. 672.23 s [vector] izipWithM_: OK (0.01s)
  15045. 672.23 s [vector] +++ OK, passed 100 tests.
  15046. 672.24 s [vector] zipWithM: OK
  15047. 672.24 s [vector] +++ OK, passed 100 tests.
  15048. 672.25 s [vector] zipWithM_: OK (0.01s)
  15049. 672.25 s [vector] +++ OK, passed 100 tests.
  15050. 672.25 s [vector] filter: OK
  15051. 672.25 s [vector] +++ OK, passed 100 tests.
  15052. 672.25 s [vector] ifilter: OK
  15053. 672.26 s [vector] +++ OK, passed 100 tests.
  15054. 672.27 s [vector] filterM: OK (0.02s)
  15055. 672.27 s [vector] +++ OK, passed 100 tests.
  15056. 672.27 s [vector] uniq: OK
  15057. 672.27 s [vector] +++ OK, passed 100 tests.
  15058. 672.28 s [vector] mapMaybe: OK
  15059. 672.28 s [vector] +++ OK, passed 100 tests.
  15060. 672.28 s [vector] imapMaybe: OK
  15061. 672.28 s [vector] +++ OK, passed 100 tests.
  15062. 672.28 s [vector] takeWhile: OK
  15063. 672.28 s [vector] +++ OK, passed 100 tests.
  15064. 672.28 s [vector] dropWhile: OK
  15065. 672.28 s [vector] +++ OK, passed 100 tests.
  15066. 672.28 s [vector] partition: OK
  15067. 672.28 s [vector] +++ OK, passed 100 tests.
  15068. 672.28 s [vector] partitionWith: OK
  15069. 672.28 s [vector] +++ OK, passed 100 tests.
  15070. 672.28 s [vector] span: OK
  15071. 672.28 s [vector] +++ OK, passed 100 tests.
  15072. 672.28 s [vector] break: OK
  15073. 672.28 s [vector] +++ OK, passed 100 tests.
  15074. 672.28 s [vector] spanR: OK
  15075. 672.28 s [vector] +++ OK, passed 100 tests.
  15076. 672.28 s [vector] breakR: OK
  15077. 672.29 s [vector] +++ OK, passed 100 tests.
  15078. 672.29 s [vector] groupBy: OK
  15079. 672.29 s [vector] +++ OK, passed 100 tests.
  15080. 672.29 s [vector] elem: OK
  15081. 672.29 s [vector] +++ OK, passed 100 tests.
  15082. 672.29 s [vector] notElem: OK
  15083. 672.29 s [vector] +++ OK, passed 100 tests.
  15084. 672.29 s [vector] find: OK
  15085. 672.29 s [vector] +++ OK, passed 100 tests.
  15086. 672.29 s [vector] findIndex: OK
  15087. 672.29 s [vector] +++ OK, passed 100 tests.
  15088. 672.29 s [vector] findIndexR: OK
  15089. 672.29 s [vector] +++ OK, passed 100 tests.
  15090. 672.29 s [vector] findIndices: OK
  15091. 672.29 s [vector] +++ OK, passed 100 tests.
  15092. 672.29 s [vector] elemIndex: OK
  15093. 672.29 s [vector] +++ OK, passed 100 tests.
  15094. 672.29 s [vector] elemIndices: OK
  15095. 672.30 s [vector] +++ OK, passed 100 tests.
  15096. 672.30 s [vector] foldl: OK
  15097. 672.30 s [vector] +++ OK, passed 100 tests.
  15098. 672.30 s [vector] foldl1: OK
  15099. 672.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15100. 672.30 s [vector] foldl': OK
  15101. 672.30 s [vector] +++ OK, passed 100 tests.
  15102. 672.30 s [vector] foldl1': OK
  15103. 672.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15104. 672.30 s [vector] foldr: OK
  15105. 672.30 s [vector] +++ OK, passed 100 tests.
  15106. 672.30 s [vector] foldr1: OK
  15107. 672.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15108. 672.31 s [vector] foldr': OK
  15109. 672.31 s [vector] +++ OK, passed 100 tests.
  15110. 672.31 s [vector] foldr1': OK
  15111. 672.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15112. 672.31 s [vector] ifoldl: OK
  15113. 672.31 s [vector] +++ OK, passed 100 tests.
  15114. 672.31 s [vector] ifoldl': OK
  15115. 672.32 s [vector] +++ OK, passed 100 tests.
  15116. 672.32 s [vector] ifoldr: OK
  15117. 672.33 s [vector] +++ OK, passed 100 tests.
  15118. 672.33 s [vector] ifoldr': OK
  15119. 672.33 s [vector] +++ OK, passed 100 tests.
  15120. 672.33 s [vector] ifoldM: OK
  15121. 672.33 s [vector] +++ OK, passed 100 tests.
  15122. 672.34 s [vector] ifoldM': OK
  15123. 672.34 s [vector] +++ OK, passed 100 tests.
  15124. 672.36 s [vector] ifoldM_: OK (0.02s)
  15125. 672.36 s [vector] +++ OK, passed 100 tests.
  15126. 672.36 s [vector] ifoldM'_: OK (0.01s)
  15127. 672.36 s [vector] +++ OK, passed 100 tests.
  15128. 672.36 s [vector] all: OK
  15129. 672.36 s [vector] +++ OK, passed 100 tests.
  15130. 672.37 s [vector] any: OK
  15131. 672.37 s [vector] +++ OK, passed 100 tests.
  15132. 672.37 s [vector] prescanl: OK
  15133. 672.37 s [vector] +++ OK, passed 100 tests.
  15134. 672.37 s [vector] prescanl': OK
  15135. 672.37 s [vector] +++ OK, passed 100 tests.
  15136. 672.37 s [vector] postscanl: OK
  15137. 672.37 s [vector] +++ OK, passed 100 tests.
  15138. 672.37 s [vector] postscanl': OK
  15139. 672.38 s [vector] +++ OK, passed 100 tests.
  15140. 672.38 s [vector] scanl: OK
  15141. 672.38 s [vector] +++ OK, passed 100 tests.
  15142. 672.38 s [vector] scanl': OK
  15143. 672.38 s [vector] +++ OK, passed 100 tests.
  15144. 672.38 s [vector] scanl1: OK
  15145. 672.38 s [vector] +++ OK, passed 100 tests.
  15146. 672.38 s [vector] scanl1': OK
  15147. 672.38 s [vector] +++ OK, passed 100 tests.
  15148. 672.38 s [vector] iscanl: OK
  15149. 672.39 s [vector] +++ OK, passed 100 tests.
  15150. 672.39 s [vector] iscanl': OK
  15151. 672.39 s [vector] +++ OK, passed 100 tests.
  15152. 672.39 s [vector] prescanr: OK
  15153. 672.39 s [vector] +++ OK, passed 100 tests.
  15154. 672.39 s [vector] prescanr': OK
  15155. 672.40 s [vector] +++ OK, passed 100 tests.
  15156. 672.40 s [vector] postscanr: OK
  15157. 672.40 s [vector] +++ OK, passed 100 tests.
  15158. 672.40 s [vector] postscanr': OK
  15159. 672.40 s [vector] +++ OK, passed 100 tests.
  15160. 672.40 s [vector] scanr: OK
  15161. 672.40 s [vector] +++ OK, passed 100 tests.
  15162. 672.41 s [vector] scanr': OK
  15163. 672.41 s [vector] +++ OK, passed 100 tests.
  15164. 672.41 s [vector] scanr1: OK
  15165. 672.41 s [vector] +++ OK, passed 100 tests.
  15166. 672.41 s [vector] scanr1': OK
  15167. 672.41 s [vector] +++ OK, passed 100 tests.
  15168. 672.42 s [vector] iscanr: OK
  15169. 672.42 s [vector] +++ OK, passed 100 tests.
  15170. 672.42 s [vector] iscanr': OK
  15171. 672.42 s [vector] +++ OK, passed 100 tests.
  15172. 672.42 s [vector] mut_read: OK
  15173. 672.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15174. 672.42 s [vector] mut_write: OK
  15175. 672.42 s [vector] +++ OK, passed 100 tests; 20 discarded.
  15176. 672.42 s [vector] mut_modify: OK
  15177. 672.42 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15178. 672.43 s [vector] mut_generate: OK
  15179. 672.43 s [vector] +++ OK, passed 100 tests.
  15180. 672.44 s [vector] mut_generateM: OK (0.01s)
  15181. 672.44 s [vector] +++ OK, passed 100 tests.
  15182. 672.46 s [vector] mut_mapM_: OK (0.01s)
  15183. 672.46 s [vector] +++ OK, passed 100 tests.
  15184. 672.47 s [vector] mut_imapM_: OK (0.02s)
  15185. 672.47 s [vector] +++ OK, passed 100 tests.
  15186. 672.48 s [vector] mut_forM_: OK (0.01s)
  15187. 672.48 s [vector] +++ OK, passed 100 tests.
  15188. 672.49 s [vector] mut_iforM_: OK (0.02s)
  15189. 672.49 s [vector] +++ OK, passed 100 tests.
  15190. 672.49 s [vector] mut_foldr: OK
  15191. 672.49 s [vector] +++ OK, passed 100 tests.
  15192. 672.49 s [vector] mut_foldr': OK
  15193. 672.49 s [vector] +++ OK, passed 100 tests.
  15194. 672.50 s [vector] mut_foldl: OK
  15195. 672.50 s [vector] +++ OK, passed 100 tests.
  15196. 672.50 s [vector] mut_foldl': OK
  15197. 672.50 s [vector] +++ OK, passed 100 tests.
  15198. 672.50 s [vector] mut_ifoldr: OK
  15199. 672.51 s [vector] +++ OK, passed 100 tests.
  15200. 672.51 s [vector] mut_ifoldr': OK
  15201. 672.51 s [vector] +++ OK, passed 100 tests.
  15202. 672.51 s [vector] mut_ifoldl: OK
  15203. 672.51 s [vector] +++ OK, passed 100 tests.
  15204. 672.51 s [vector] mut_ifoldl': OK
  15205. 672.51 s [vector] +++ OK, passed 100 tests.
  15206. 672.51 s [vector] mut_foldM: OK
  15207. 672.52 s [vector] +++ OK, passed 100 tests.
  15208. 672.52 s [vector] mut_foldM': OK
  15209. 672.52 s [vector] +++ OK, passed 100 tests.
  15210. 672.52 s [vector] mut_foldrM: OK
  15211. 672.52 s [vector] +++ OK, passed 100 tests.
  15212. 672.52 s [vector] mut_foldrM': OK
  15213. 672.52 s [vector] +++ OK, passed 100 tests.
  15214. 672.52 s [vector] mut_ifoldM: OK
  15215. 672.53 s [vector] +++ OK, passed 100 tests.
  15216. 672.53 s [vector] mut_ifoldM': OK
  15217. 672.53 s [vector] +++ OK, passed 100 tests.
  15218. 672.53 s [vector] mut_ifoldrM: OK
  15219. 672.53 s [vector] +++ OK, passed 100 tests.
  15220. 672.53 s [vector] mut_ifoldrM': OK
  15221. 672.53 s [vector] +++ OK, passed 100 tests.
  15222. 672.53 s [vector] compare: OK
  15223. 672.53 s [vector] +++ OK, passed 100 tests.
  15224. 672.53 s [vector] maximum: OK
  15225. 672.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15226. 672.53 s [vector] minimum: OK
  15227. 672.53 s [vector] +++ OK, passed 100 tests; 24 discarded.
  15228. 672.53 s [vector] minIndex: OK
  15229. 672.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15230. 672.53 s [vector] maxIndex: OK
  15231. 672.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15232. 672.53 s [vector] maximumBy: OK
  15233. 672.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15234. 672.54 s [vector] minimumBy: OK
  15235. 672.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15236. 672.54 s [vector] maximumOn: OK
  15237. 672.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15238. 672.54 s [vector] minimumOn: OK
  15239. 672.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15240. 672.54 s [vector] maxIndexBy: OK
  15241. 672.54 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15242. 672.54 s [vector] minIndexBy: OK
  15243. 672.54 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15244. 672.54 s [vector] ListFirstMaxIndexWins: OK
  15245. 672.54 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15246. 672.54 s [vector] FalseListFirstMaxIndexWins: OK
  15247. 672.54 s [vector] +++ OK, failed as expected. (after 1 test):
  15248. 672.54 s [vector] Exception:
  15249. 672.54 s [vector] Prelude.foldr1: empty list
  15250. 672.54 s [vector] CallStack (from HasCallStack):
  15251. 672.54 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15252. 672.54 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15253. 672.54 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15254. 672.54 s [vector] []
  15255. 672.54 s [vector] zip: OK
  15256. 672.54 s [vector] +++ OK, passed 100 tests.
  15257. 672.55 s [vector] zip3: OK
  15258. 672.55 s [vector] +++ OK, passed 100 tests.
  15259. 672.55 s [vector] unzip: OK
  15260. 672.55 s [vector] +++ OK, passed 100 tests.
  15261. 672.55 s [vector] unzip3: OK
  15262. 672.55 s [vector] +++ OK, passed 100 tests.
  15263. 672.55 s [vector] indexed: OK
  15264. 672.55 s [vector] +++ OK, passed 100 tests.
  15265. 672.55 s [vector] update: OK
  15266. 672.55 s [vector] +++ OK, passed 100 tests.
  15267. 672.55 s [vector] mempty: OK
  15268. 672.55 s [vector] +++ OK, passed 100 tests.
  15269. 672.56 s [vector] mappend: OK
  15270. 672.56 s [vector] +++ OK, passed 100 tests.
  15271. 672.56 s [vector] mconcat: OK (0.02s)
  15272. 672.56 s [vector] +++ OK, passed 100 tests.
  15273. 672.57 s [vector] glength: OK
  15274. 672.57 s [vector] +++ OK, passed 100 tests.
  15275. 672.57 s [vector] sum: OK
  15276. 672.57 s [vector] +++ OK, passed 100 tests.
  15277. 672.57 s [vector] product: OK
  15278. 672.57 s [vector] +++ OK, passed 100 tests.
  15279. 672.57 s [vector] enumFromN: OK
  15280. 672.57 s [vector] +++ OK, passed 100 tests.
  15281. 672.57 s [vector] enumFromThenN: OK
  15282. 672.57 s [vector] +++ OK, passed 100 tests.
  15283. 672.57 s [vector] enumFromTo: OK
  15284. 672.57 s [vector] +++ OK, passed 100 tests.
  15285. 672.57 s [vector] enumFromThenTo: OK
  15286. 672.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15287. 672.57 s [vector] (Float)
  15288. 672.57 s [vector] fromList.toList == id: OK
  15289. 672.57 s [vector] +++ OK, passed 100 tests.
  15290. 672.57 s [vector] toList.fromList == id: OK
  15291. 672.57 s [vector] +++ OK, passed 100 tests.
  15292. 672.57 s [vector] unstream.stream == id: OK
  15293. 672.57 s [vector] +++ OK, passed 100 tests.
  15294. 672.57 s [vector] stream.unstream == id: OK
  15295. 672.57 s [vector] +++ OK, passed 100 tests.
  15296. 672.57 s [vector] eq: OK
  15297. 672.57 s [vector] +++ OK, passed 100 tests.
  15298. 672.57 s [vector] length: OK
  15299. 672.57 s [vector] +++ OK, passed 100 tests.
  15300. 672.57 s [vector] null: OK
  15301. 672.57 s [vector] +++ OK, passed 100 tests.
  15302. 672.57 s [vector] index: OK
  15303. 672.57 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15304. 672.57 s [vector] safeIndex: OK
  15305. 672.57 s [vector] +++ OK, passed 100 tests.
  15306. 672.57 s [vector] head: OK
  15307. 672.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15308. 672.57 s [vector] last: OK
  15309. 672.57 s [vector] +++ OK, passed 100 tests; 24 discarded.
  15310. 672.57 s [vector] unsafeIndex: OK
  15311. 672.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15312. 672.58 s [vector] unsafeHead: OK
  15313. 672.58 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15314. 672.58 s [vector] unsafeLast: OK
  15315. 672.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15316. 672.58 s [vector] slice: OK
  15317. 672.58 s [vector] +++ OK, passed 100 tests.
  15318. 672.58 s [vector] init: OK
  15319. 672.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15320. 672.58 s [vector] tail: OK
  15321. 672.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15322. 672.58 s [vector] take: OK
  15323. 672.58 s [vector] +++ OK, passed 100 tests.
  15324. 672.58 s [vector] drop: OK
  15325. 672.58 s [vector] +++ OK, passed 100 tests.
  15326. 672.58 s [vector] splitAt: OK
  15327. 672.58 s [vector] +++ OK, passed 100 tests.
  15328. 672.58 s [vector] empty: OK
  15329. 672.58 s [vector] +++ OK, passed 100 tests.
  15330. 672.58 s [vector] singleton: OK
  15331. 672.58 s [vector] +++ OK, passed 100 tests.
  15332. 672.58 s [vector] replicate: OK
  15333. 672.58 s [vector] +++ OK, passed 100 tests.
  15334. 672.58 s [vector] generate: OK
  15335. 672.58 s [vector] +++ OK, passed 100 tests.
  15336. 672.58 s [vector] iterateN: OK
  15337. 672.60 s [vector] +++ OK, passed 100 tests.
  15338. 672.62 s [vector] iterateNM: OK (0.02s)
  15339. 672.62 s [vector] +++ OK, passed 100 tests.
  15340. 672.66 s [vector] generateM: OK (0.03s)
  15341. 672.66 s [vector] +++ OK, passed 100 tests.
  15342. 672.66 s [vector] replicateM: OK (0.02s)
  15343. 672.66 s [vector] +++ OK, passed 100 tests.
  15344. 672.66 s [vector] create: OK
  15345. 672.66 s [vector] +++ OK, passed 100 tests.
  15346. 672.67 s [vector] createT: OK
  15347. 672.67 s [vector] +++ OK, passed 100 tests.
  15348. 672.67 s [vector] unfoldr: OK
  15349. 672.67 s [vector] +++ OK, passed 100 tests.
  15350. 672.67 s [vector] unfoldrN: OK
  15351. 672.67 s [vector] +++ OK, passed 100 tests.
  15352. 672.67 s [vector] unfoldrExactN: OK
  15353. 672.67 s [vector] +++ OK, passed 100 tests.
  15354. 672.67 s [vector] unfoldrM: OK
  15355. 672.67 s [vector] +++ OK, passed 100 tests.
  15356. 672.67 s [vector] unfoldrNM: OK
  15357. 672.68 s [vector] +++ OK, passed 100 tests.
  15358. 672.70 s [vector] unfoldrExactNM: OK (0.01s)
  15359. 672.70 s [vector] +++ OK, passed 100 tests.
  15360. 672.70 s [vector] constructN: OK
  15361. 672.70 s [vector] +++ OK, passed 100 tests.
  15362. 672.70 s [vector] constructrN: OK
  15363. 672.71 s [vector] +++ OK, passed 100 tests.
  15364. 672.71 s [vector] cons: OK
  15365. 672.71 s [vector] +++ OK, passed 100 tests.
  15366. 672.71 s [vector] snoc: OK
  15367. 672.71 s [vector] +++ OK, passed 100 tests.
  15368. 672.72 s [vector] append: OK
  15369. 672.72 s [vector] +++ OK, passed 100 tests.
  15370. 672.72 s [vector] concat: OK (0.02s)
  15371. 672.72 s [vector] +++ OK, passed 100 tests.
  15372. 672.73 s [vector] force: OK
  15373. 672.73 s [vector] +++ OK, passed 100 tests.
  15374. 672.73 s [vector] upd: OK
  15375. 672.73 s [vector] +++ OK, passed 100 tests.
  15376. 672.73 s [vector] accum: OK
  15377. 672.74 s [vector] +++ OK, passed 100 tests.
  15378. 672.74 s [vector] reverse: OK
  15379. 672.74 s [vector] +++ OK, passed 100 tests.
  15380. 672.74 s [vector] backpermute: OK
  15381. 672.74 s [vector] +++ OK, passed 100 tests.
  15382. 672.74 s [vector] map: OK
  15383. 672.75 s [vector] +++ OK, passed 100 tests.
  15384. 672.75 s [vector] imap: OK
  15385. 672.75 s [vector] +++ OK, passed 100 tests.
  15386. 672.75 s [vector] concatMap: OK
  15387. 672.75 s [vector] +++ OK, passed 100 tests.
  15388. 672.76 s [vector] mapM: OK
  15389. 672.76 s [vector] +++ OK, passed 100 tests.
  15390. 672.79 s [vector] mapM_: OK (0.03s)
  15391. 672.79 s [vector] +++ OK, passed 100 tests.
  15392. 672.79 s [vector] forM: OK
  15393. 672.80 s [vector] +++ OK, passed 100 tests.
  15394. 672.83 s [vector] forM_: OK (0.04s)
  15395. 672.83 s [vector] +++ OK, passed 100 tests.
  15396. 672.84 s [vector] imapM: OK
  15397. 672.84 s [vector] +++ OK, passed 100 tests.
  15398. 672.87 s [vector] imapM_: OK (0.03s)
  15399. 672.87 s [vector] +++ OK, passed 100 tests.
  15400. 672.87 s [vector] zipWith: OK
  15401. 672.88 s [vector] +++ OK, passed 100 tests.
  15402. 672.89 s [vector] zipWith3: OK
  15403. 672.89 s [vector] +++ OK, passed 100 tests.
  15404. 672.90 s [vector] izipWith: OK
  15405. 672.90 s [vector] +++ OK, passed 100 tests.
  15406. 672.90 s [vector] izipWith3: OK
  15407. 672.90 s [vector] +++ OK, passed 100 tests.
  15408. 672.92 s [vector] izipWithM: OK
  15409. 672.92 s [vector] +++ OK, passed 100 tests.
  15410. 672.94 s [vector] izipWithM_: OK (0.03s)
  15411. 672.94 s [vector] +++ OK, passed 100 tests.
  15412. 672.94 s [vector] zipWithM: OK
  15413. 672.94 s [vector] +++ OK, passed 100 tests.
  15414. 672.97 s [vector] zipWithM_: OK (0.03s)
  15415. 672.97 s [vector] +++ OK, passed 100 tests.
  15416. 673.41 s [vector] filter: OK
  15417. 673.41 s [vector] +++ OK, passed 100 tests.
  15418. 673.41 s [vector] ifilter: OK
  15419. 673.41 s [vector] +++ OK, passed 100 tests.
  15420. 673.41 s [vector] filterM: OK (0.06s)
  15421. 673.41 s [vector] +++ OK, passed 100 tests.
  15422. 673.41 s [vector] uniq: OK
  15423. 673.41 s [vector] +++ OK, passed 100 tests.
  15424. 673.41 s [vector] mapMaybe: OK
  15425. 673.41 s [vector] +++ OK, passed 100 tests.
  15426. 673.41 s [vector] imapMaybe: OK
  15427. 673.41 s [vector] +++ OK, passed 100 tests.
  15428. 673.41 s [vector] takeWhile: OK
  15429. 673.41 s [vector] +++ OK, passed 100 tests.
  15430. 673.41 s [vector] dropWhile: OK
  15431. 673.41 s [vector] +++ OK, passed 100 tests.
  15432. 673.41 s [vector] partition: OK
  15433. 673.41 s [vector] +++ OK, passed 100 tests.
  15434. 673.41 s [vector] partitionWith: OK
  15435. 673.41 s [vector] +++ OK, passed 100 tests.
  15436. 673.41 s [vector] span: OK
  15437. 673.41 s [vector] +++ OK, passed 100 tests.
  15438. 673.41 s [vector] break: OK
  15439. 673.41 s [vector] +++ OK, passed 100 tests.
  15440. 673.41 s [vector] spanR: OK
  15441. 673.41 s [vector] +++ OK, passed 100 tests.
  15442. 673.41 s [vector] breakR: OK
  15443. 673.41 s [vector] +++ OK, passed 100 tests.
  15444. 673.41 s [vector] groupBy: OK
  15445. 673.41 s [vector] +++ OK, passed 100 tests.
  15446. 673.41 s [vector] elem: OK
  15447. 673.41 s [vector] +++ OK, passed 100 tests.
  15448. 673.41 s [vector] notElem: OK
  15449. 673.41 s [vector] +++ OK, passed 100 tests.
  15450. 673.41 s [vector] find: OK
  15451. 673.41 s [vector] +++ OK, passed 100 tests.
  15452. 673.41 s [vector] findIndex: OK
  15453. 673.41 s [vector] +++ OK, passed 100 tests.
  15454. 673.41 s [vector] findIndexR: OK
  15455. 673.41 s [vector] +++ OK, passed 100 tests.
  15456. 673.41 s [vector] findIndices: OK
  15457. 673.41 s [vector] +++ OK, passed 100 tests.
  15458. 673.41 s [vector] elemIndex: OK
  15459. 673.41 s [vector] +++ OK, passed 100 tests.
  15460. 673.41 s [vector] elemIndices: OK
  15461. 673.41 s [vector] +++ OK, passed 100 tests.
  15462. 673.41 s [vector] foldl: OK
  15463. 673.41 s [vector] +++ OK, passed 100 tests.
  15464. 673.41 s [vector] foldl1: OK
  15465. 673.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15466. 673.41 s [vector] foldl': OK
  15467. 673.41 s [vector] +++ OK, passed 100 tests.
  15468. 673.41 s [vector] foldl1': OK
  15469. 673.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15470. 673.41 s [vector] foldr: OK
  15471. 673.41 s [vector] +++ OK, passed 100 tests.
  15472. 673.41 s [vector] foldr1: OK
  15473. 673.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15474. 673.41 s [vector] foldr': OK
  15475. 673.41 s [vector] +++ OK, passed 100 tests.
  15476. 673.41 s [vector] foldr1': OK
  15477. 673.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15478. 673.41 s [vector] ifoldl: OK
  15479. 673.41 s [vector] +++ OK, passed 100 tests.
  15480. 673.41 s [vector] ifoldl': OK
  15481. 673.41 s [vector] +++ OK, passed 100 tests.
  15482. 673.41 s [vector] ifoldr: OK
  15483. 673.41 s [vector] +++ OK, passed 100 tests.
  15484. 673.41 s [vector] ifoldr': OK
  15485. 673.41 s [vector] +++ OK, passed 100 tests.
  15486. 673.41 s [vector] ifoldM: OK
  15487. 673.41 s [vector] +++ OK, passed 100 tests.
  15488. 673.41 s [vector] ifoldM': OK
  15489. 673.41 s [vector] +++ OK, passed 100 tests.
  15490. 673.41 s [vector] ifoldM_: OK (0.03s)
  15491. 673.41 s [vector] +++ OK, passed 100 tests.
  15492. 673.41 s [vector] ifoldM'_: OK (0.03s)
  15493. 673.41 s [vector] +++ OK, passed 100 tests.
  15494. 673.41 s [vector] all: OK
  15495. 673.41 s [vector] +++ OK, passed 100 tests.
  15496. 673.41 s [vector] any: OK
  15497. 673.41 s [vector] +++ OK, passed 100 tests.
  15498. 673.41 s [vector] prescanl: OK
  15499. 673.41 s [vector] +++ OK, passed 100 tests.
  15500. 673.41 s [vector] prescanl': OK
  15501. 673.41 s [vector] +++ OK, passed 100 tests.
  15502. 673.41 s [vector] postscanl: OK
  15503. 673.41 s [vector] +++ OK, passed 100 tests.
  15504. 673.41 s [vector] postscanl': OK
  15505. 673.41 s [vector] +++ OK, passed 100 tests.
  15506. 673.41 s [vector] scanl: OK
  15507. 673.41 s [vector] +++ OK, passed 100 tests.
  15508. 673.41 s [vector] scanl': OK
  15509. 673.41 s [vector] +++ OK, passed 100 tests.
  15510. 673.41 s [vector] scanl1: OK
  15511. 673.41 s [vector] +++ OK, passed 100 tests.
  15512. 673.41 s [vector] scanl1': OK
  15513. 673.41 s [vector] +++ OK, passed 100 tests.
  15514. 673.41 s [vector] iscanl: OK
  15515. 673.41 s [vector] +++ OK, passed 100 tests.
  15516. 673.41 s [vector] iscanl': OK
  15517. 673.41 s [vector] +++ OK, passed 100 tests.
  15518. 673.41 s [vector] prescanr: OK
  15519. 673.41 s [vector] +++ OK, passed 100 tests.
  15520. 673.41 s [vector] prescanr': OK
  15521. 673.41 s [vector] +++ OK, passed 100 tests.
  15522. 673.41 s [vector] postscanr: OK
  15523. 673.41 s [vector] +++ OK, passed 100 tests.
  15524. 673.41 s [vector] postscanr': OK (0.01s)
  15525. 673.41 s [vector] +++ OK, passed 100 tests.
  15526. 673.41 s [vector] scanr: OK
  15527. 673.41 s [vector] +++ OK, passed 100 tests.
  15528. 673.41 s [vector] scanr': OK
  15529. 673.41 s [vector] +++ OK, passed 100 tests.
  15530. 673.41 s [vector] scanr1: OK
  15531. 673.41 s [vector] +++ OK, passed 100 tests.
  15532. 673.41 s [vector] scanr1': OK
  15533. 673.41 s [vector] +++ OK, passed 100 tests.
  15534. 673.42 s [vector] iscanr: OK (0.01s)
  15535. 673.42 s [vector] +++ OK, passed 100 tests.
  15536. 673.42 s [vector] iscanr': OK (0.01s)
  15537. 673.42 s [vector] +++ OK, passed 100 tests.
  15538. 673.42 s [vector] mut_read: OK
  15539. 673.42 s [vector] +++ OK, passed 100 tests; 10 discarded.
  15540. 673.42 s [vector] mut_write: OK
  15541. 673.42 s [vector] +++ OK, passed 100 tests; 25 discarded.
  15542. 673.42 s [vector] mut_modify: OK
  15543. 673.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15544. 673.44 s [vector] mut_generate: OK
  15545. 673.44 s [vector] +++ OK, passed 100 tests.
  15546. 673.46 s [vector] mut_generateM: OK (0.02s)
  15547. 673.46 s [vector] +++ OK, passed 100 tests.
  15548. 673.48 s [vector] mut_mapM_: OK (0.03s)
  15549. 673.48 s [vector] +++ OK, passed 100 tests.
  15550. 673.52 s [vector] mut_imapM_: OK (0.03s)
  15551. 673.52 s [vector] +++ OK, passed 100 tests.
  15552. 673.56 s [vector] mut_forM_: OK (0.05s)
  15553. 673.56 s [vector] +++ OK, passed 100 tests.
  15554. 673.60 s [vector] mut_iforM_: OK (0.04s)
  15555. 673.60 s [vector] +++ OK, passed 100 tests.
  15556. 673.62 s [vector] mut_foldr: OK (0.02s)
  15557. 673.62 s [vector] +++ OK, passed 100 tests.
  15558. 673.62 s [vector] mut_foldr': OK (0.02s)
  15559. 673.62 s [vector] +++ OK, passed 100 tests.
  15560. 673.64 s [vector] mut_foldl: OK
  15561. 673.64 s [vector] +++ OK, passed 100 tests.
  15562. 673.66 s [vector] mut_foldl': OK (0.02s)
  15563. 673.66 s [vector] +++ OK, passed 100 tests.
  15564. 673.68 s [vector] mut_ifoldr: OK (0.02s)
  15565. 673.68 s [vector] +++ OK, passed 100 tests.
  15566. 673.69 s [vector] mut_ifoldr': OK (0.02s)
  15567. 673.69 s [vector] +++ OK, passed 100 tests.
  15568. 673.70 s [vector] mut_ifoldl: OK (0.01s)
  15569. 673.70 s [vector] +++ OK, passed 100 tests.
  15570. 673.72 s [vector] mut_ifoldl': OK (0.02s)
  15571. 673.72 s [vector] +++ OK, passed 100 tests.
  15572. 673.73 s [vector] mut_foldM: OK (0.01s)
  15573. 673.73 s [vector] +++ OK, passed 100 tests.
  15574. 673.76 s [vector] mut_foldM': OK (0.01s)
  15575. 673.76 s [vector] +++ OK, passed 100 tests.
  15576. 673.78 s [vector] mut_foldrM: OK (0.03s)
  15577. 673.78 s [vector] +++ OK, passed 100 tests.
  15578. 673.80 s [vector] mut_foldrM': OK (0.02s)
  15579. 673.80 s [vector] +++ OK, passed 100 tests.
  15580. 673.82 s [vector] mut_ifoldM: OK (0.02s)
  15581. 673.82 s [vector] +++ OK, passed 100 tests.
  15582. 673.83 s [vector] mut_ifoldM': OK (0.02s)
  15583. 673.83 s [vector] +++ OK, passed 100 tests.
  15584. 673.84 s [vector] mut_ifoldrM: OK (0.01s)
  15585. 673.84 s [vector] +++ OK, passed 100 tests.
  15586. 673.85 s [vector] mut_ifoldrM': OK (0.01s)
  15587. 673.85 s [vector] +++ OK, passed 100 tests.
  15588. 673.86 s [vector] compare: OK
  15589. 673.86 s [vector] +++ OK, passed 100 tests.
  15590. 673.86 s [vector] maximum: OK
  15591. 673.87 s [vector] +++ OK, passed 100 tests; 22 discarded.
  15592. 673.87 s [vector] minimum: OK
  15593. 673.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15594. 673.88 s [vector] minIndex: OK
  15595. 673.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15596. 673.88 s [vector] maxIndex: OK
  15597. 673.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15598. 673.89 s [vector] maximumBy: OK
  15599. 673.89 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15600. 673.90 s [vector] minimumBy: OK
  15601. 673.90 s [vector] +++ OK, passed 100 tests; 11 discarded.
  15602. 673.91 s [vector] maximumOn: OK
  15603. 673.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15604. 673.91 s [vector] minimumOn: OK
  15605. 673.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15606. 673.92 s [vector] maxIndexBy: OK
  15607. 673.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15608. 673.92 s [vector] minIndexBy: OK
  15609. 673.92 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15610. 673.92 s [vector] ListFirstMaxIndexWins: OK
  15611. 673.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15612. 673.92 s [vector] FalseListFirstMaxIndexWins: OK
  15613. 673.92 s [vector] +++ OK, failed as expected. (after 1 test):
  15614. 673.92 s [vector] Exception:
  15615. 673.92 s [vector] Prelude.foldr1: empty list
  15616. 673.93 s [vector] CallStack (from HasCallStack):
  15617. 673.93 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15618. 673.93 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15619. 673.93 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15620. 673.93 s [vector] []
  15621. 673.93 s [vector] zip: OK
  15622. 673.93 s [vector] +++ OK, passed 100 tests.
  15623. 673.93 s [vector] zip3: OK
  15624. 673.93 s [vector] +++ OK, passed 100 tests.
  15625. 673.93 s [vector] unzip: OK
  15626. 673.93 s [vector] +++ OK, passed 100 tests.
  15627. 673.93 s [vector] unzip3: OK
  15628. 673.93 s [vector] +++ OK, passed 100 tests.
  15629. 673.93 s [vector] indexed: OK
  15630. 673.93 s [vector] +++ OK, passed 100 tests.
  15631. 673.93 s [vector] update: OK
  15632. 673.93 s [vector] +++ OK, passed 100 tests.
  15633. 673.93 s [vector] mempty: OK
  15634. 673.93 s [vector] +++ OK, passed 100 tests.
  15635. 673.94 s [vector] mappend: OK
  15636. 673.94 s [vector] +++ OK, passed 100 tests.
  15637. 673.96 s [vector] mconcat: OK (0.02s)
  15638. 673.96 s [vector] +++ OK, passed 100 tests.
  15639. 673.96 s [vector] glength: OK
  15640. 673.96 s [vector] +++ OK, passed 100 tests.
  15641. 673.96 s [vector] sum: OK
  15642. 673.96 s [vector] +++ OK, passed 100 tests.
  15643. 673.96 s [vector] product: OK
  15644. 673.96 s [vector] +++ OK, passed 100 tests.
  15645. 673.96 s [vector] enumFromN: OK
  15646. 673.96 s [vector] +++ OK, passed 100 tests.
  15647. 673.96 s [vector] enumFromThenN: OK
  15648. 673.96 s [vector] +++ OK, passed 100 tests.
  15649. 673.96 s [vector] enumFromTo: OK
  15650. 673.96 s [vector] +++ OK, passed 100 tests.
  15651. 673.96 s [vector] enumFromThenTo: OK
  15652. 673.96 s [vector] +++ OK, passed 100 tests; 6 discarded.
  15653. 673.96 s [vector] (Double)
  15654. 673.96 s [vector] fromList.toList == id: OK
  15655. 673.96 s [vector] +++ OK, passed 100 tests.
  15656. 673.96 s [vector] toList.fromList == id: OK
  15657. 673.96 s [vector] +++ OK, passed 100 tests.
  15658. 673.96 s [vector] unstream.stream == id: OK
  15659. 673.96 s [vector] +++ OK, passed 100 tests.
  15660. 673.97 s [vector] stream.unstream == id: OK
  15661. 673.97 s [vector] +++ OK, passed 100 tests.
  15662. 673.97 s [vector] eq: OK
  15663. 673.97 s [vector] +++ OK, passed 100 tests.
  15664. 673.97 s [vector] length: OK
  15665. 673.97 s [vector] +++ OK, passed 100 tests.
  15666. 673.97 s [vector] null: OK
  15667. 673.97 s [vector] +++ OK, passed 100 tests.
  15668. 673.97 s [vector] index: OK
  15669. 673.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15670. 673.97 s [vector] safeIndex: OK
  15671. 673.97 s [vector] +++ OK, passed 100 tests.
  15672. 673.97 s [vector] head: OK
  15673. 673.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15674. 673.97 s [vector] last: OK
  15675. 673.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15676. 673.97 s [vector] unsafeIndex: OK
  15677. 673.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15678. 673.97 s [vector] unsafeHead: OK
  15679. 673.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15680. 673.97 s [vector] unsafeLast: OK
  15681. 673.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15682. 673.97 s [vector] slice: OK
  15683. 673.97 s [vector] +++ OK, passed 100 tests.
  15684. 673.97 s [vector] init: OK
  15685. 673.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15686. 673.97 s [vector] tail: OK
  15687. 673.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15688. 673.97 s [vector] take: OK
  15689. 673.97 s [vector] +++ OK, passed 100 tests.
  15690. 673.98 s [vector] drop: OK
  15691. 673.98 s [vector] +++ OK, passed 100 tests.
  15692. 673.98 s [vector] splitAt: OK
  15693. 673.98 s [vector] +++ OK, passed 100 tests.
  15694. 673.98 s [vector] empty: OK
  15695. 673.98 s [vector] +++ OK, passed 100 tests.
  15696. 673.98 s [vector] singleton: OK
  15697. 673.98 s [vector] +++ OK, passed 100 tests.
  15698. 673.98 s [vector] replicate: OK
  15699. 673.98 s [vector] +++ OK, passed 100 tests.
  15700. 673.98 s [vector] generate: OK
  15701. 673.98 s [vector] +++ OK, passed 100 tests.
  15702. 673.98 s [vector] iterateN: OK
  15703. 674.00 s [vector] +++ OK, passed 100 tests.
  15704. 674.00 s [vector] iterateNM: OK (0.02s)
  15705. 674.00 s [vector] +++ OK, passed 100 tests.
  15706. 674.06 s [vector] generateM: OK (0.03s)
  15707. 674.06 s [vector] +++ OK, passed 100 tests.
  15708. 674.06 s [vector] replicateM: OK (0.01s)
  15709. 674.06 s [vector] +++ OK, passed 100 tests.
  15710. 674.06 s [vector] create: OK
  15711. 674.06 s [vector] +++ OK, passed 100 tests.
  15712. 674.06 s [vector] createT: OK
  15713. 674.06 s [vector] +++ OK, passed 100 tests.
  15714. 674.06 s [vector] unfoldr: OK
  15715. 674.06 s [vector] +++ OK, passed 100 tests.
  15716. 674.06 s [vector] unfoldrN: OK
  15717. 674.06 s [vector] +++ OK, passed 100 tests.
  15718. 674.06 s [vector] unfoldrExactN: OK
  15719. 674.06 s [vector] +++ OK, passed 100 tests.
  15720. 674.06 s [vector] unfoldrM: OK
  15721. 674.06 s [vector] +++ OK, passed 100 tests.
  15722. 674.08 s [vector] unfoldrNM: OK
  15723. 674.08 s [vector] +++ OK, passed 100 tests.
  15724. 674.08 s [vector] unfoldrExactNM: OK (0.01s)
  15725. 674.08 s [vector] +++ OK, passed 100 tests.
  15726. 674.10 s [vector] constructN: OK (0.01s)
  15727. 674.10 s [vector] +++ OK, passed 100 tests.
  15728. 674.11 s [vector] constructrN: OK (0.02s)
  15729. 674.11 s [vector] +++ OK, passed 100 tests.
  15730. 674.11 s [vector] cons: OK
  15731. 674.11 s [vector] +++ OK, passed 100 tests.
  15732. 674.11 s [vector] snoc: OK
  15733. 674.11 s [vector] +++ OK, passed 100 tests.
  15734. 674.12 s [vector] append: OK
  15735. 674.12 s [vector] +++ OK, passed 100 tests.
  15736. 674.13 s [vector] concat: OK (0.02s)
  15737. 674.13 s [vector] +++ OK, passed 100 tests.
  15738. 674.13 s [vector] force: OK
  15739. 674.14 s [vector] +++ OK, passed 100 tests.
  15740. 674.14 s [vector] upd: OK
  15741. 674.14 s [vector] +++ OK, passed 100 tests.
  15742. 674.16 s [vector] accum: OK (0.02s)
  15743. 674.16 s [vector] +++ OK, passed 100 tests.
  15744. 674.16 s [vector] reverse: OK
  15745. 674.16 s [vector] +++ OK, passed 100 tests.
  15746. 674.16 s [vector] backpermute: OK
  15747. 674.16 s [vector] +++ OK, passed 100 tests.
  15748. 674.17 s [vector] map: OK
  15749. 674.17 s [vector] +++ OK, passed 100 tests.
  15750. 674.17 s [vector] imap: OK
  15751. 674.18 s [vector] +++ OK, passed 100 tests.
  15752. 674.18 s [vector] concatMap: OK
  15753. 674.19 s [vector] +++ OK, passed 100 tests.
  15754. 674.20 s [vector] mapM: OK
  15755. 674.20 s [vector] +++ OK, passed 100 tests.
  15756. 674.23 s [vector] mapM_: OK (0.04s)
  15757. 674.24 s [vector] +++ OK, passed 100 tests.
  15758. 674.24 s [vector] forM: OK
  15759. 674.24 s [vector] +++ OK, passed 100 tests.
  15760. 674.28 s [vector] forM_: OK (0.04s)
  15761. 674.28 s [vector] +++ OK, passed 100 tests.
  15762. 674.29 s [vector] imapM: OK
  15763. 674.29 s [vector] +++ OK, passed 100 tests.
  15764. 674.33 s [vector] imapM_: OK (0.02s)
  15765. 674.33 s [vector] +++ OK, passed 100 tests.
  15766. 674.34 s [vector] zipWith: OK
  15767. 674.34 s [vector] +++ OK, passed 100 tests.
  15768. 674.34 s [vector] zipWith3: OK (0.01s)
  15769. 674.34 s [vector] +++ OK, passed 100 tests.
  15770. 674.36 s [vector] izipWith: OK (0.01s)
  15771. 674.36 s [vector] +++ OK, passed 100 tests.
  15772. 674.37 s [vector] izipWith3: OK (0.01s)
  15773. 674.37 s [vector] +++ OK, passed 100 tests.
  15774. 674.38 s [vector] izipWithM: OK
  15775. 674.38 s [vector] +++ OK, passed 100 tests.
  15776. 674.40 s [vector] izipWithM_: OK (0.03s)
  15777. 674.40 s [vector] +++ OK, passed 100 tests.
  15778. 674.42 s [vector] zipWithM: OK
  15779. 674.42 s [vector] +++ OK, passed 100 tests.
  15780. 674.45 s [vector] zipWithM_: OK (0.02s)
  15781. 674.45 s [vector] +++ OK, passed 100 tests.
  15782. 674.46 s [vector] filter: OK (0.03s)
  15783. 674.46 s [vector] +++ OK, passed 100 tests.
  15784. 674.49 s [vector] ifilter: OK (0.01s)
  15785. 674.49 s [vector] +++ OK, passed 100 tests.
  15786. 674.54 s [vector] filterM: OK (0.06s)
  15787. 674.54 s [vector] +++ OK, passed 100 tests.
  15788. 674.54 s [vector] uniq: OK
  15789. 674.54 s [vector] +++ OK, passed 100 tests.
  15790. 674.55 s [vector] mapMaybe: OK (0.01s)
  15791. 674.55 s [vector] +++ OK, passed 100 tests.
  15792. 674.57 s [vector] imapMaybe: OK (0.01s)
  15793. 674.57 s [vector] +++ OK, passed 100 tests.
  15794. 674.58 s [vector] takeWhile: OK
  15795. 674.58 s [vector] +++ OK, passed 100 tests.
  15796. 674.58 s [vector] dropWhile: OK
  15797. 674.58 s [vector] +++ OK, passed 100 tests.
  15798. 674.59 s [vector] partition: OK
  15799. 674.60 s [vector] +++ OK, passed 100 tests.
  15800. 674.62 s [vector] partitionWith: OK (0.01s)
  15801. 674.62 s [vector] +++ OK, passed 100 tests.
  15802. 674.62 s [vector] span: OK
  15803. 674.62 s [vector] +++ OK, passed 100 tests.
  15804. 674.62 s [vector] break: OK
  15805. 674.63 s [vector] +++ OK, passed 100 tests.
  15806. 674.63 s [vector] spanR: OK
  15807. 674.63 s [vector] +++ OK, passed 100 tests.
  15808. 674.64 s [vector] breakR: OK
  15809. 674.64 s [vector] +++ OK, passed 100 tests.
  15810. 674.66 s [vector] groupBy: OK (0.02s)
  15811. 674.66 s [vector] +++ OK, passed 100 tests.
  15812. 674.67 s [vector] elem: OK (0.01s)
  15813. 674.67 s [vector] +++ OK, passed 100 tests.
  15814. 674.67 s [vector] notElem: OK
  15815. 674.67 s [vector] +++ OK, passed 100 tests.
  15816. 674.67 s [vector] find: OK
  15817. 674.68 s [vector] +++ OK, passed 100 tests.
  15818. 674.68 s [vector] findIndex: OK
  15819. 674.68 s [vector] +++ OK, passed 100 tests.
  15820. 674.68 s [vector] findIndexR: OK
  15821. 674.70 s [vector] +++ OK, passed 100 tests.
  15822. 674.70 s [vector] findIndices: OK (0.01s)
  15823. 674.70 s [vector] +++ OK, passed 100 tests.
  15824. 674.70 s [vector] elemIndex: OK
  15825. 674.70 s [vector] +++ OK, passed 100 tests.
  15826. 674.71 s [vector] elemIndices: OK
  15827. 674.71 s [vector] +++ OK, passed 100 tests.
  15828. 674.72 s [vector] foldl: OK (0.01s)
  15829. 674.72 s [vector] +++ OK, passed 100 tests.
  15830. 674.73 s [vector] foldl1: OK (0.01s)
  15831. 674.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  15832. 674.73 s [vector] foldl': OK (0.01s)
  15833. 674.73 s [vector] +++ OK, passed 100 tests.
  15834. 674.76 s [vector] foldl1': OK (0.01s)
  15835. 674.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  15836. 674.77 s [vector] foldr: OK (0.01s)
  15837. 674.78 s [vector] +++ OK, passed 100 tests.
  15838. 674.78 s [vector] foldr1: OK (0.01s)
  15839. 674.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15840. 674.80 s [vector] foldr': OK (0.01s)
  15841. 674.80 s [vector] +++ OK, passed 100 tests.
  15842. 674.80 s [vector] foldr1': OK (0.01s)
  15843. 674.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15844. 674.82 s [vector] ifoldl: OK (0.01s)
  15845. 674.82 s [vector] +++ OK, passed 100 tests.
  15846. 674.84 s [vector] ifoldl': OK (0.01s)
  15847. 674.84 s [vector] +++ OK, passed 100 tests.
  15848. 674.85 s [vector] ifoldr: OK (0.01s)
  15849. 674.85 s [vector] +++ OK, passed 100 tests.
  15850. 674.86 s [vector] ifoldr': OK (0.01s)
  15851. 674.86 s [vector] +++ OK, passed 100 tests.
  15852. 674.88 s [vector] ifoldM: OK (0.01s)
  15853. 674.88 s [vector] +++ OK, passed 100 tests.
  15854. 674.90 s [vector] ifoldM': OK (0.02s)
  15855. 674.90 s [vector] +++ OK, passed 100 tests.
  15856. 674.92 s [vector] ifoldM_: OK (0.03s)
  15857. 674.92 s [vector] +++ OK, passed 100 tests.
  15858. 674.96 s [vector] ifoldM'_: OK (0.03s)
  15859. 674.96 s [vector] +++ OK, passed 100 tests.
  15860. 674.96 s [vector] all: OK
  15861. 674.96 s [vector] +++ OK, passed 100 tests.
  15862. 674.96 s [vector] any: OK
  15863. 674.96 s [vector] +++ OK, passed 100 tests.
  15864. 674.96 s [vector] prescanl: OK
  15865. 674.96 s [vector] +++ OK, passed 100 tests.
  15866. 674.97 s [vector] prescanl': OK
  15867. 674.98 s [vector] +++ OK, passed 100 tests.
  15868. 675.00 s [vector] postscanl: OK (0.01s)
  15869. 675.00 s [vector] +++ OK, passed 100 tests.
  15870. 675.01 s [vector] postscanl': OK (0.01s)
  15871. 675.01 s [vector] +++ OK, passed 100 tests.
  15872. 675.02 s [vector] scanl: OK (0.01s)
  15873. 675.02 s [vector] +++ OK, passed 100 tests.
  15874. 675.04 s [vector] scanl': OK (0.01s)
  15875. 675.04 s [vector] +++ OK, passed 100 tests.
  15876. 675.04 s [vector] scanl1: OK (0.01s)
  15877. 675.04 s [vector] +++ OK, passed 100 tests.
  15878. 675.06 s [vector] scanl1': OK
  15879. 675.06 s [vector] +++ OK, passed 100 tests.
  15880. 675.08 s [vector] iscanl: OK (0.01s)
  15881. 675.08 s [vector] +++ OK, passed 100 tests.
  15882. 675.10 s [vector] iscanl': OK (0.02s)
  15883. 675.10 s [vector] +++ OK, passed 100 tests.
  15884. 675.10 s [vector] prescanr: OK (0.02s)
  15885. 675.10 s [vector] +++ OK, passed 100 tests.
  15886. 675.11 s [vector] prescanr': OK (0.01s)
  15887. 675.11 s [vector] +++ OK, passed 100 tests.
  15888. 675.12 s [vector] postscanr: OK
  15889. 675.13 s [vector] +++ OK, passed 100 tests.
  15890. 675.14 s [vector] postscanr': OK (0.01s)
  15891. 675.14 s [vector] +++ OK, passed 100 tests.
  15892. 675.15 s [vector] scanr: OK (0.01s)
  15893. 675.15 s [vector] +++ OK, passed 100 tests.
  15894. 675.16 s [vector] scanr': OK (0.01s)
  15895. 675.16 s [vector] +++ OK, passed 100 tests.
  15896. 675.18 s [vector] scanr1: OK (0.01s)
  15897. 675.18 s [vector] +++ OK, passed 100 tests.
  15898. 675.20 s [vector] scanr1': OK (0.01s)
  15899. 675.20 s [vector] +++ OK, passed 100 tests.
  15900. 675.21 s [vector] iscanr: OK (0.02s)
  15901. 675.21 s [vector] +++ OK, passed 100 tests.
  15902. 675.21 s [vector] iscanr': OK (0.02s)
  15903. 675.21 s [vector] +++ OK, passed 100 tests.
  15904. 675.21 s [vector] mut_read: OK
  15905. 675.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15906. 675.22 s [vector] mut_write: OK
  15907. 675.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  15908. 675.22 s [vector] mut_modify: OK
  15909. 675.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15910. 675.23 s [vector] mut_generate: OK
  15911. 675.23 s [vector] +++ OK, passed 100 tests.
  15912. 675.23 s [vector] mut_generateM: OK (0.01s)
  15913. 675.23 s [vector] +++ OK, passed 100 tests.
  15914. 675.28 s [vector] mut_mapM_: OK (0.04s)
  15915. 675.28 s [vector] +++ OK, passed 100 tests.
  15916. 675.32 s [vector] mut_imapM_: OK (0.02s)
  15917. 675.32 s [vector] +++ OK, passed 100 tests.
  15918. 675.36 s [vector] mut_forM_: OK (0.03s)
  15919. 675.36 s [vector] +++ OK, passed 100 tests.
  15920. 675.38 s [vector] mut_iforM_: OK (0.03s)
  15921. 675.38 s [vector] +++ OK, passed 100 tests.
  15922. 675.39 s [vector] mut_foldr: OK (0.01s)
  15923. 675.39 s [vector] +++ OK, passed 100 tests.
  15924. 675.40 s [vector] mut_foldr': OK
  15925. 675.41 s [vector] +++ OK, passed 100 tests.
  15926. 675.42 s [vector] mut_foldl: OK (0.01s)
  15927. 675.42 s [vector] +++ OK, passed 100 tests.
  15928. 675.44 s [vector] mut_foldl': OK (0.01s)
  15929. 675.44 s [vector] +++ OK, passed 100 tests.
  15930. 675.44 s [vector] mut_ifoldr: OK (0.01s)
  15931. 675.44 s [vector] +++ OK, passed 100 tests.
  15932. 675.46 s [vector] mut_ifoldr': OK (0.01s)
  15933. 675.46 s [vector] +++ OK, passed 100 tests.
  15934. 675.46 s [vector] mut_ifoldl: OK (0.01s)
  15935. 675.46 s [vector] +++ OK, passed 100 tests.
  15936. 675.48 s [vector] mut_ifoldl': OK
  15937. 675.48 s [vector] +++ OK, passed 100 tests.
  15938. 675.49 s [vector] mut_foldM: OK (0.01s)
  15939. 675.49 s [vector] +++ OK, passed 100 tests.
  15940. 675.50 s [vector] mut_foldM': OK (0.01s)
  15941. 675.50 s [vector] +++ OK, passed 100 tests.
  15942. 675.52 s [vector] mut_foldrM: OK (0.01s)
  15943. 675.52 s [vector] +++ OK, passed 100 tests.
  15944. 675.52 s [vector] mut_foldrM': OK (0.01s)
  15945. 675.52 s [vector] +++ OK, passed 100 tests.
  15946. 675.54 s [vector] mut_ifoldM: OK (0.01s)
  15947. 675.54 s [vector] +++ OK, passed 100 tests.
  15948. 675.55 s [vector] mut_ifoldM': OK (0.01s)
  15949. 675.55 s [vector] +++ OK, passed 100 tests.
  15950. 675.56 s [vector] mut_ifoldrM: OK (0.01s)
  15951. 675.56 s [vector] +++ OK, passed 100 tests.
  15952. 675.56 s [vector] mut_ifoldrM': OK (0.01s)
  15953. 675.57 s [vector] +++ OK, passed 100 tests.
  15954. 675.57 s [vector] compare: OK
  15955. 675.57 s [vector] +++ OK, passed 100 tests.
  15956. 675.57 s [vector] maximum: OK
  15957. 675.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15958. 675.57 s [vector] minimum: OK
  15959. 675.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  15960. 675.57 s [vector] minIndex: OK
  15961. 675.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  15962. 675.57 s [vector] maxIndex: OK
  15963. 675.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15964. 675.57 s [vector] maximumBy: OK
  15965. 675.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15966. 675.57 s [vector] minimumBy: OK
  15967. 675.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15968. 675.57 s [vector] maximumOn: OK
  15969. 675.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  15970. 675.57 s [vector] minimumOn: OK
  15971. 675.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15972. 675.57 s [vector] maxIndexBy: OK
  15973. 675.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  15974. 675.57 s [vector] minIndexBy: OK
  15975. 675.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15976. 675.58 s [vector] ListFirstMaxIndexWins: OK
  15977. 675.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  15978. 675.58 s [vector] FalseListFirstMaxIndexWins: OK
  15979. 675.58 s [vector] +++ OK, failed as expected. (after 1 test):
  15980. 675.58 s [vector] Exception:
  15981. 675.58 s [vector] Prelude.foldr1: empty list
  15982. 675.58 s [vector] CallStack (from HasCallStack):
  15983. 675.58 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  15984. 675.58 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  15985. 675.58 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  15986. 675.58 s [vector] []
  15987. 675.58 s [vector] zip: OK
  15988. 675.58 s [vector] +++ OK, passed 100 tests.
  15989. 675.58 s [vector] zip3: OK
  15990. 675.58 s [vector] +++ OK, passed 100 tests.
  15991. 675.58 s [vector] unzip: OK
  15992. 675.58 s [vector] +++ OK, passed 100 tests.
  15993. 675.58 s [vector] unzip3: OK
  15994. 675.58 s [vector] +++ OK, passed 100 tests.
  15995. 675.59 s [vector] indexed: OK
  15996. 675.59 s [vector] +++ OK, passed 100 tests.
  15997. 675.59 s [vector] update: OK
  15998. 675.59 s [vector] +++ OK, passed 100 tests.
  15999. 675.59 s [vector] mempty: OK
  16000. 675.59 s [vector] +++ OK, passed 100 tests.
  16001. 675.60 s [vector] mappend: OK
  16002. 675.60 s [vector] +++ OK, passed 100 tests.
  16003. 675.63 s [vector] mconcat: OK (0.04s)
  16004. 675.63 s [vector] +++ OK, passed 100 tests.
  16005. 675.63 s [vector] glength: OK
  16006. 675.63 s [vector] +++ OK, passed 100 tests.
  16007. 675.63 s [vector] sum: OK
  16008. 675.63 s [vector] +++ OK, passed 100 tests.
  16009. 675.63 s [vector] product: OK
  16010. 675.63 s [vector] +++ OK, passed 100 tests.
  16011. 675.63 s [vector] enumFromN: OK
  16012. 675.63 s [vector] +++ OK, passed 100 tests.
  16013. 675.63 s [vector] enumFromThenN: OK
  16014. 675.63 s [vector] +++ OK, passed 100 tests.
  16015. 675.63 s [vector] enumFromTo: OK
  16016. 675.63 s [vector] +++ OK, passed 100 tests.
  16017. 675.63 s [vector] enumFromThenTo: OK
  16018. 675.64 s [vector] +++ OK, passed 100 tests; 6 discarded.
  16019. 675.64 s [vector] (Int,Bool)
  16020. 675.64 s [vector] fromList.toList == id: OK
  16021. 675.64 s [vector] +++ OK, passed 100 tests.
  16022. 675.64 s [vector] toList.fromList == id: OK
  16023. 675.64 s [vector] +++ OK, passed 100 tests.
  16024. 675.64 s [vector] unstream.stream == id: OK
  16025. 675.64 s [vector] +++ OK, passed 100 tests.
  16026. 675.64 s [vector] stream.unstream == id: OK
  16027. 675.64 s [vector] +++ OK, passed 100 tests.
  16028. 675.64 s [vector] eq: OK
  16029. 675.64 s [vector] +++ OK, passed 100 tests.
  16030. 675.64 s [vector] length: OK
  16031. 675.64 s [vector] +++ OK, passed 100 tests.
  16032. 675.64 s [vector] null: OK
  16033. 675.64 s [vector] +++ OK, passed 100 tests.
  16034. 675.64 s [vector] index: OK
  16035. 675.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16036. 675.64 s [vector] safeIndex: OK
  16037. 675.64 s [vector] +++ OK, passed 100 tests.
  16038. 675.64 s [vector] head: OK
  16039. 675.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16040. 675.64 s [vector] last: OK
  16041. 675.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16042. 675.64 s [vector] unsafeIndex: OK
  16043. 675.64 s [vector] +++ OK, passed 100 tests; 11 discarded.
  16044. 675.64 s [vector] unsafeHead: OK
  16045. 675.64 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16046. 675.64 s [vector] unsafeLast: OK
  16047. 675.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16048. 675.64 s [vector] slice: OK
  16049. 675.64 s [vector] +++ OK, passed 100 tests.
  16050. 675.65 s [vector] init: OK
  16051. 675.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16052. 675.65 s [vector] tail: OK
  16053. 675.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16054. 675.65 s [vector] take: OK
  16055. 675.65 s [vector] +++ OK, passed 100 tests.
  16056. 675.65 s [vector] drop: OK
  16057. 675.65 s [vector] +++ OK, passed 100 tests.
  16058. 675.65 s [vector] splitAt: OK
  16059. 675.65 s [vector] +++ OK, passed 100 tests.
  16060. 675.65 s [vector] empty: OK
  16061. 675.65 s [vector] +++ OK, passed 100 tests.
  16062. 675.65 s [vector] singleton: OK
  16063. 675.65 s [vector] +++ OK, passed 100 tests.
  16064. 675.65 s [vector] replicate: OK
  16065. 675.65 s [vector] +++ OK, passed 100 tests.
  16066. 675.65 s [vector] generate: OK
  16067. 675.65 s [vector] +++ OK, passed 100 tests.
  16068. 675.66 s [vector] iterateN: OK
  16069. 675.66 s [vector] +++ OK, passed 100 tests.
  16070. 675.68 s [vector] iterateNM: OK (0.02s)
  16071. 675.68 s [vector] +++ OK, passed 100 tests.
  16072. 675.71 s [vector] generateM: OK (0.03s)
  16073. 675.71 s [vector] +++ OK, passed 100 tests.
  16074. 675.71 s [vector] replicateM: OK (0.01s)
  16075. 675.71 s [vector] +++ OK, passed 100 tests.
  16076. 675.71 s [vector] create: OK
  16077. 675.71 s [vector] +++ OK, passed 100 tests.
  16078. 675.72 s [vector] createT: OK
  16079. 675.72 s [vector] +++ OK, passed 100 tests.
  16080. 675.72 s [vector] unfoldr: OK
  16081. 675.72 s [vector] +++ OK, passed 100 tests.
  16082. 675.72 s [vector] unfoldrN: OK
  16083. 675.72 s [vector] +++ OK, passed 100 tests.
  16084. 675.72 s [vector] unfoldrExactN: OK
  16085. 675.72 s [vector] +++ OK, passed 100 tests.
  16086. 675.72 s [vector] unfoldrM: OK
  16087. 675.72 s [vector] +++ OK, passed 100 tests.
  16088. 675.74 s [vector] unfoldrNM: OK
  16089. 675.74 s [vector] +++ OK, passed 100 tests.
  16090. 675.75 s [vector] unfoldrExactNM: OK (0.02s)
  16091. 675.75 s [vector] +++ OK, passed 100 tests.
  16092. 675.75 s [vector] constructN: OK
  16093. 675.76 s [vector] +++ OK, passed 100 tests.
  16094. 675.76 s [vector] constructrN: OK
  16095. 675.76 s [vector] +++ OK, passed 100 tests.
  16096. 675.76 s [vector] cons: OK
  16097. 675.76 s [vector] +++ OK, passed 100 tests.
  16098. 675.76 s [vector] snoc: OK
  16099. 675.76 s [vector] +++ OK, passed 100 tests.
  16100. 675.76 s [vector] append: OK
  16101. 675.78 s [vector] +++ OK, passed 100 tests.
  16102. 675.80 s [vector] concat: OK (0.03s)
  16103. 675.80 s [vector] +++ OK, passed 100 tests.
  16104. 675.80 s [vector] force: OK
  16105. 675.80 s [vector] +++ OK, passed 100 tests.
  16106. 675.80 s [vector] upd: OK
  16107. 675.80 s [vector] +++ OK, passed 100 tests.
  16108. 675.80 s [vector] accum: OK
  16109. 675.80 s [vector] +++ OK, passed 100 tests.
  16110. 675.81 s [vector] reverse: OK
  16111. 675.81 s [vector] +++ OK, passed 100 tests.
  16112. 675.81 s [vector] backpermute: OK
  16113. 675.81 s [vector] +++ OK, passed 100 tests.
  16114. 675.81 s [vector] map: OK
  16115. 675.81 s [vector] +++ OK, passed 100 tests.
  16116. 675.82 s [vector] imap: OK
  16117. 675.82 s [vector] +++ OK, passed 100 tests.
  16118. 675.82 s [vector] concatMap: OK
  16119. 675.82 s [vector] +++ OK, passed 100 tests.
  16120. 675.84 s [vector] mapM: OK
  16121. 675.84 s [vector] +++ OK, passed 100 tests.
  16122. 675.85 s [vector] mapM_: OK (0.02s)
  16123. 675.85 s [vector] +++ OK, passed 100 tests.
  16124. 675.85 s [vector] forM: OK
  16125. 675.86 s [vector] +++ OK, passed 100 tests.
  16126. 675.88 s [vector] forM_: OK (0.02s)
  16127. 675.88 s [vector] +++ OK, passed 100 tests.
  16128. 675.88 s [vector] imapM: OK
  16129. 675.88 s [vector] +++ OK, passed 100 tests.
  16130. 675.90 s [vector] imapM_: OK
  16131. 675.91 s [vector] +++ OK, passed 100 tests.
  16132. 675.91 s [vector] zipWith: OK
  16133. 675.91 s [vector] +++ OK, passed 100 tests.
  16134. 675.92 s [vector] zipWith3: OK
  16135. 675.92 s [vector] +++ OK, passed 100 tests.
  16136. 675.92 s [vector] izipWith: OK
  16137. 675.92 s [vector] +++ OK, passed 100 tests.
  16138. 675.93 s [vector] izipWith3: OK
  16139. 675.93 s [vector] +++ OK, passed 100 tests.
  16140. 675.93 s [vector] izipWithM: OK
  16141. 675.93 s [vector] +++ OK, passed 100 tests.
  16142. 675.95 s [vector] izipWithM_: OK
  16143. 675.95 s [vector] +++ OK, passed 100 tests.
  16144. 675.95 s [vector] zipWithM: OK
  16145. 675.96 s [vector] +++ OK, passed 100 tests.
  16146. 675.97 s [vector] zipWithM_: OK (0.02s)
  16147. 675.97 s [vector] +++ OK, passed 100 tests.
  16148. 675.97 s [vector] filter: OK
  16149. 675.97 s [vector] +++ OK, passed 100 tests.
  16150. 675.97 s [vector] ifilter: OK
  16151. 675.98 s [vector] +++ OK, passed 100 tests.
  16152. 676.00 s [vector] filterM: OK (0.03s)
  16153. 676.00 s [vector] +++ OK, passed 100 tests.
  16154. 676.00 s [vector] uniq: OK
  16155. 676.00 s [vector] +++ OK, passed 100 tests.
  16156. 676.00 s [vector] mapMaybe: OK
  16157. 676.00 s [vector] +++ OK, passed 100 tests.
  16158. 676.00 s [vector] imapMaybe: OK
  16159. 676.00 s [vector] +++ OK, passed 100 tests.
  16160. 676.00 s [vector] takeWhile: OK
  16161. 676.00 s [vector] +++ OK, passed 100 tests.
  16162. 676.01 s [vector] dropWhile: OK
  16163. 676.01 s [vector] +++ OK, passed 100 tests.
  16164. 676.01 s [vector] partition: OK
  16165. 676.01 s [vector] +++ OK, passed 100 tests.
  16166. 676.01 s [vector] partitionWith: OK
  16167. 676.01 s [vector] +++ OK, passed 100 tests.
  16168. 676.01 s [vector] span: OK
  16169. 676.02 s [vector] +++ OK, passed 100 tests.
  16170. 676.02 s [vector] break: OK
  16171. 676.02 s [vector] +++ OK, passed 100 tests.
  16172. 676.02 s [vector] spanR: OK
  16173. 676.02 s [vector] +++ OK, passed 100 tests.
  16174. 676.02 s [vector] breakR: OK
  16175. 676.02 s [vector] +++ OK, passed 100 tests.
  16176. 676.03 s [vector] groupBy: OK
  16177. 676.03 s [vector] +++ OK, passed 100 tests.
  16178. 676.03 s [vector] elem: OK
  16179. 676.03 s [vector] +++ OK, passed 100 tests.
  16180. 676.03 s [vector] notElem: OK
  16181. 676.03 s [vector] +++ OK, passed 100 tests.
  16182. 676.03 s [vector] find: OK
  16183. 676.03 s [vector] +++ OK, passed 100 tests.
  16184. 676.03 s [vector] findIndex: OK
  16185. 676.03 s [vector] +++ OK, passed 100 tests.
  16186. 676.03 s [vector] findIndexR: OK
  16187. 676.03 s [vector] +++ OK, passed 100 tests.
  16188. 676.04 s [vector] findIndices: OK
  16189. 676.04 s [vector] +++ OK, passed 100 tests.
  16190. 676.04 s [vector] elemIndex: OK
  16191. 676.04 s [vector] +++ OK, passed 100 tests.
  16192. 676.04 s [vector] elemIndices: OK
  16193. 676.04 s [vector] +++ OK, passed 100 tests.
  16194. 676.04 s [vector] foldl: OK
  16195. 676.04 s [vector] +++ OK, passed 100 tests.
  16196. 676.05 s [vector] foldl1: OK
  16197. 676.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16198. 676.05 s [vector] foldl': OK
  16199. 676.05 s [vector] +++ OK, passed 100 tests.
  16200. 676.05 s [vector] foldl1': OK
  16201. 676.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16202. 676.05 s [vector] foldr: OK
  16203. 676.06 s [vector] +++ OK, passed 100 tests.
  16204. 676.06 s [vector] foldr1: OK
  16205. 676.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16206. 676.06 s [vector] foldr': OK
  16207. 676.07 s [vector] +++ OK, passed 100 tests.
  16208. 676.07 s [vector] foldr1': OK
  16209. 676.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16210. 676.08 s [vector] ifoldl: OK
  16211. 676.08 s [vector] +++ OK, passed 100 tests.
  16212. 676.08 s [vector] ifoldl': OK
  16213. 676.08 s [vector] +++ OK, passed 100 tests.
  16214. 676.09 s [vector] ifoldr: OK
  16215. 676.09 s [vector] +++ OK, passed 100 tests.
  16216. 676.09 s [vector] ifoldr': OK
  16217. 676.09 s [vector] +++ OK, passed 100 tests.
  16218. 676.09 s [vector] ifoldM: OK
  16219. 676.09 s [vector] +++ OK, passed 100 tests.
  16220. 676.10 s [vector] ifoldM': OK
  16221. 676.10 s [vector] +++ OK, passed 100 tests.
  16222. 676.14 s [vector] ifoldM_: OK (0.03s)
  16223. 676.14 s [vector] +++ OK, passed 100 tests.
  16224. 676.14 s [vector] ifoldM'_: OK (0.02s)
  16225. 676.14 s [vector] +++ OK, passed 100 tests.
  16226. 676.14 s [vector] all: OK
  16227. 676.14 s [vector] +++ OK, passed 100 tests.
  16228. 676.14 s [vector] any: OK
  16229. 676.15 s [vector] +++ OK, passed 100 tests.
  16230. 676.15 s [vector] prescanl: OK
  16231. 676.15 s [vector] +++ OK, passed 100 tests.
  16232. 676.16 s [vector] prescanl': OK
  16233. 676.16 s [vector] +++ OK, passed 100 tests.
  16234. 676.16 s [vector] postscanl: OK
  16235. 676.16 s [vector] +++ OK, passed 100 tests.
  16236. 676.16 s [vector] postscanl': OK
  16237. 676.17 s [vector] +++ OK, passed 100 tests.
  16238. 676.17 s [vector] scanl: OK
  16239. 676.17 s [vector] +++ OK, passed 100 tests.
  16240. 676.17 s [vector] scanl': OK
  16241. 676.17 s [vector] +++ OK, passed 100 tests.
  16242. 676.18 s [vector] scanl1: OK
  16243. 676.18 s [vector] +++ OK, passed 100 tests.
  16244. 676.19 s [vector] scanl1': OK (0.01s)
  16245. 676.19 s [vector] +++ OK, passed 100 tests.
  16246. 676.20 s [vector] iscanl: OK
  16247. 676.20 s [vector] +++ OK, passed 100 tests.
  16248. 676.20 s [vector] iscanl': OK
  16249. 676.20 s [vector] +++ OK, passed 100 tests.
  16250. 676.20 s [vector] prescanr: OK
  16251. 676.21 s [vector] +++ OK, passed 100 tests.
  16252. 676.21 s [vector] prescanr': OK
  16253. 676.21 s [vector] +++ OK, passed 100 tests.
  16254. 676.21 s [vector] postscanr: OK
  16255. 676.22 s [vector] +++ OK, passed 100 tests.
  16256. 676.22 s [vector] postscanr': OK
  16257. 676.22 s [vector] +++ OK, passed 100 tests.
  16258. 676.22 s [vector] scanr: OK
  16259. 676.22 s [vector] +++ OK, passed 100 tests.
  16260. 676.22 s [vector] scanr': OK
  16261. 676.22 s [vector] +++ OK, passed 100 tests.
  16262. 676.23 s [vector] scanr1: OK
  16263. 676.23 s [vector] +++ OK, passed 100 tests.
  16264. 676.24 s [vector] scanr1': OK
  16265. 676.24 s [vector] +++ OK, passed 100 tests.
  16266. 676.24 s [vector] iscanr: OK
  16267. 676.24 s [vector] +++ OK, passed 100 tests.
  16268. 676.24 s [vector] iscanr': OK
  16269. 676.24 s [vector] +++ OK, passed 100 tests.
  16270. 676.24 s [vector] mut_read: OK
  16271. 676.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16272. 676.25 s [vector] mut_write: OK
  16273. 676.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16274. 676.25 s [vector] mut_modify: OK
  16275. 676.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16276. 676.25 s [vector] mut_generate: OK
  16277. 676.26 s [vector] +++ OK, passed 100 tests.
  16278. 676.26 s [vector] mut_generateM: OK (0.01s)
  16279. 676.26 s [vector] +++ OK, passed 100 tests.
  16280. 676.28 s [vector] mut_mapM_: OK
  16281. 676.28 s [vector] +++ OK, passed 100 tests.
  16282. 676.31 s [vector] mut_imapM_: OK
  16283. 676.32 s [vector] +++ OK, passed 100 tests.
  16284. 676.34 s [vector] mut_forM_: OK (0.03s)
  16285. 676.34 s [vector] +++ OK, passed 100 tests.
  16286. 676.36 s [vector] mut_iforM_: OK (0.03s)
  16287. 676.37 s [vector] +++ OK, passed 100 tests.
  16288. 676.37 s [vector] mut_foldr: OK
  16289. 676.37 s [vector] +++ OK, passed 100 tests.
  16290. 676.37 s [vector] mut_foldr': OK
  16291. 676.37 s [vector] +++ OK, passed 100 tests.
  16292. 676.38 s [vector] mut_foldl: OK
  16293. 676.38 s [vector] +++ OK, passed 100 tests.
  16294. 676.38 s [vector] mut_foldl': OK
  16295. 676.38 s [vector] +++ OK, passed 100 tests.
  16296. 676.38 s [vector] mut_ifoldr: OK
  16297. 676.39 s [vector] +++ OK, passed 100 tests.
  16298. 676.39 s [vector] mut_ifoldr': OK
  16299. 676.39 s [vector] +++ OK, passed 100 tests.
  16300. 676.39 s [vector] mut_ifoldl: OK
  16301. 676.39 s [vector] +++ OK, passed 100 tests.
  16302. 676.40 s [vector] mut_ifoldl': OK
  16303. 676.40 s [vector] +++ OK, passed 100 tests.
  16304. 676.40 s [vector] mut_foldM: OK
  16305. 676.40 s [vector] +++ OK, passed 100 tests.
  16306. 676.40 s [vector] mut_foldM': OK
  16307. 676.40 s [vector] +++ OK, passed 100 tests.
  16308. 676.40 s [vector] mut_foldrM: OK
  16309. 676.41 s [vector] +++ OK, passed 100 tests.
  16310. 676.41 s [vector] mut_foldrM': OK
  16311. 676.41 s [vector] +++ OK, passed 100 tests.
  16312. 676.41 s [vector] mut_ifoldM: OK
  16313. 676.41 s [vector] +++ OK, passed 100 tests.
  16314. 676.41 s [vector] mut_ifoldM': OK
  16315. 676.42 s [vector] +++ OK, passed 100 tests.
  16316. 676.42 s [vector] mut_ifoldrM: OK
  16317. 676.42 s [vector] +++ OK, passed 100 tests.
  16318. 676.42 s [vector] mut_ifoldrM': OK
  16319. 676.42 s [vector] +++ OK, passed 100 tests.
  16320. 676.42 s [vector] compare: OK
  16321. 676.42 s [vector] +++ OK, passed 100 tests.
  16322. 676.42 s [vector] maximum: OK
  16323. 676.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16324. 676.42 s [vector] minimum: OK
  16325. 676.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16326. 676.42 s [vector] minIndex: OK
  16327. 676.42 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16328. 676.42 s [vector] maxIndex: OK
  16329. 676.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16330. 676.42 s [vector] maximumBy: OK
  16331. 676.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16332. 676.43 s [vector] minimumBy: OK
  16333. 676.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16334. 676.43 s [vector] maximumOn: OK
  16335. 676.43 s [vector] +++ OK, passed 100 tests; 12 discarded.
  16336. 676.43 s [vector] minimumOn: OK
  16337. 676.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16338. 676.43 s [vector] maxIndexBy: OK
  16339. 676.43 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16340. 676.43 s [vector] minIndexBy: OK
  16341. 676.43 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16342. 676.43 s [vector] ListFirstMaxIndexWins: OK
  16343. 676.43 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16344. 676.43 s [vector] FalseListFirstMaxIndexWins: OK
  16345. 676.43 s [vector] +++ OK, failed as expected. (after 1 test):
  16346. 676.43 s [vector] Exception:
  16347. 676.43 s [vector] Prelude.foldr1: empty list
  16348. 676.43 s [vector] CallStack (from HasCallStack):
  16349. 676.43 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16350. 676.43 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16351. 676.43 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16352. 676.43 s [vector] []
  16353. 676.43 s [vector] zip: OK
  16354. 676.44 s [vector] +++ OK, passed 100 tests.
  16355. 676.44 s [vector] zip3: OK
  16356. 676.44 s [vector] +++ OK, passed 100 tests.
  16357. 676.44 s [vector] unzip: OK
  16358. 676.44 s [vector] +++ OK, passed 100 tests.
  16359. 676.44 s [vector] unzip3: OK
  16360. 676.44 s [vector] +++ OK, passed 100 tests.
  16361. 676.45 s [vector] indexed: OK
  16362. 676.45 s [vector] +++ OK, passed 100 tests.
  16363. 676.45 s [vector] update: OK
  16364. 676.45 s [vector] +++ OK, passed 100 tests.
  16365. 676.45 s [vector] mempty: OK
  16366. 676.45 s [vector] +++ OK, passed 100 tests.
  16367. 676.46 s [vector] mappend: OK
  16368. 676.46 s [vector] +++ OK, passed 100 tests.
  16369. 676.49 s [vector] mconcat: OK (0.04s)
  16370. 676.49 s [vector] +++ OK, passed 100 tests.
  16371. 676.49 s [vector] glength: OK
  16372. 676.49 s [vector] +++ OK, passed 100 tests.
  16373. 676.49 s [vector] (Int,Bool,Int)
  16374. 676.49 s [vector] fromList.toList == id: OK
  16375. 676.49 s [vector] +++ OK, passed 100 tests.
  16376. 676.49 s [vector] toList.fromList == id: OK
  16377. 676.49 s [vector] +++ OK, passed 100 tests.
  16378. 676.49 s [vector] unstream.stream == id: OK
  16379. 676.49 s [vector] +++ OK, passed 100 tests.
  16380. 676.49 s [vector] stream.unstream == id: OK
  16381. 676.49 s [vector] +++ OK, passed 100 tests.
  16382. 676.49 s [vector] eq: OK
  16383. 676.49 s [vector] +++ OK, passed 100 tests.
  16384. 676.49 s [vector] length: OK
  16385. 676.49 s [vector] +++ OK, passed 100 tests.
  16386. 676.50 s [vector] null: OK
  16387. 676.50 s [vector] +++ OK, passed 100 tests.
  16388. 676.50 s [vector] index: OK
  16389. 676.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16390. 676.50 s [vector] safeIndex: OK
  16391. 676.50 s [vector] +++ OK, passed 100 tests.
  16392. 676.50 s [vector] head: OK
  16393. 676.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16394. 676.50 s [vector] last: OK
  16395. 676.50 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16396. 676.50 s [vector] unsafeIndex: OK
  16397. 676.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16398. 676.50 s [vector] unsafeHead: OK
  16399. 676.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16400. 676.50 s [vector] unsafeLast: OK
  16401. 676.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16402. 676.51 s [vector] slice: OK
  16403. 676.51 s [vector] +++ OK, passed 100 tests.
  16404. 676.51 s [vector] init: OK
  16405. 676.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16406. 676.51 s [vector] tail: OK
  16407. 676.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  16408. 676.51 s [vector] take: OK
  16409. 676.51 s [vector] +++ OK, passed 100 tests.
  16410. 676.51 s [vector] drop: OK
  16411. 676.51 s [vector] +++ OK, passed 100 tests.
  16412. 676.51 s [vector] splitAt: OK
  16413. 676.51 s [vector] +++ OK, passed 100 tests.
  16414. 676.51 s [vector] empty: OK
  16415. 676.51 s [vector] +++ OK, passed 100 tests.
  16416. 676.52 s [vector] singleton: OK
  16417. 676.52 s [vector] +++ OK, passed 100 tests.
  16418. 676.52 s [vector] replicate: OK
  16419. 676.52 s [vector] +++ OK, passed 100 tests.
  16420. 676.52 s [vector] generate: OK
  16421. 676.52 s [vector] +++ OK, passed 100 tests.
  16422. 676.52 s [vector] iterateN: OK
  16423. 676.52 s [vector] +++ OK, passed 100 tests.
  16424. 676.58 s [vector] iterateNM: OK (0.04s)
  16425. 676.58 s [vector] +++ OK, passed 100 tests.
  16426. 676.59 s [vector] generateM: OK (0.02s)
  16427. 676.59 s [vector] +++ OK, passed 100 tests.
  16428. 676.59 s [vector] replicateM: OK
  16429. 676.59 s [vector] +++ OK, passed 100 tests.
  16430. 676.59 s [vector] create: OK
  16431. 676.60 s [vector] +++ OK, passed 100 tests.
  16432. 676.60 s [vector] createT: OK
  16433. 676.60 s [vector] +++ OK, passed 100 tests.
  16434. 676.60 s [vector] unfoldr: OK
  16435. 676.60 s [vector] +++ OK, passed 100 tests.
  16436. 676.60 s [vector] unfoldrN: OK
  16437. 676.60 s [vector] +++ OK, passed 100 tests.
  16438. 676.60 s [vector] unfoldrExactN: OK
  16439. 676.60 s [vector] +++ OK, passed 100 tests.
  16440. 676.60 s [vector] unfoldrM: OK
  16441. 676.60 s [vector] +++ OK, passed 100 tests.
  16442. 676.62 s [vector] unfoldrNM: OK
  16443. 676.62 s [vector] +++ OK, passed 100 tests.
  16444. 676.62 s [vector] unfoldrExactNM: OK (0.02s)
  16445. 676.62 s [vector] +++ OK, passed 100 tests.
  16446. 676.64 s [vector] constructN: OK
  16447. 676.64 s [vector] +++ OK, passed 100 tests.
  16448. 676.64 s [vector] constructrN: OK
  16449. 676.64 s [vector] +++ OK, passed 100 tests.
  16450. 676.64 s [vector] cons: OK
  16451. 676.64 s [vector] +++ OK, passed 100 tests.
  16452. 676.64 s [vector] snoc: OK
  16453. 676.64 s [vector] +++ OK, passed 100 tests.
  16454. 676.66 s [vector] append: OK
  16455. 676.66 s [vector] +++ OK, passed 100 tests.
  16456. 676.71 s [vector] concat: OK (0.06s)
  16457. 676.71 s [vector] +++ OK, passed 100 tests.
  16458. 676.71 s [vector] force: OK
  16459. 676.71 s [vector] +++ OK, passed 100 tests.
  16460. 676.71 s [vector] upd: OK
  16461. 676.72 s [vector] +++ OK, passed 100 tests.
  16462. 676.72 s [vector] accum: OK
  16463. 676.72 s [vector] +++ OK, passed 100 tests.
  16464. 676.72 s [vector] reverse: OK
  16465. 676.73 s [vector] +++ OK, passed 100 tests.
  16466. 676.73 s [vector] backpermute: OK
  16467. 676.73 s [vector] +++ OK, passed 100 tests.
  16468. 676.73 s [vector] map: OK
  16469. 676.73 s [vector] +++ OK, passed 100 tests.
  16470. 676.74 s [vector] imap: OK
  16471. 676.74 s [vector] +++ OK, passed 100 tests.
  16472. 676.75 s [vector] concatMap: OK
  16473. 676.75 s [vector] +++ OK, passed 100 tests.
  16474. 676.75 s [vector] mapM: OK
  16475. 676.76 s [vector] +++ OK, passed 100 tests.
  16476. 676.80 s [vector] mapM_: OK (0.05s)
  16477. 676.80 s [vector] +++ OK, passed 100 tests.
  16478. 676.80 s [vector] forM: OK
  16479. 676.82 s [vector] +++ OK, passed 100 tests.
  16480. 676.87 s [vector] forM_: OK (0.06s)
  16481. 676.87 s [vector] +++ OK, passed 100 tests.
  16482. 676.88 s [vector] imapM: OK
  16483. 676.88 s [vector] +++ OK, passed 100 tests.
  16484. 676.91 s [vector] imapM_: OK (0.04s)
  16485. 676.91 s [vector] +++ OK, passed 100 tests.
  16486. 676.91 s [vector] zipWith: OK
  16487. 676.91 s [vector] +++ OK, passed 100 tests.
  16488. 676.92 s [vector] zipWith3: OK
  16489. 676.92 s [vector] +++ OK, passed 100 tests.
  16490. 676.92 s [vector] izipWith: OK
  16491. 676.93 s [vector] +++ OK, passed 100 tests.
  16492. 676.93 s [vector] izipWith3: OK
  16493. 676.94 s [vector] +++ OK, passed 100 tests.
  16494. 676.94 s [vector] izipWithM: OK
  16495. 676.94 s [vector] +++ OK, passed 100 tests.
  16496. 676.98 s [vector] izipWithM_: OK (0.04s)
  16497. 676.98 s [vector] +++ OK, passed 100 tests.
  16498. 677.00 s [vector] zipWithM: OK
  16499. 677.00 s [vector] +++ OK, passed 100 tests.
  16500. 677.02 s [vector] zipWithM_: OK (0.03s)
  16501. 677.02 s [vector] +++ OK, passed 100 tests.
  16502. 677.03 s [vector] filter: OK
  16503. 677.03 s [vector] +++ OK, passed 100 tests.
  16504. 677.03 s [vector] ifilter: OK
  16505. 677.04 s [vector] +++ OK, passed 100 tests.
  16506. 677.08 s [vector] filterM: OK (0.05s)
  16507. 677.08 s [vector] +++ OK, passed 100 tests.
  16508. 677.08 s [vector] uniq: OK
  16509. 677.08 s [vector] +++ OK, passed 100 tests.
  16510. 677.09 s [vector] mapMaybe: OK
  16511. 677.09 s [vector] +++ OK, passed 100 tests.
  16512. 677.10 s [vector] imapMaybe: OK
  16513. 677.10 s [vector] +++ OK, passed 100 tests.
  16514. 677.10 s [vector] takeWhile: OK
  16515. 677.10 s [vector] +++ OK, passed 100 tests.
  16516. 677.10 s [vector] dropWhile: OK
  16517. 677.10 s [vector] +++ OK, passed 100 tests.
  16518. 677.10 s [vector] partition: OK
  16519. 677.11 s [vector] +++ OK, passed 100 tests.
  16520. 677.11 s [vector] partitionWith: OK
  16521. 677.11 s [vector] +++ OK, passed 100 tests.
  16522. 677.11 s [vector] span: OK
  16523. 677.11 s [vector] +++ OK, passed 100 tests.
  16524. 677.11 s [vector] break: OK
  16525. 677.11 s [vector] +++ OK, passed 100 tests.
  16526. 677.11 s [vector] spanR: OK
  16527. 677.11 s [vector] +++ OK, passed 100 tests.
  16528. 677.12 s [vector] breakR: OK
  16529. 677.12 s [vector] +++ OK, passed 100 tests.
  16530. 677.12 s [vector] groupBy: OK
  16531. 677.12 s [vector] +++ OK, passed 100 tests.
  16532. 677.13 s [vector] elem: OK
  16533. 677.13 s [vector] +++ OK, passed 100 tests.
  16534. 677.13 s [vector] notElem: OK
  16535. 677.13 s [vector] +++ OK, passed 100 tests.
  16536. 677.13 s [vector] find: OK
  16537. 677.13 s [vector] +++ OK, passed 100 tests.
  16538. 677.13 s [vector] findIndex: OK
  16539. 677.13 s [vector] +++ OK, passed 100 tests.
  16540. 677.13 s [vector] findIndexR: OK
  16541. 677.13 s [vector] +++ OK, passed 100 tests.
  16542. 677.14 s [vector] findIndices: OK
  16543. 677.14 s [vector] +++ OK, passed 100 tests.
  16544. 677.14 s [vector] elemIndex: OK
  16545. 677.14 s [vector] +++ OK, passed 100 tests.
  16546. 677.14 s [vector] elemIndices: OK
  16547. 677.14 s [vector] +++ OK, passed 100 tests.
  16548. 677.15 s [vector] foldl: OK
  16549. 677.15 s [vector] +++ OK, passed 100 tests.
  16550. 677.15 s [vector] foldl1: OK
  16551. 677.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16552. 677.16 s [vector] foldl': OK
  16553. 677.16 s [vector] +++ OK, passed 100 tests.
  16554. 677.16 s [vector] foldl1': OK
  16555. 677.16 s [vector] +++ OK, passed 100 tests; 27 discarded.
  16556. 677.16 s [vector] foldr: OK
  16557. 677.17 s [vector] +++ OK, passed 100 tests.
  16558. 677.18 s [vector] foldr1: OK
  16559. 677.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16560. 677.18 s [vector] foldr': OK
  16561. 677.18 s [vector] +++ OK, passed 100 tests.
  16562. 677.19 s [vector] foldr1': OK
  16563. 677.19 s [vector] +++ OK, passed 100 tests; 21 discarded.
  16564. 677.19 s [vector] ifoldl: OK
  16565. 677.19 s [vector] +++ OK, passed 100 tests.
  16566. 677.20 s [vector] ifoldl': OK
  16567. 677.20 s [vector] +++ OK, passed 100 tests.
  16568. 677.20 s [vector] ifoldr: OK
  16569. 677.20 s [vector] +++ OK, passed 100 tests.
  16570. 677.20 s [vector] ifoldr': OK
  16571. 677.21 s [vector] +++ OK, passed 100 tests.
  16572. 677.21 s [vector] ifoldM: OK
  16573. 677.22 s [vector] +++ OK, passed 100 tests.
  16574. 677.24 s [vector] ifoldM': OK
  16575. 677.24 s [vector] +++ OK, passed 100 tests.
  16576. 677.28 s [vector] ifoldM_: OK (0.04s)
  16577. 677.28 s [vector] +++ OK, passed 100 tests.
  16578. 677.30 s [vector] ifoldM'_: OK (0.04s)
  16579. 677.30 s [vector] +++ OK, passed 100 tests.
  16580. 677.31 s [vector] all: OK
  16581. 677.31 s [vector] +++ OK, passed 100 tests.
  16582. 677.31 s [vector] any: OK
  16583. 677.32 s [vector] +++ OK, passed 100 tests.
  16584. 677.32 s [vector] prescanl: OK
  16585. 677.32 s [vector] +++ OK, passed 100 tests.
  16586. 677.32 s [vector] prescanl': OK
  16587. 677.32 s [vector] +++ OK, passed 100 tests.
  16588. 677.34 s [vector] postscanl: OK
  16589. 677.34 s [vector] +++ OK, passed 100 tests.
  16590. 677.34 s [vector] postscanl': OK
  16591. 677.34 s [vector] +++ OK, passed 100 tests.
  16592. 677.36 s [vector] scanl: OK
  16593. 677.36 s [vector] +++ OK, passed 100 tests.
  16594. 677.36 s [vector] scanl': OK
  16595. 677.36 s [vector] +++ OK, passed 100 tests.
  16596. 677.36 s [vector] scanl1: OK
  16597. 677.36 s [vector] +++ OK, passed 100 tests.
  16598. 677.38 s [vector] scanl1': OK
  16599. 677.38 s [vector] +++ OK, passed 100 tests.
  16600. 677.38 s [vector] iscanl: OK
  16601. 677.38 s [vector] +++ OK, passed 100 tests.
  16602. 677.39 s [vector] iscanl': OK
  16603. 677.39 s [vector] +++ OK, passed 100 tests.
  16604. 677.40 s [vector] prescanr: OK
  16605. 677.40 s [vector] +++ OK, passed 100 tests.
  16606. 677.40 s [vector] prescanr': OK
  16607. 677.40 s [vector] +++ OK, passed 100 tests.
  16608. 677.41 s [vector] postscanr: OK
  16609. 677.42 s [vector] +++ OK, passed 100 tests.
  16610. 677.42 s [vector] postscanr': OK
  16611. 677.42 s [vector] +++ OK, passed 100 tests.
  16612. 677.42 s [vector] scanr: OK
  16613. 677.43 s [vector] +++ OK, passed 100 tests.
  16614. 677.43 s [vector] scanr': OK
  16615. 677.44 s [vector] +++ OK, passed 100 tests.
  16616. 677.44 s [vector] scanr1: OK
  16617. 677.44 s [vector] +++ OK, passed 100 tests.
  16618. 677.44 s [vector] scanr1': OK
  16619. 677.44 s [vector] +++ OK, passed 100 tests.
  16620. 677.46 s [vector] iscanr: OK
  16621. 677.46 s [vector] +++ OK, passed 100 tests.
  16622. 677.46 s [vector] iscanr': OK
  16623. 677.46 s [vector] +++ OK, passed 100 tests.
  16624. 677.46 s [vector] mut_read: OK
  16625. 677.46 s [vector] +++ OK, passed 100 tests; 19 discarded.
  16626. 677.46 s [vector] mut_write: OK
  16627. 677.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16628. 677.46 s [vector] mut_modify: OK
  16629. 677.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16630. 677.48 s [vector] mut_generate: OK
  16631. 677.48 s [vector] +++ OK, passed 100 tests.
  16632. 677.49 s [vector] mut_generateM: OK (0.02s)
  16633. 677.49 s [vector] +++ OK, passed 100 tests.
  16634. 677.56 s [vector] mut_mapM_: OK (0.04s)
  16635. 677.56 s [vector] +++ OK, passed 100 tests.
  16636. 677.60 s [vector] mut_imapM_: OK (0.04s)
  16637. 677.60 s [vector] +++ OK, passed 100 tests.
  16638. 677.64 s [vector] mut_forM_: OK (0.04s)
  16639. 677.64 s [vector] +++ OK, passed 100 tests.
  16640. 677.68 s [vector] mut_iforM_: OK (0.04s)
  16641. 677.68 s [vector] +++ OK, passed 100 tests.
  16642. 677.68 s [vector] mut_foldr: OK
  16643. 677.68 s [vector] +++ OK, passed 100 tests.
  16644. 677.68 s [vector] mut_foldr': OK
  16645. 677.68 s [vector] +++ OK, passed 100 tests.
  16646. 677.69 s [vector] mut_foldl: OK
  16647. 677.69 s [vector] +++ OK, passed 100 tests.
  16648. 677.69 s [vector] mut_foldl': OK
  16649. 677.70 s [vector] +++ OK, passed 100 tests.
  16650. 677.71 s [vector] mut_ifoldr: OK
  16651. 677.71 s [vector] +++ OK, passed 100 tests.
  16652. 677.71 s [vector] mut_ifoldr': OK
  16653. 677.71 s [vector] +++ OK, passed 100 tests.
  16654. 677.71 s [vector] mut_ifoldl: OK
  16655. 677.72 s [vector] +++ OK, passed 100 tests.
  16656. 677.72 s [vector] mut_ifoldl': OK
  16657. 677.73 s [vector] +++ OK, passed 100 tests.
  16658. 677.73 s [vector] mut_foldM: OK
  16659. 677.74 s [vector] +++ OK, passed 100 tests.
  16660. 677.74 s [vector] mut_foldM': OK
  16661. 677.74 s [vector] +++ OK, passed 100 tests.
  16662. 677.74 s [vector] mut_foldrM: OK
  16663. 677.74 s [vector] +++ OK, passed 100 tests.
  16664. 677.76 s [vector] mut_foldrM': OK (0.02s)
  16665. 677.76 s [vector] +++ OK, passed 100 tests.
  16666. 677.77 s [vector] mut_ifoldM: OK
  16667. 677.77 s [vector] +++ OK, passed 100 tests.
  16668. 677.78 s [vector] mut_ifoldM': OK
  16669. 677.78 s [vector] +++ OK, passed 100 tests.
  16670. 677.78 s [vector] mut_ifoldrM: OK
  16671. 677.78 s [vector] +++ OK, passed 100 tests.
  16672. 677.79 s [vector] mut_ifoldrM': OK
  16673. 677.79 s [vector] +++ OK, passed 100 tests.
  16674. 677.79 s [vector] compare: OK
  16675. 677.79 s [vector] +++ OK, passed 100 tests.
  16676. 677.79 s [vector] maximum: OK
  16677. 677.79 s [vector] +++ OK, passed 100 tests; 10 discarded.
  16678. 677.79 s [vector] minimum: OK
  16679. 677.79 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16680. 677.79 s [vector] minIndex: OK
  16681. 677.79 s [vector] +++ OK, passed 100 tests; 18 discarded.
  16682. 677.79 s [vector] maxIndex: OK
  16683. 677.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16684. 677.80 s [vector] maximumBy: OK
  16685. 677.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  16686. 677.80 s [vector] minimumBy: OK
  16687. 677.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16688. 677.80 s [vector] maximumOn: OK
  16689. 677.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16690. 677.80 s [vector] minimumOn: OK
  16691. 677.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16692. 677.80 s [vector] maxIndexBy: OK
  16693. 677.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16694. 677.80 s [vector] minIndexBy: OK
  16695. 677.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  16696. 677.80 s [vector] ListFirstMaxIndexWins: OK
  16697. 677.80 s [vector] +++ OK, passed 100 tests; 14 discarded.
  16698. 677.81 s [vector] FalseListFirstMaxIndexWins: OK
  16699. 677.81 s [vector] +++ OK, failed as expected. (after 1 test):
  16700. 677.81 s [vector] Exception:
  16701. 677.81 s [vector] Prelude.foldr1: empty list
  16702. 677.81 s [vector] CallStack (from HasCallStack):
  16703. 677.81 s [vector] error, called at libraries/base/GHC/List.hs:1644:3 in base:GHC.List
  16704. 677.81 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:609:30 in base:GHC.List
  16705. 677.81 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  16706. 677.81 s [vector] []
  16707. 677.81 s [vector] zip: OK
  16708. 677.81 s [vector] +++ OK, passed 100 tests.
  16709. 677.81 s [vector] zip3: OK
  16710. 677.82 s [vector] +++ OK, passed 100 tests.
  16711. 677.82 s [vector] unzip: OK
  16712. 677.82 s [vector] +++ OK, passed 100 tests.
  16713. 677.82 s [vector] unzip3: OK
  16714. 677.82 s [vector] +++ OK, passed 100 tests.
  16715. 677.82 s [vector] indexed: OK
  16716. 677.82 s [vector] +++ OK, passed 100 tests.
  16717. 677.82 s [vector] update: OK
  16718. 677.82 s [vector] +++ OK, passed 100 tests.
  16719. 677.82 s [vector] mempty: OK
  16720. 677.82 s [vector] +++ OK, passed 100 tests.
  16721. 677.83 s [vector] mappend: OK
  16722. 677.84 s [vector] +++ OK, passed 100 tests.
  16723. 677.89 s [vector] mconcat: OK (0.06s)
  16724. 677.89 s [vector] +++ OK, passed 100 tests.
  16725. 677.89 s [vector] glength: OK
  16726. 677.89 s [vector] +++ OK, passed 100 tests.
  16727. 677.89 s [vector] unstream
  16728. 677.89 s [vector] unstream == vunstream (exact): OK
  16729. 677.89 s [vector] +++ OK, passed 100 tests.
  16730. 677.89 s [vector] unstream == vunstream (unknown): OK
  16731. 677.89 s [vector] +++ OK, passed 100 tests.
  16732. 677.89 s [vector] unstreamR ~= vunstream (exact): OK
  16733. 677.89 s [vector] +++ OK, passed 100 tests.
  16734. 677.90 s [vector] unstreamR ~= vunstream (unknown): OK
  16735. 677.90 s [vector] +++ OK, passed 100 tests.
  16736. 677.90 s [vector] Data.Vector.Storable.Vector Alignment
  16737. 677.90 s [vector] Aligned Double: OK
  16738. 677.90 s [vector] Aligned Int: OK
  16739. 677.90 s [vector] Regression tests
  16740. 677.90 s [vector] enumFromTo crash #188
  16741. 677.90 s [vector] Word8: OK
  16742. 677.90 s [vector] Word16: OK
  16743. 677.90 s [vector] Word32: OK
  16744. 677.90 s [vector] Word64: OK
  16745. 677.90 s [vector] Word: OK
  16746. 677.90 s [vector] Int8: OK
  16747. 677.90 s [vector] Int16: OK
  16748. 677.90 s [vector] Int32: OK
  16749. 677.90 s [vector] Int64: OK
  16750. 677.90 s [vector] Int: OK
  16751. 677.90 s [vector] Char: OK
  16752. 677.90 s [vector] Negative tests
  16753. 677.90 s [vector] slice out of bounds #257
  16754. 677.90 s [vector] Boxed
  16755. 677.90 s [vector] Negative ix: OK
  16756. 677.90 s [vector] Negative size: OK
  16757. 677.90 s [vector] Negative ix and size: OK
  16758. 677.90 s [vector] Too large ix: OK
  16759. 677.90 s [vector] Too large size: OK
  16760. 677.90 s [vector] Too large ix and size: OK
  16761. 677.90 s [vector] Overflow: OK
  16762. 677.90 s [vector] OutOfMemory: OK
  16763. 677.90 s [vector] Primitive
  16764. 677.90 s [vector] Negative ix: OK
  16765. 677.90 s [vector] Negative size: OK
  16766. 677.90 s [vector] Negative ix and size: OK
  16767. 677.90 s [vector] Too large ix: OK
  16768. 677.90 s [vector] Too large size: OK
  16769. 677.90 s [vector] Too large ix and size: OK
  16770. 677.90 s [vector] Overflow: OK
  16771. 677.90 s [vector] OutOfMemory: OK
  16772. 677.90 s [vector] Storable
  16773. 677.90 s [vector] Negative ix: OK
  16774. 677.90 s [vector] Negative size: OK
  16775. 677.90 s [vector] Negative ix and size: OK
  16776. 677.90 s [vector] Too large ix: OK
  16777. 677.90 s [vector] Too large size: OK
  16778. 677.90 s [vector] Too large ix and size: OK
  16779. 677.90 s [vector] Overflow: OK
  16780. 677.90 s [vector] OutOfMemory: OK
  16781. 677.90 s [vector] Unboxed
  16782. 677.90 s [vector] Negative ix: OK
  16783. 677.90 s [vector] Negative size: OK
  16784. 677.90 s [vector] Negative ix and size: OK
  16785. 677.90 s [vector] Too large ix: OK
  16786. 677.90 s [vector] Too large size: OK
  16787. 677.90 s [vector] Too large ix and size: OK
  16788. 677.90 s [vector] Overflow: OK
  16789. 677.90 s [vector] OutOfMemory: OK
  16790. 677.90 s [vector] take #282
  16791. 677.90 s [vector] Boxed: OK
  16792. 677.90 s [vector] Primitive: OK
  16793. 677.90 s [vector] Storable: OK
  16794. 677.90 s [vector] Unboxed: OK
  16795. 677.90 s [vector] Data.Vector
  16796. 677.90 s [vector] MonadFix: OK
  16797. 677.90 s [vector] toFromArray: OK
  16798. 677.90 s [vector] toFromArraySlice: OK
  16799. 677.90 s [vector] toFromArraySliceUnsafe: OK
  16800. 677.90 s [vector] toFromMutableArray: OK
  16801. 677.90 s [vector] Data.Vector.Mutable (Move): OK
  16802. 677.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16803. 677.90 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  16804. 677.90 s [vector] +++ OK, passed 100 tests; 17 discarded.
  16805. 677.90 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  16806. 677.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16807. 677.91 s [vector] Data.Vector.Storable.Mutable (Move): OK
  16808. 677.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  16809. 677.91 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  16810. 677.92 s [vector] +++ OK, passed 100 tests.
  16811. 677.92 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  16812. 677.92 s [vector] +++ OK, passed 100 tests.
  16813. 677.92 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  16814. 677.92 s [vector] +++ OK, passed 100 tests.
  16815. 677.92 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  16816. 677.92 s [vector] +++ OK, passed 100 tests.
  16817. 677.93 s [vector]
  16818. 677.93 s [vector] All 2808 tests passed (13.50s)
  16819. 677.97 s [vector] Test suite vector-tests-O2: PASS
  16820. 677.97 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  16821. 677.97 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  16822. 677.99 s [vector] checkPhase completed in 31 seconds
  16823. 678.34 s [vector] Phase: haddockPhase
  16824. 678.34 s [vector] Phase: installPhase
  16825. 678.34 s [vector] Installing library in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16826. 679.03 s [vector] Installing internal library benchmarks-O2 in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/vector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2
  16827. 679.52 s [vector] Phase: fixupPhase
  16828. 679.95 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16829. 679.95 s [vector] shrinking /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSvector-0.13.2.0-7diB3C0Rw2H2PgJwg2nqvl-benchmarks-O2-ghc9.6.7.so
  16830. 679.96 s [vector] shrinking /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSvector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I-ghc9.6.7.so
  16831. 679.99 s [vector] checking for references to /build/ in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0...
  16832. 680.11 s [vector] patching script interpreter paths in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16833. 680.13 s [vector] stripping (with command strip and flags -S -p) in /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0/lib
  16834. 681.53 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16835. 682.41 s [vector:post-build] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
  16836. 682.41 s [vector:post-build]
  16837. 682.77 s [vector:post-build] Pushing /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0 (57.15 MiB)
  16838. 684.39 s [vector:post-build]
  16839. 684.40 s [vector:post-build] All done.
  16840. 684.51 s [vector:post-build] Uploading to the NixCI cache: /nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0
  16841. 684.76 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16842. 684.79 s [vector:post-build] copying 1 paths...
  16843. 684.79 s [vector:post-build] copying path '/nix/store/8wzisx30xn357ad16qdnkkh5nh4f6aj2-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  16844. 702.52 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16845. 702.83 s [vector:post-build] copying 1 paths...
  16846. 702.83 s [vector:post-build] copying path '/nix/store/30q2qqbzic7i0d639bhlldx0x7w5dxzm-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  16847. 703.12 s Progress: 9 of 19 built, 73 of 73 downloaded from cache
  16848. 703.18 s Building /nix/store/mgqbzhznni1lmv74ccd86piizq0w3zhh-nothunks-0.3.1.drv
  16849. 703.36 s [nothunks] Phase: setupCompilerEnvironmentPhase
  16850. 703.37 s [nothunks] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  16851. 703.68 s [nothunks] Phase: unpackPhase
  16852. 703.69 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  16853. 703.70 s [nothunks] source root is nothunks-0.3.1
  16854. 703.70 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  16855. 703.71 s [nothunks] Phase: patchPhase
  16856. 703.71 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  16857. 703.72 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  16858. 703.74 s [nothunks] Phase: compileBuildDriverPhase
  16859. 703.74 s [nothunks] setupCompileFlags: -package-db=/build/tmp.WdZyeUcYg6/setup-package.conf.d -threaded
  16860. 703.80 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.WdZyeUcYg6/Main.o )
  16861. 703.86 s [nothunks] [2 of 2] Linking Setup
  16862. 705.29 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  16863. 705.31 s [nothunks] Phase: configurePhase
  16864. 705.32 s [nothunks] configureFlags: --verbose --prefix=/nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.WdZyeUcYg6/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  16865. 705.34 s [nothunks] Using Parsec parser
  16866. 705.34 s [nothunks] Configuring nothunks-0.3.1...
  16867. 705.67 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  16868. 705.67 s [nothunks] Dependency base: using base-4.18.3.0
  16869. 705.67 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.11.5.4
  16870. 705.67 s [nothunks] Dependency containers: using containers-0.6.7
  16871. 705.67 s [nothunks] Dependency ghc-heap: using ghc-heap-9.6.7
  16872. 705.67 s [nothunks] Dependency stm: using stm-2.5.1.0
  16873. 705.67 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.0.2
  16874. 705.67 s [nothunks] Dependency time: using time-1.12.2
  16875. 705.67 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  16876. 705.67 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  16877. 705.67 s [nothunks] Dependency base: using base-4.18.3.0
  16878. 705.67 s [nothunks] Dependency containers: using containers-0.6.7
  16879. 705.67 s [nothunks] Dependency ghc-prim: using ghc-prim-0.10.0
  16880. 705.67 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  16881. 705.67 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  16882. 705.67 s [nothunks] Dependency random: using random-1.2.1.3
  16883. 705.67 s [nothunks] Dependency stm: using stm-2.5.1.0
  16884. 705.67 s [nothunks] Dependency tasty: using tasty-1.5.3
  16885. 705.67 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  16886. 706.01 s [nothunks] Source component graph:
  16887. 706.01 s [nothunks] component lib
  16888. 706.01 s [nothunks] component test:nothunks-test dependency lib
  16889. 706.01 s [nothunks] Configured component graph:
  16890. 706.01 s [nothunks] component nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16891. 706.01 s [nothunks] include base-4.18.3.0
  16892. 706.01 s [nothunks] include bytestring-0.11.5.4
  16893. 706.01 s [nothunks] include containers-0.6.7
  16894. 706.01 s [nothunks] include ghc-heap-9.6.7
  16895. 706.01 s [nothunks] include stm-2.5.1.0
  16896. 706.01 s [nothunks] include text-2.0.2
  16897. 706.01 s [nothunks] include time-1.12.2
  16898. 706.01 s [nothunks] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16899. 706.01 s [nothunks] include wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16900. 706.01 s [nothunks] component nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16901. 706.01 s [nothunks] include base-4.18.3.0
  16902. 706.01 s [nothunks] include containers-0.6.7
  16903. 706.01 s [nothunks] include ghc-prim-0.10.0
  16904. 706.01 s [nothunks] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16905. 706.01 s [nothunks] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16906. 706.01 s [nothunks] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16907. 706.01 s [nothunks] include stm-2.5.1.0
  16908. 706.01 s [nothunks] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16909. 706.01 s [nothunks] include tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16910. 706.01 s [nothunks] Linked component graph:
  16911. 706.01 s [nothunks] unit nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16912. 706.01 s [nothunks] include base-4.18.3.0
  16913. 706.01 s [nothunks] include bytestring-0.11.5.4
  16914. 706.01 s [nothunks] include containers-0.6.7
  16915. 706.01 s [nothunks] include ghc-heap-9.6.7
  16916. 706.01 s [nothunks] include stm-2.5.1.0
  16917. 706.01 s [nothunks] include text-2.0.2
  16918. 706.01 s [nothunks] include time-1.12.2
  16919. 706.01 s [nothunks] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16920. 706.01 s [nothunks] include wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16921. 706.01 s [nothunks] NoThunks.Class=nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf:NoThunks.Class
  16922. 706.01 s [nothunks] unit nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16923. 706.01 s [nothunks] include base-4.18.3.0
  16924. 706.01 s [nothunks] include containers-0.6.7
  16925. 706.01 s [nothunks] include ghc-prim-0.10.0
  16926. 706.01 s [nothunks] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16927. 706.01 s [nothunks] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16928. 706.01 s [nothunks] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16929. 706.01 s [nothunks] include stm-2.5.1.0
  16930. 706.01 s [nothunks] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16931. 706.01 s [nothunks] include tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16932. 706.01 s [nothunks] Ready component graph:
  16933. 706.01 s [nothunks] definite nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16934. 706.01 s [nothunks] depends base-4.18.3.0
  16935. 706.01 s [nothunks] depends bytestring-0.11.5.4
  16936. 706.01 s [nothunks] depends containers-0.6.7
  16937. 706.01 s [nothunks] depends ghc-heap-9.6.7
  16938. 706.01 s [nothunks] depends stm-2.5.1.0
  16939. 706.01 s [nothunks] depends text-2.0.2
  16940. 706.01 s [nothunks] depends time-1.12.2
  16941. 706.01 s [nothunks] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  16942. 706.01 s [nothunks] depends wherefrom-compat-0.1.1.1-43HQYtLkbP84BVZNd6Rc4M
  16943. 706.01 s [nothunks] definite nothunks-0.3.1-4NlKzo6jdWqI4ZYdpLBN7H-nothunks-test
  16944. 706.01 s [nothunks] depends base-4.18.3.0
  16945. 706.01 s [nothunks] depends containers-0.6.7
  16946. 706.01 s [nothunks] depends ghc-prim-0.10.0
  16947. 706.01 s [nothunks] depends hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  16948. 706.01 s [nothunks] depends nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16949. 706.01 s [nothunks] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  16950. 706.01 s [nothunks] depends stm-2.5.1.0
  16951. 706.01 s [nothunks] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  16952. 706.01 s [nothunks] depends tasty-hedgehog-1.4.0.2-1edJaqCm9fDJwUWc2yLVA
  16953. 706.01 s [nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.6
  16954. 706.01 s [nothunks] Using compiler: ghc-9.6.7
  16955. 706.01 s [nothunks] Using install prefix:
  16956. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  16957. 706.01 s [nothunks] Executables installed in:
  16958. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/bin
  16959. 706.01 s [nothunks] Libraries installed in:
  16960. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  16961. 706.01 s [nothunks] Dynamic Libraries installed in:
  16962. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  16963. 706.01 s [nothunks] Private executables installed in:
  16964. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.6.7/nothunks-0.3.1
  16965. 706.01 s [nothunks] Data files installed in:
  16966. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/share/x86_64-linux-ghc-9.6.7/nothunks-0.3.1
  16967. 706.01 s [nothunks] Documentation installed in:
  16968. 706.01 s [nothunks] /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  16969. 706.01 s [nothunks] Configuration files installed in:
  16970. 706.01 s [nothunks] /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/etc
  16971. 706.01 s [nothunks] No alex found
  16972. 706.01 s [nothunks] Using ar found on system at:
  16973. 706.01 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  16974. 706.01 s [nothunks] No c2hs found
  16975. 706.01 s [nothunks] No cpphs found
  16976. 706.01 s [nothunks] No doctest found
  16977. 706.01 s [nothunks] Using gcc version 14.3.0 given by user at:
  16978. 706.01 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  16979. 706.01 s [nothunks] Using ghc version 9.6.7 found on system at:
  16980. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  16981. 706.01 s [nothunks] Using ghc-pkg version 9.6.7 found on system at:
  16982. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  16983. 706.01 s [nothunks] No ghcjs found
  16984. 706.01 s [nothunks] No ghcjs-pkg found
  16985. 706.01 s [nothunks] No greencard found
  16986. 706.01 s [nothunks] Using haddock version 2.29.2 found on system at:
  16987. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  16988. 706.01 s [nothunks] No happy found
  16989. 706.01 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  16990. 706.01 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16991. 706.01 s [nothunks] No hmake found
  16992. 706.01 s [nothunks] Using hpc version 0.68 found on system at:
  16993. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  16994. 706.01 s [nothunks] Using hsc2hs version 0.68.9 found on system at:
  16995. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  16996. 706.01 s [nothunks] Using hscolour version 1.25 found on system at:
  16997. 706.01 s [nothunks] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  16998. 706.01 s [nothunks] No jhc found
  16999. 706.01 s [nothunks] Using ld found on system at:
  17000. 706.01 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17001. 706.01 s [nothunks] No pkg-config found
  17002. 706.01 s [nothunks] Using runghc version 9.6.7 found on system at:
  17003. 706.01 s [nothunks] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  17004. 706.01 s [nothunks] Using strip version 2.44 found on system at:
  17005. 706.01 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17006. 706.01 s [nothunks] Using tar found on system at:
  17007. 706.01 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17008. 706.01 s [nothunks] No uhc found
  17009. 706.27 s [nothunks] Phase: buildPhase
  17010. 706.33 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17011. 706.33 s [nothunks] Building library for nothunks-0.3.1..
  17012. 706.41 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  17013. 709.05 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  17014. 712.61 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17015. 712.61 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1..
  17016. 712.75 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 )
  17017. 715.08 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  17018. 715.40 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  17019. 716.70 s [nothunks] Phase: checkPhase
  17020. 716.74 s [nothunks] Running 1 test suites...
  17021. 716.74 s [nothunks] Test suite nothunks-test: RUNNING...
  17022. 716.74 s [nothunks] Tests
  17023. 716.74 s [nothunks] NoThunks.Class
  17024. 716.74 s [nothunks] Sanity
  17025. 716.74 s [nothunks] IntNotNF: OK
  17026. 716.74 s [nothunks] ✓ <interactive> passed 1 test.
  17027. 716.74 s [nothunks] IntIsNF: OK
  17028. 716.74 s [nothunks] ✓ <interactive> passed 1 test.
  17029. 716.74 s [nothunks] Pair: OK
  17030. 716.74 s [nothunks] ✓ <interactive> passed 1 test.
  17031. 716.74 s [nothunks] Sum: OK
  17032. 716.74 s [nothunks] ✓ <interactive> passed 1 test.
  17033. 716.74 s [nothunks] Fn: OK
  17034. 716.74 s [nothunks] ✓ <interactive> passed 1 test.
  17035. 716.74 s [nothunks] IO: OK
  17036. 716.75 s [nothunks] ✓ <interactive> passed 1 test.
  17037. 716.75 s [nothunks] InspectHeap
  17038. 716.76 s [nothunks] Int: OK (0.01s)
  17039. 716.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  17040. 716.76 s [nothunks] Just ["Int"] 51% ██████████▏·········
  17041. 716.76 s [nothunks] Nothing 49% █████████▊··········
  17042. 716.78 s [nothunks] IntInt: OK
  17043. 716.79 s [nothunks] ✓ <interactive> passed 1000 tests.
  17044. 716.79 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17045. 716.79 s [nothunks] Just ["Int","(,)"] 37% ███████▍············
  17046. 716.79 s [nothunks] Nothing 13% ██▌·················
  17047. 716.81 s [nothunks] SumInt: OK (0.02s)
  17048. 716.81 s [nothunks] ✓ <interactive> passed 1000 tests.
  17049. 716.81 s [nothunks] Just ["Either"] 32% ██████▎·············
  17050. 716.81 s [nothunks] Just ["Int","Either"] 35% ███████·············
  17051. 716.81 s [nothunks] Nothing 33% ██████▋·············
  17052. 716.81 s [nothunks] ListInt: OK (0.02s)
  17053. 716.81 s [nothunks] ✓ <interactive> passed 1000 tests.
  17054. 716.81 s [nothunks] Just ["Int","List"] 23% ████▋···············
  17055. 716.81 s [nothunks] Just ["List"] 44% ████████▋···········
  17056. 716.81 s [nothunks] Nothing 33% ██████▌·············
  17057. 716.84 s [nothunks] IntListInt: OK (0.03s)
  17058. 716.84 s [nothunks] ✓ <interactive> passed 1000 tests.
  17059. 716.84 s [nothunks] Just ["(,)"] 48% █████████▌··········
  17060. 716.84 s [nothunks] Just ["Int","(,)"] 27% █████▍··············
  17061. 716.84 s [nothunks] Just ["Int","List","(,)"] 6% █···················
  17062. 716.84 s [nothunks] Just ["List","(,)"] 10% █▉··················
  17063. 716.84 s [nothunks] Nothing 10% █▉··················
  17064. 716.86 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  17065. 716.86 s [nothunks] after 13 tests and 1 shrink.
  17066. 716.86 s [nothunks] shrink path: 13:b
  17067. 716.86 s [nothunks] Just ["Int","Seq"] 31% ██████▏·············
  17068. 716.86 s [nothunks] Nothing 62% ████████████▎·······
  17069. 716.86 s [nothunks]
  17070. 716.86 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  17071. 716.86 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  17072. 716.86 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  17073. 716.86 s [nothunks] 168 ┃ -> Proxy a
  17074. 716.86 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  17075. 716.86 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  17076. 716.86 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  17077. 716.86 s [nothunks] 172 ┃ -> Property
  17078. 716.86 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  17079. 716.86 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  17080. 716.86 s [nothunks] ┃ │ Wrap
  17081. 716.86 s [nothunks] ┃ │ { unwrap =
  17082. 716.86 s [nothunks] ┃ │ SeqEnqueue
  17083. 716.86 s [nothunks] ┃ │ (IntValue 0)
  17084. 716.86 s [nothunks] ┃ │ (SeqEnqueue
  17085. 716.86 s [nothunks] ┃ │ (IntValue 0)
  17086. 716.86 s [nothunks] ┃ │ (SeqEnqueue
  17087. 716.86 s [nothunks] ┃ │ (IntValue 0)
  17088. 716.86 s [nothunks] ┃ │ (SeqEnqueue
  17089. 716.86 s [nothunks] ┃ │ (IntValue 0)
  17090. 716.86 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  17091. 716.86 s [nothunks] ┃ │ }
  17092. 716.86 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  17093. 716.86 s [nothunks] 176 ┃ fromModel m $ \a -> do
  17094. 716.86 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  17095. 716.86 s [nothunks] ┃ │ IsNF
  17096. 716.86 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  17097. 716.86 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  17098. 716.86 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17099. 716.86 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  17100. 716.86 s [nothunks] ┃ │ - Just
  17101. 716.86 s [nothunks] ┃ │ - ThunkInfo
  17102. 716.86 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  17103. 716.86 s [nothunks] ┃ │ + Nothing
  17104. 716.86 s [nothunks]
  17105. 716.86 s [nothunks] This failure can be reproduced by running:
  17106. 716.86 s [nothunks] > recheckAt (Seed 2212678071725928341 6882041242082548077) "13:b" EXPECTED FAILURE
  17107. 716.86 s [nothunks]
  17108. 716.87 s [nothunks] OK (0.02s)
  17109. 716.87 s [nothunks] ✓ <interactive> passed 1 test.
  17110. 716.87 s [nothunks] Model
  17111. 716.87 s [nothunks] Int: OK (0.01s)
  17112. 716.87 s [nothunks] ✓ <interactive> passed 1000 tests.
  17113. 716.87 s [nothunks] Just ["Int"] 48% █████████▌··········
  17114. 716.87 s [nothunks] Nothing 52% ██████████▍·········
  17115. 716.89 s [nothunks] IntInt: OK (0.02s)
  17116. 716.89 s [nothunks] ✓ <interactive> passed 1000 tests.
  17117. 716.89 s [nothunks] Just ["(,)"] 52% ██████████▎·········
  17118. 716.89 s [nothunks] Just ["Int","(,)"] 37% ███████▍············
  17119. 716.89 s [nothunks] Nothing 11% ██▏·················
  17120. 716.91 s [nothunks] SumInt: OK (0.01s)
  17121. 716.91 s [nothunks] ✓ <interactive> passed 1000 tests.
  17122. 716.91 s [nothunks] Just ["Either"] 34% ██████▋·············
  17123. 716.91 s [nothunks] Just ["Int","Either"] 32% ██████▎·············
  17124. 716.91 s [nothunks] Nothing 34% ██████▉·············
  17125. 716.93 s [nothunks] ListInt: OK (0.02s)
  17126. 716.93 s [nothunks] ✓ <interactive> passed 1000 tests.
  17127. 716.93 s [nothunks] Just ["Int","List"] 21% ████▎···············
  17128. 716.93 s [nothunks] Just ["List"] 44% ████████▊···········
  17129. 716.93 s [nothunks] Nothing 34% ██████▉·············
  17130. 716.97 s [nothunks] IntListInt: OK (0.04s)
  17131. 716.97 s [nothunks] ✓ <interactive> passed 1000 tests.
  17132. 716.97 s [nothunks] Just ["(,)"] 50% █████████▉··········
  17133. 716.97 s [nothunks] Just ["Int","(,)"] 25% █████···············
  17134. 716.97 s [nothunks] Just ["Int","List","(,)"] 6% █▏··················
  17135. 716.97 s [nothunks] Just ["List","(,)"] 10% ██··················
  17136. 716.97 s [nothunks] Nothing 9% █▊··················
  17137. 717.03 s [nothunks] SeqInt: OK (0.07s)
  17138. 717.03 s [nothunks] ✓ <interactive> passed 1000 tests.
  17139. 717.03 s [nothunks] Just ["Int","Seq"] 47% █████████▎··········
  17140. 717.03 s [nothunks] Nothing 53% ██████████▋·········
  17141. 717.07 s [nothunks] AllowThunksIn: OK (0.03s)
  17142. 717.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  17143. 717.07 s [nothunks] Just ["Int","field2","Record"] 24% ████▋···············
  17144. 717.07 s [nothunks] Just ["Record"] 50% ██████████··········
  17145. 717.07 s [nothunks] Nothing 26% █████▏··············
  17146. 717.07 s [nothunks] Fn: OK (0.01s)
  17147. 717.07 s [nothunks] ✓ <interactive> passed 1000 tests.
  17148. 717.07 s [nothunks] Just ["->"] 26% █████···············
  17149. 717.07 s [nothunks] Nothing 74% ██████████████▉·····
  17150. 717.09 s [nothunks] IO: OK (0.01s)
  17151. 717.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  17152. 717.09 s [nothunks] Just ["IO"] 26% █████▎··············
  17153. 717.09 s [nothunks] Nothing 74% ██████████████▋·····
  17154. 717.09 s [nothunks] ThunkFreeFn: OK (0.01s)
  17155. 717.09 s [nothunks] ✓ <interactive> passed 1000 tests.
  17156. 717.09 s [nothunks] Just ["->"] 23% ████▋···············
  17157. 717.09 s [nothunks] Just ["...","->"] 41% ████████▏···········
  17158. 717.09 s [nothunks] Nothing 36% ███████▏············
  17159. 717.10 s [nothunks] ThunkFreeIO: OK (0.01s)
  17160. 717.10 s [nothunks] ✓ <interactive> passed 1000 tests.
  17161. 717.10 s [nothunks] Just ["...","IO"] 37% ███████▍············
  17162. 717.10 s [nothunks] Just ["IO"] 25% ████▉···············
  17163. 717.10 s [nothunks] Nothing 38% ███████▌············
  17164. 717.10 s [nothunks] MutableVars
  17165. 717.10 s [nothunks] IORef
  17166. 717.10 s [nothunks] NotNF: OK
  17167. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17168. 717.10 s [nothunks] NF: OK
  17169. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17170. 717.10 s [nothunks] NotNFPure: OK
  17171. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17172. 717.10 s [nothunks] NFPure: OK
  17173. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17174. 717.10 s [nothunks] NotNFAtomically: OK
  17175. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17176. 717.10 s [nothunks] NFAtomically: OK
  17177. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17178. 717.10 s [nothunks] MVar
  17179. 717.10 s [nothunks] NotNF: OK
  17180. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17181. 717.10 s [nothunks] NF: OK
  17182. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17183. 717.10 s [nothunks] NotNFPure: OK
  17184. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17185. 717.10 s [nothunks] NFPure: OK
  17186. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17187. 717.10 s [nothunks] NotNFAtomically: OK
  17188. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17189. 717.10 s [nothunks] NFAtomically: OK
  17190. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17191. 717.10 s [nothunks] TVar
  17192. 717.10 s [nothunks] NotNF: OK
  17193. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17194. 717.10 s [nothunks] NF: OK
  17195. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17196. 717.10 s [nothunks] NotNFPure: OK
  17197. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17198. 717.10 s [nothunks] NFPure: OK
  17199. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17200. 717.10 s [nothunks] NotNFAtomically: OK
  17201. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17202. 717.10 s [nothunks] NFAtomically: OK
  17203. 717.10 s [nothunks] ✓ <interactive> passed 1 test.
  17204. 717.10 s [nothunks]
  17205. 717.10 s [nothunks] All 41 tests passed (0.36s)
  17206. 717.11 s [nothunks] Test suite nothunks-test: PASS
  17207. 717.11 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  17208. 717.11 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  17209. 717.13 s [nothunks] Phase: haddockPhase
  17210. 717.38 s [nothunks] Preprocessing library for nothunks-0.3.1..
  17211. 717.38 s [nothunks] Running Haddock on library for nothunks-0.3.1..
  17212. 717.38 s [nothunks] Warning: The documentation for the following packages are not installed. No
  17213. 717.38 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  17214. 717.46 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  17215. 718.21 s [nothunks] Warning: 'GHC' is out of scope.
  17216. 718.21 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17217. 718.21 s [nothunks] Warning: 'a' is out of scope.
  17218. 718.21 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  17219. 718.23 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  17220. 718.23 s [nothunks] Missing documentation for:
  17221. 718.23 s [nothunks] Module header
  17222. 718.81 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  17223. 718.81 s [nothunks] - Data.Vector.Vector
  17224. 718.81 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  17225. 718.81 s [nothunks] - NoThunks.Class.HasFields
  17226. 718.81 s [nothunks] - NoThunks.Class.Elem
  17227. 718.81 s [nothunks] - NoThunks.Class.GShowTypeOf
  17228. 718.81 s [nothunks] - NoThunks.Class.GWRecordField
  17229. 718.81 s [nothunks] - NoThunks.Class.checkContainsThunks
  17230. 722.02 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  17231. 722.10 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  17232. 722.10 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1..
  17233. 722.10 s [nothunks] Phase: installPhase
  17234. 722.21 s [nothunks] Installing library in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17235. 722.43 s [nothunks] Phase: fixupPhase
  17236. 722.45 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  17237. 722.46 s [nothunks] shrinking /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSnothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf-ghc9.6.7.so
  17238. 722.47 s [nothunks] checking for references to /build/ in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1...
  17239. 722.49 s [nothunks] patching script interpreter paths in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1
  17240. 722.49 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1/lib
  17241. 722.56 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17242. 722.56 s [nothunks] checking for references to /build/ in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc...
  17243. 722.58 s [nothunks] patching script interpreter paths in /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17244. 722.67 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17245. 723.45 s [nothunks:post-build] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
  17246. 723.45 s [nothunks:post-build]
  17247. 723.80 s [nothunks:post-build] Pushing /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 (2.72 MiB)
  17248. 723.88 s [nothunks:post-build] Pushing /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc (836.15 KiB)
  17249. 724.86 s [nothunks:post-build]
  17250. 724.86 s [nothunks:post-build] All done.
  17251. 724.88 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1 /nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc
  17252. 724.93 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17253. 725.15 s [nothunks:post-build] copying 2 paths...
  17254. 725.15 s [nothunks:post-build] copying path '/nix/store/kcirmmjzdv573il34py0i0rngms0nnrj-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  17255. 725.53 s [nothunks:post-build] copying path '/nix/store/7hjgaksliinpkkag33sn55kajp69wylp-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  17256. 726.46 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  17257. 726.72 s [nothunks:post-build] copying 1 paths...
  17258. 726.72 s [nothunks:post-build] copying path '/nix/store/mgqbzhznni1lmv74ccd86piizq0w3zhh-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  17259. 726.96 s Progress: 10 of 19 built, 73 of 73 downloaded from cache
  17260. 727.00 s Building /nix/store/r6c54pd7rjdnrnb1680lxsm637gx7aas-unordered-containers-0.2.20.1.drv
  17261. 727.14 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  17262. 727.19 s [unordered-containers] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  17263. 727.33 s [unordered-containers] Phase: unpackPhase
  17264. 727.34 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  17265. 727.35 s [unordered-containers] source root is unordered-containers-0.2.20.1
  17266. 727.35 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  17267. 727.36 s [unordered-containers] Phase: patchPhase
  17268. 727.37 s [unordered-containers] Phase: compileBuildDriverPhase
  17269. 727.37 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.sVDKBGmOXh/setup-package.conf.d -threaded
  17270. 727.46 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.sVDKBGmOXh/Main.o )
  17271. 727.51 s [unordered-containers] [2 of 2] Linking Setup
  17272. 729.01 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  17273. 729.02 s [unordered-containers] Phase: configurePhase
  17274. 729.03 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.sVDKBGmOXh/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  17275. 729.03 s [unordered-containers] Using Parsec parser
  17276. 729.03 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  17277. 729.41 s [unordered-containers] Flags chosen: debug=False
  17278. 729.41 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.18.3.0
  17279. 729.41 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.4.8.1
  17280. 729.41 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  17281. 729.41 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.20.0.0
  17282. 729.41 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  17283. 729.41 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  17284. 729.41 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  17285. 729.41 s [unordered-containers] Dependency base: using base-4.18.3.0
  17286. 729.41 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.7
  17287. 729.41 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  17288. 729.41 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  17289. 729.41 s [unordered-containers] Dependency random: using random-1.2.1.3
  17290. 729.41 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  17291. 729.41 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  17292. 729.41 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  17293. 729.41 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  17294. 729.78 s [unordered-containers] Source component graph:
  17295. 729.78 s [unordered-containers] component lib
  17296. 729.78 s [unordered-containers] component test:unordered-containers-tests dependency lib
  17297. 729.78 s [unordered-containers] Configured component graph:
  17298. 729.78 s [unordered-containers] component unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17299. 729.78 s [unordered-containers] include base-4.18.3.0
  17300. 729.78 s [unordered-containers] include deepseq-1.4.8.1
  17301. 729.78 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17302. 729.78 s [unordered-containers] include template-haskell-2.20.0.0
  17303. 729.78 s [unordered-containers] component unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17304. 729.78 s [unordered-containers] include ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17305. 729.78 s [unordered-containers] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17306. 729.78 s [unordered-containers] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17307. 729.78 s [unordered-containers] include base-4.18.3.0
  17308. 729.78 s [unordered-containers] include containers-0.6.7
  17309. 729.78 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17310. 729.78 s [unordered-containers] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17311. 729.78 s [unordered-containers] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17312. 729.78 s [unordered-containers] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17313. 729.78 s [unordered-containers] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17314. 729.78 s [unordered-containers] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17315. 729.78 s [unordered-containers] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17316. 729.78 s [unordered-containers] Linked component graph:
  17317. 729.78 s [unordered-containers] unit unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17318. 729.78 s [unordered-containers] include base-4.18.3.0
  17319. 729.78 s [unordered-containers] include deepseq-1.4.8.1
  17320. 729.78 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17321. 729.78 s [unordered-containers] include template-haskell-2.20.0.0
  17322. 729.78 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM:Data.HashSet.Internal
  17323. 729.78 s [unordered-containers] unit unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17324. 729.78 s [unordered-containers] include ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17325. 729.78 s [unordered-containers] include HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17326. 729.78 s [unordered-containers] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17327. 729.78 s [unordered-containers] include base-4.18.3.0
  17328. 729.78 s [unordered-containers] include containers-0.6.7
  17329. 729.78 s [unordered-containers] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17330. 729.78 s [unordered-containers] include nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17331. 729.78 s [unordered-containers] include random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17332. 729.78 s [unordered-containers] include tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17333. 729.78 s [unordered-containers] include tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17334. 729.78 s [unordered-containers] include tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17335. 729.78 s [unordered-containers] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17336. 729.78 s [unordered-containers] Ready component graph:
  17337. 729.78 s [unordered-containers] definite unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17338. 729.78 s [unordered-containers] depends base-4.18.3.0
  17339. 729.78 s [unordered-containers] depends deepseq-1.4.8.1
  17340. 729.78 s [unordered-containers] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17341. 729.78 s [unordered-containers] depends template-haskell-2.20.0.0
  17342. 729.78 s [unordered-containers] definite unordered-containers-0.2.20.1-Lv2DtJYil3NKky7HcVKF3w-unordered-containers-tests
  17343. 729.78 s [unordered-containers] depends ChasingBottoms-1.3.1.17-KXmTvzLsrA6HUnYEAv9Scg
  17344. 729.78 s [unordered-containers] depends HUnit-1.6.2.0-F2z2OfQMKSyFedMgK10LEy
  17345. 729.78 s [unordered-containers] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  17346. 729.78 s [unordered-containers] depends base-4.18.3.0
  17347. 729.78 s [unordered-containers] depends containers-0.6.7
  17348. 729.78 s [unordered-containers] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  17349. 729.78 s [unordered-containers] depends nothunks-0.3.1-BfUCkvOPRLm1WeIDnVAeXf
  17350. 729.78 s [unordered-containers] depends random-1.2.1.3-BCDvsZ3eiMEJYODaxpeLFS
  17351. 729.78 s [unordered-containers] depends tasty-1.5.3-Fl9CU3Vk7g8JzztMvOsgbx
  17352. 729.78 s [unordered-containers] depends tasty-hunit-0.10.2-LPwKd0CyAJ52Zh1mEBUUUW
  17353. 729.78 s [unordered-containers] depends tasty-quickcheck-0.11.1-8ZJe3ywHMsE7YM94kQ7nE8
  17354. 729.78 s [unordered-containers] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17355. 729.78 s [unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.6
  17356. 729.78 s [unordered-containers] Using compiler: ghc-9.6.7
  17357. 729.78 s [unordered-containers] Using install prefix:
  17358. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  17359. 729.78 s [unordered-containers] Executables installed in:
  17360. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/bin
  17361. 729.78 s [unordered-containers] Libraries installed in:
  17362. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  17363. 729.78 s [unordered-containers] Dynamic Libraries installed in:
  17364. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  17365. 729.78 s [unordered-containers] Private executables installed in:
  17366. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1
  17367. 729.78 s [unordered-containers] Data files installed in:
  17368. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1
  17369. 729.78 s [unordered-containers] Documentation installed in:
  17370. 729.78 s [unordered-containers] /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  17371. 729.78 s [unordered-containers] Configuration files installed in:
  17372. 729.78 s [unordered-containers] /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/etc
  17373. 729.78 s [unordered-containers] No alex found
  17374. 729.78 s [unordered-containers] Using ar found on system at:
  17375. 729.78 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  17376. 729.78 s [unordered-containers] No c2hs found
  17377. 729.78 s [unordered-containers] No cpphs found
  17378. 729.78 s [unordered-containers] No doctest found
  17379. 729.78 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  17380. 729.78 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  17381. 729.78 s [unordered-containers] Using ghc version 9.6.7 found on system at:
  17382. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  17383. 729.78 s [unordered-containers] Using ghc-pkg version 9.6.7 found on system at:
  17384. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  17385. 729.78 s [unordered-containers] No ghcjs found
  17386. 729.78 s [unordered-containers] No ghcjs-pkg found
  17387. 729.78 s [unordered-containers] No greencard found
  17388. 729.78 s [unordered-containers] Using haddock version 2.29.2 found on system at:
  17389. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  17390. 729.78 s [unordered-containers] No happy found
  17391. 729.78 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  17392. 729.78 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  17393. 729.78 s [unordered-containers] No hmake found
  17394. 729.78 s [unordered-containers] Using hpc version 0.68 found on system at:
  17395. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  17396. 729.78 s [unordered-containers] Using hsc2hs version 0.68.9 found on system at:
  17397. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  17398. 729.78 s [unordered-containers] Using hscolour version 1.25 found on system at:
  17399. 729.78 s [unordered-containers] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  17400. 729.78 s [unordered-containers] No jhc found
  17401. 729.78 s [unordered-containers] Using ld found on system at:
  17402. 729.78 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  17403. 729.78 s [unordered-containers] No pkg-config found
  17404. 729.78 s [unordered-containers] Using runghc version 9.6.7 found on system at:
  17405. 729.78 s [unordered-containers] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  17406. 729.78 s [unordered-containers] Using strip version 2.44 found on system at:
  17407. 729.78 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  17408. 729.78 s [unordered-containers] Using tar found on system at:
  17409. 729.78 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  17410. 729.78 s [unordered-containers] No uhc found
  17411. 730.01 s [unordered-containers] Phase: buildPhase
  17412. 730.07 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  17413. 730.08 s [unordered-containers] Building library for unordered-containers-0.2.20.1..
  17414. 730.18 s [unordered-containers]
  17415. 730.18 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17416. 730.18 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17417. 730.18 s [unordered-containers] |
  17418. 730.18 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17419. 730.18 s [unordered-containers] | ^^^^^^^^^^
  17420. 730.38 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 )
  17421. 730.53 s [unordered-containers]
  17422. 730.53 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17423. 730.53 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17424. 730.53 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17425. 730.53 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17426. 730.53 s [unordered-containers] |
  17427. 730.53 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17428. 730.53 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17429. 731.15 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 )
  17430. 731.15 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 )
  17431. 737.95 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 )
  17432. 738.51 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 )
  17433. 740.26 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 )
  17434. 740.26 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  17435. 740.26 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 )
  17436. 740.28 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 )
  17437. 740.55 s [unordered-containers]
  17438. 740.55 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  17439. 740.55 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  17440. 740.55 s [unordered-containers] |
  17441. 740.55 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  17442. 740.55 s [unordered-containers] | ^^^^^^^^^^
  17443. 740.75 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  17444. 740.91 s [unordered-containers]
  17445. 740.91 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  17446. 740.91 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  17447. 740.91 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  17448. 740.91 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  17449. 740.91 s [unordered-containers] |
  17450. 740.91 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  17451. 740.91 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  17452. 741.93 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  17453. 741.93 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  17454. 750.22 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  17455. 750.85 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  17456. 753.28 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  17457. 753.28 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  17458. 753.28 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  17459. 753.56 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  17460. 755.62 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17461. 755.62 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  17462. 755.88 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 )
  17463. 756.20 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  17464. 759.60 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 )
  17465. 759.60 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  17466. 759.60 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 )
  17467. 759.60 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 )
  17468. 767.03 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 )
  17469. 767.07 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  17470. 767.08 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  17471. 767.82 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  17472. 769.16 s [unordered-containers] buildPhase completed in 39 seconds
  17473. 769.16 s [unordered-containers] Phase: checkPhase
  17474. 769.20 s [unordered-containers] Running 1 test suites...
  17475. 769.20 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  17476. 769.21 s [unordered-containers] All
  17477. 769.21 s [unordered-containers] Properties
  17478. 769.21 s [unordered-containers] Data.HashMap.Lazy
  17479. 769.21 s [unordered-containers] instances
  17480. 769.21 s [unordered-containers] Eq
  17481. 769.22 s [unordered-containers] ==: OK (0.01s)
  17482. 769.22 s [unordered-containers] +++ OK, passed 100 tests.
  17483. 769.23 s [unordered-containers] /=: OK (0.02s)
  17484. 769.23 s [unordered-containers] +++ OK, passed 100 tests.
  17485. 769.23 s [unordered-containers] Ord
  17486. 769.23 s [unordered-containers] compare reflexive: OK
  17487. 769.23 s [unordered-containers] +++ OK, passed 100 tests.
  17488. 769.23 s [unordered-containers] compare transitive: OK (0.02s)
  17489. 769.23 s [unordered-containers] +++ OK, passed 100 tests.
  17490. 769.23 s [unordered-containers] compare antisymmetric: OK (0.01s)
  17491. 769.23 s [unordered-containers] +++ OK, passed 100 tests.
  17492. 769.23 s [unordered-containers] Ord => Eq: OK
  17493. 769.23 s [unordered-containers] +++ OK, passed 100 tests.
  17494. 769.28 s [unordered-containers] Read/Show: OK (0.07s)
  17495. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17496. 769.28 s [unordered-containers] Functor: OK (0.04s)
  17497. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17498. 769.28 s [unordered-containers] Foldable: OK (0.02s)
  17499. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17500. 769.28 s [unordered-containers] Bifoldable
  17501. 769.28 s [unordered-containers] bifoldMap: OK (0.03s)
  17502. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17503. 769.28 s [unordered-containers] bifoldr: OK (0.02s)
  17504. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17505. 769.28 s [unordered-containers] bifoldl: OK (0.01s)
  17506. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17507. 769.28 s [unordered-containers] Hashable: OK (0.02s)
  17508. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17509. 769.28 s [unordered-containers] empty
  17510. 769.28 s [unordered-containers] valid: OK
  17511. 769.28 s [unordered-containers] +++ OK, passed 1 test.
  17512. 769.28 s [unordered-containers] singleton
  17513. 769.28 s [unordered-containers] valid: OK
  17514. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17515. 769.28 s [unordered-containers] size: OK (0.02s)
  17516. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17517. 769.28 s [unordered-containers] member: OK (0.01s)
  17518. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17519. 769.28 s [unordered-containers] lookup: OK
  17520. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17521. 769.28 s [unordered-containers] !?: OK (0.01s)
  17522. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17523. 769.28 s [unordered-containers] insert
  17524. 769.28 s [unordered-containers] model: OK
  17525. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17526. 769.28 s [unordered-containers] valid: OK
  17527. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17528. 769.28 s [unordered-containers] insertWith
  17529. 769.28 s [unordered-containers] insertWith: OK
  17530. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17531. 769.28 s [unordered-containers] valid: OK
  17532. 769.28 s [unordered-containers] +++ OK, passed 100 tests.
  17533. 769.28 s [unordered-containers] delete
  17534. 769.29 s [unordered-containers] model: OK (0.01s)
  17535. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17536. 769.29 s [unordered-containers] valid: OK
  17537. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17538. 769.29 s [unordered-containers] adjust
  17539. 769.29 s [unordered-containers] model: OK
  17540. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17541. 769.29 s [unordered-containers] valid: OK
  17542. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17543. 769.29 s [unordered-containers] update
  17544. 769.29 s [unordered-containers] model: OK (0.03s)
  17545. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17546. 769.29 s [unordered-containers] valid: OK
  17547. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17548. 769.29 s [unordered-containers] alter
  17549. 769.29 s [unordered-containers] model: OK
  17550. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17551. 769.29 s [unordered-containers] valid: OK
  17552. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17553. 769.29 s [unordered-containers] alterF
  17554. 769.29 s [unordered-containers] model
  17555. 769.29 s [unordered-containers] []: OK (0.04s)
  17556. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17557. 769.29 s [unordered-containers] adjust: OK
  17558. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17559. 769.29 s [unordered-containers] insert: OK
  17560. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17561. 769.29 s [unordered-containers] insertWith: OK
  17562. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17563. 769.29 s [unordered-containers] delete: OK
  17564. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17565. 769.29 s [unordered-containers] lookup: OK
  17566. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17567. 769.29 s [unordered-containers] valid: OK (0.03s)
  17568. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17569. 769.29 s [unordered-containers] isSubmapOf
  17570. 769.29 s [unordered-containers] model: OK (0.02s)
  17571. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17572. 769.29 s [unordered-containers] m ⊆ m: OK
  17573. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17574. 769.29 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  17575. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17576. 769.29 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17577. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17578. 769.29 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  17579. 769.29 s [unordered-containers] +++ OK, passed 100 tests; 171 discarded.
  17580. 769.29 s [unordered-containers] delete k m ⊆ m: OK
  17581. 769.29 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17582. 769.29 s [unordered-containers] m ⊈ delete k m : OK
  17583. 769.29 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  17584. 769.29 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  17585. 769.29 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  17586. 769.29 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  17587. 769.29 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  17588. 769.29 s [unordered-containers] union
  17589. 769.29 s [unordered-containers] model: OK (0.01s)
  17590. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17591. 769.29 s [unordered-containers] valid: OK
  17592. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17593. 769.29 s [unordered-containers] unionWith
  17594. 769.29 s [unordered-containers] model: OK (0.02s)
  17595. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17596. 769.29 s [unordered-containers] valid: OK (0.02s)
  17597. 769.29 s [unordered-containers] +++ OK, passed 100 tests.
  17598. 769.29 s [unordered-containers] unionWithKey
  17599. 769.32 s [unordered-containers] model: OK (0.08s)
  17600. 769.33 s [unordered-containers] +++ OK, passed 100 tests.
  17601. 769.33 s [unordered-containers] valid: OK (0.01s)
  17602. 769.33 s [unordered-containers] +++ OK, passed 100 tests.
  17603. 769.33 s [unordered-containers] unions
  17604. 769.89 s [unordered-containers] model: OK (0.64s)
  17605. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17606. 769.89 s [unordered-containers] valid: OK (0.35s)
  17607. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17608. 769.89 s [unordered-containers] difference
  17609. 769.89 s [unordered-containers] model: OK (0.01s)
  17610. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17611. 769.89 s [unordered-containers] valid: OK (0.01s)
  17612. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17613. 769.89 s [unordered-containers] differenceWith
  17614. 769.89 s [unordered-containers] model: OK (0.05s)
  17615. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17616. 769.89 s [unordered-containers] valid: OK
  17617. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17618. 769.89 s [unordered-containers] intersection
  17619. 769.89 s [unordered-containers] model: OK (0.03s)
  17620. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17621. 769.89 s [unordered-containers] valid: OK
  17622. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17623. 769.89 s [unordered-containers] intersectionWith
  17624. 769.89 s [unordered-containers] model: OK (0.03s)
  17625. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17626. 769.89 s [unordered-containers] valid: OK
  17627. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17628. 769.89 s [unordered-containers] intersectionWithKey
  17629. 769.89 s [unordered-containers] model: OK (0.08s)
  17630. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17631. 769.89 s [unordered-containers] valid: OK (0.01s)
  17632. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17633. 769.89 s [unordered-containers] compose
  17634. 769.89 s [unordered-containers] valid: OK (0.01s)
  17635. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17636. 769.89 s [unordered-containers] map
  17637. 769.89 s [unordered-containers] model: OK (0.01s)
  17638. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17639. 769.89 s [unordered-containers] valid: OK
  17640. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17641. 769.89 s [unordered-containers] traverseWithKey
  17642. 769.89 s [unordered-containers] model: OK (0.10s)
  17643. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17644. 769.89 s [unordered-containers] valid: OK
  17645. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17646. 769.89 s [unordered-containers] mapKeys
  17647. 769.89 s [unordered-containers] model: OK
  17648. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17649. 769.89 s [unordered-containers] valid: OK (0.21s)
  17650. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17651. 769.89 s [unordered-containers] foldr: OK
  17652. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17653. 769.89 s [unordered-containers] foldl: OK
  17654. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17655. 769.89 s [unordered-containers] foldrWithKey: OK
  17656. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17657. 769.89 s [unordered-containers] foldlWithKey: OK (0.07s)
  17658. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17659. 769.89 s [unordered-containers] foldrWithKey': OK (0.02s)
  17660. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17661. 769.89 s [unordered-containers] foldlWithKey': OK (0.02s)
  17662. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17663. 769.89 s [unordered-containers] foldl': OK (0.04s)
  17664. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17665. 769.89 s [unordered-containers] foldr': OK (0.01s)
  17666. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17667. 769.89 s [unordered-containers] foldMapWithKey: OK (0.01s)
  17668. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17669. 769.89 s [unordered-containers] filter
  17670. 769.89 s [unordered-containers] model: OK (0.02s)
  17671. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17672. 769.89 s [unordered-containers] valid: OK (0.02s)
  17673. 769.89 s [unordered-containers] +++ OK, passed 100 tests.
  17674. 769.89 s [unordered-containers] filterWithKey
  17675. 769.95 s [unordered-containers] model: OK (0.67s)
  17676. 769.95 s [unordered-containers] +++ OK, passed 100 tests.
  17677. 769.95 s [unordered-containers] valid: OK (0.34s)
  17678. 769.96 s [unordered-containers] +++ OK, passed 100 tests.
  17679. 769.96 s [unordered-containers] mapMaybe
  17680. 769.96 s [unordered-containers] model: OK (0.09s)
  17681. 769.96 s [unordered-containers] +++ OK, passed 100 tests.
  17682. 769.96 s [unordered-containers] valid: OK (0.03s)
  17683. 769.96 s [unordered-containers] +++ OK, passed 100 tests.
  17684. 769.96 s [unordered-containers] mapMaybeWithKey
  17685. 770.00 s [unordered-containers] model: OK (0.71s)
  17686. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17687. 770.00 s [unordered-containers] valid: OK (0.31s)
  17688. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17689. 770.00 s [unordered-containers] elems: OK (0.01s)
  17690. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17691. 770.00 s [unordered-containers] keys: OK (0.01s)
  17692. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17693. 770.00 s [unordered-containers] fromList
  17694. 770.00 s [unordered-containers] model: OK (0.02s)
  17695. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17696. 770.00 s [unordered-containers] valid: OK
  17697. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17698. 770.00 s [unordered-containers] fromListWith
  17699. 770.00 s [unordered-containers] model: OK (0.02s)
  17700. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17701. 770.00 s [unordered-containers] valid: OK (0.02s)
  17702. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17703. 770.00 s [unordered-containers] fromListWithKey
  17704. 770.00 s [unordered-containers] model: OK (0.01s)
  17705. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17706. 770.00 s [unordered-containers] valid: OK (0.01s)
  17707. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17708. 770.00 s [unordered-containers] toList: OK (0.02s)
  17709. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17710. 770.00 s [unordered-containers] Data.HashMap.Strict
  17711. 770.00 s [unordered-containers] instances
  17712. 770.00 s [unordered-containers] Eq
  17713. 770.00 s [unordered-containers] ==: OK (0.02s)
  17714. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17715. 770.00 s [unordered-containers] /=: OK (0.02s)
  17716. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17717. 770.00 s [unordered-containers] Ord
  17718. 770.00 s [unordered-containers] compare reflexive: OK (0.02s)
  17719. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17720. 770.00 s [unordered-containers] compare transitive: OK (0.02s)
  17721. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17722. 770.00 s [unordered-containers] compare antisymmetric: OK (0.03s)
  17723. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17724. 770.00 s [unordered-containers] Ord => Eq: OK (0.06s)
  17725. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17726. 770.00 s [unordered-containers] Read/Show: OK (0.19s)
  17727. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17728. 770.00 s [unordered-containers] Functor: OK (0.08s)
  17729. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17730. 770.00 s [unordered-containers] Foldable: OK (0.02s)
  17731. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17732. 770.00 s [unordered-containers] Bifoldable
  17733. 770.00 s [unordered-containers] bifoldMap: OK (0.02s)
  17734. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17735. 770.00 s [unordered-containers] bifoldr: OK (0.02s)
  17736. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17737. 770.00 s [unordered-containers] bifoldl: OK (0.03s)
  17738. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17739. 770.00 s [unordered-containers] Hashable: OK (0.03s)
  17740. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17741. 770.00 s [unordered-containers] empty
  17742. 770.00 s [unordered-containers] valid: OK
  17743. 770.00 s [unordered-containers] +++ OK, passed 1 test.
  17744. 770.00 s [unordered-containers] singleton
  17745. 770.00 s [unordered-containers] valid: OK
  17746. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17747. 770.00 s [unordered-containers] size: OK (0.02s)
  17748. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17749. 770.00 s [unordered-containers] member: OK
  17750. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17751. 770.00 s [unordered-containers] lookup: OK (0.02s)
  17752. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17753. 770.00 s [unordered-containers] !?: OK (0.01s)
  17754. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17755. 770.00 s [unordered-containers] insert
  17756. 770.00 s [unordered-containers] model: OK (0.01s)
  17757. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17758. 770.00 s [unordered-containers] valid: OK
  17759. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17760. 770.00 s [unordered-containers] insertWith
  17761. 770.00 s [unordered-containers] insertWith: OK (0.02s)
  17762. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17763. 770.00 s [unordered-containers] valid: OK
  17764. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17765. 770.00 s [unordered-containers] delete
  17766. 770.00 s [unordered-containers] model: OK (0.02s)
  17767. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17768. 770.00 s [unordered-containers] valid: OK (0.02s)
  17769. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17770. 770.00 s [unordered-containers] adjust
  17771. 770.00 s [unordered-containers] model: OK (0.01s)
  17772. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17773. 770.00 s [unordered-containers] valid: OK (0.01s)
  17774. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17775. 770.00 s [unordered-containers] update
  17776. 770.00 s [unordered-containers] model: OK
  17777. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17778. 770.00 s [unordered-containers] valid: OK (0.03s)
  17779. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17780. 770.00 s [unordered-containers] alter
  17781. 770.00 s [unordered-containers] model: OK (0.02s)
  17782. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17783. 770.00 s [unordered-containers] valid: OK (0.02s)
  17784. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17785. 770.00 s [unordered-containers] alterF
  17786. 770.00 s [unordered-containers] model
  17787. 770.00 s [unordered-containers] []: OK (0.08s)
  17788. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17789. 770.00 s [unordered-containers] adjust: OK (0.02s)
  17790. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17791. 770.00 s [unordered-containers] insert: OK (0.01s)
  17792. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17793. 770.00 s [unordered-containers] insertWith: OK (0.01s)
  17794. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17795. 770.00 s [unordered-containers] delete: OK (0.02s)
  17796. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17797. 770.00 s [unordered-containers] lookup: OK (0.02s)
  17798. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17799. 770.00 s [unordered-containers] valid: OK (0.03s)
  17800. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17801. 770.00 s [unordered-containers] isSubmapOf
  17802. 770.00 s [unordered-containers] model: OK (0.06s)
  17803. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17804. 770.00 s [unordered-containers] m ⊆ m: OK (0.02s)
  17805. 770.00 s [unordered-containers] +++ OK, passed 100 tests.
  17806. 770.00 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  17807. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17808. 770.01 s [unordered-containers] m1\m2 ⊆ m1: OK (0.02s)
  17809. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17810. 770.01 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  17811. 770.01 s [unordered-containers] +++ OK, passed 100 tests; 142 discarded.
  17812. 770.01 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  17813. 770.01 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17814. 770.01 s [unordered-containers] m ⊈ delete k m : OK (0.01s)
  17815. 770.01 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  17816. 770.01 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.02s)
  17817. 770.01 s [unordered-containers] +++ OK, passed 100 tests; 10 discarded.
  17818. 770.01 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  17819. 770.01 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  17820. 770.01 s [unordered-containers] union
  17821. 770.01 s [unordered-containers] model: OK (0.04s)
  17822. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17823. 770.01 s [unordered-containers] valid: OK (0.04s)
  17824. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17825. 770.01 s [unordered-containers] unionWith
  17826. 770.01 s [unordered-containers] model: OK (0.05s)
  17827. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17828. 770.01 s [unordered-containers] valid: OK (0.03s)
  17829. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17830. 770.01 s [unordered-containers] unionWithKey
  17831. 770.01 s [unordered-containers] model: OK (0.10s)
  17832. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17833. 770.01 s [unordered-containers] valid: OK (0.06s)
  17834. 770.01 s [unordered-containers] +++ OK, passed 100 tests.
  17835. 770.01 s [unordered-containers] unions
  17836. 770.04 s [unordered-containers] model: OK (0.56s)
  17837. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17838. 770.04 s [unordered-containers] valid: OK (0.42s)
  17839. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17840. 770.04 s [unordered-containers] difference
  17841. 770.04 s [unordered-containers] model: OK (0.02s)
  17842. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17843. 770.04 s [unordered-containers] valid: OK (0.03s)
  17844. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17845. 770.04 s [unordered-containers] differenceWith
  17846. 770.04 s [unordered-containers] model: OK (0.03s)
  17847. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17848. 770.04 s [unordered-containers] valid: OK (0.03s)
  17849. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17850. 770.04 s [unordered-containers] intersection
  17851. 770.04 s [unordered-containers] model: OK (0.02s)
  17852. 770.04 s [unordered-containers] +++ OK, passed 100 tests.
  17853. 770.05 s [unordered-containers] valid: OK
  17854. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17855. 770.05 s [unordered-containers] intersectionWith
  17856. 770.05 s [unordered-containers] model: OK (0.05s)
  17857. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17858. 770.05 s [unordered-containers] valid: OK (0.03s)
  17859. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17860. 770.05 s [unordered-containers] intersectionWithKey
  17861. 770.05 s [unordered-containers] model: OK (0.10s)
  17862. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17863. 770.05 s [unordered-containers] valid: OK (0.07s)
  17864. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17865. 770.05 s [unordered-containers] compose
  17866. 770.05 s [unordered-containers] valid: OK (0.03s)
  17867. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17868. 770.05 s [unordered-containers] map
  17869. 770.05 s [unordered-containers] model: OK (0.03s)
  17870. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17871. 770.05 s [unordered-containers] valid: OK (0.02s)
  17872. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17873. 770.05 s [unordered-containers] traverseWithKey
  17874. 770.05 s [unordered-containers] model: OK (0.17s)
  17875. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17876. 770.05 s [unordered-containers] valid: OK (0.03s)
  17877. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17878. 770.05 s [unordered-containers] mapKeys
  17879. 770.05 s [unordered-containers] model: OK (0.03s)
  17880. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17881. 770.05 s [unordered-containers] valid: OK (0.27s)
  17882. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17883. 770.05 s [unordered-containers] foldr: OK (0.01s)
  17884. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17885. 770.05 s [unordered-containers] foldl: OK (0.03s)
  17886. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17887. 770.05 s [unordered-containers] foldrWithKey: OK (0.02s)
  17888. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17889. 770.05 s [unordered-containers] foldlWithKey: OK (0.03s)
  17890. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17891. 770.05 s [unordered-containers] foldrWithKey': OK (0.01s)
  17892. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17893. 770.05 s [unordered-containers] foldlWithKey': OK (0.03s)
  17894. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17895. 770.05 s [unordered-containers] foldl': OK (0.03s)
  17896. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17897. 770.05 s [unordered-containers] foldr': OK (0.02s)
  17898. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17899. 770.05 s [unordered-containers] foldMapWithKey: OK (0.02s)
  17900. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17901. 770.05 s [unordered-containers] filter
  17902. 770.05 s [unordered-containers] model: OK (0.07s)
  17903. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17904. 770.05 s [unordered-containers] valid: OK (0.02s)
  17905. 770.05 s [unordered-containers] +++ OK, passed 100 tests.
  17906. 770.05 s [unordered-containers] filterWithKey
  17907. 770.08 s [unordered-containers] model: OK (0.47s)
  17908. 770.08 s [unordered-containers] +++ OK, passed 100 tests.
  17909. 770.08 s [unordered-containers] valid: OK (0.35s)
  17910. 770.08 s [unordered-containers] +++ OK, passed 100 tests.
  17911. 770.08 s [unordered-containers] mapMaybe
  17912. 770.08 s [unordered-containers] model: OK (0.04s)
  17913. 770.08 s [unordered-containers] +++ OK, passed 100 tests.
  17914. 770.09 s [unordered-containers] valid: OK (0.03s)
  17915. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17916. 770.09 s [unordered-containers] mapMaybeWithKey
  17917. 770.09 s [unordered-containers] model: OK (0.46s)
  17918. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17919. 770.09 s [unordered-containers] valid: OK (0.34s)
  17920. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17921. 770.09 s [unordered-containers] elems: OK (0.02s)
  17922. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17923. 770.09 s [unordered-containers] keys: OK (0.03s)
  17924. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17925. 770.09 s [unordered-containers] fromList
  17926. 770.09 s [unordered-containers] model: OK
  17927. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17928. 770.09 s [unordered-containers] valid: OK
  17929. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17930. 770.09 s [unordered-containers] fromListWith
  17931. 770.09 s [unordered-containers] model: OK (0.02s)
  17932. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17933. 770.09 s [unordered-containers] valid: OK (0.01s)
  17934. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17935. 770.09 s [unordered-containers] fromListWithKey
  17936. 770.09 s [unordered-containers] model: OK
  17937. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17938. 770.09 s [unordered-containers] valid: OK (0.04s)
  17939. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17940. 770.09 s [unordered-containers] toList: OK (0.02s)
  17941. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17942. 770.09 s [unordered-containers] Data.HashSet
  17943. 770.09 s [unordered-containers] instances
  17944. 770.09 s [unordered-containers] Eq
  17945. 770.09 s [unordered-containers] ==: OK (0.02s)
  17946. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17947. 770.09 s [unordered-containers] == permutations: OK (0.03s)
  17948. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17949. 770.09 s [unordered-containers] /=: OK (0.03s)
  17950. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17951. 770.09 s [unordered-containers] Ord
  17952. 770.09 s [unordered-containers] compare reflexive: OK
  17953. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17954. 770.09 s [unordered-containers] compare transitive: OK (0.03s)
  17955. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17956. 770.09 s [unordered-containers] compare antisymmetric: OK
  17957. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17958. 770.09 s [unordered-containers] Ord => Eq: OK (0.03s)
  17959. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17960. 770.09 s [unordered-containers] Read/Show: OK (0.17s)
  17961. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17962. 770.09 s [unordered-containers] Foldable: OK (0.01s)
  17963. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17964. 770.09 s [unordered-containers] Hashable: OK (0.01s)
  17965. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17966. 770.09 s [unordered-containers] size: OK
  17967. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17968. 770.09 s [unordered-containers] member: OK (0.01s)
  17969. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17970. 770.09 s [unordered-containers] insert: OK (0.01s)
  17971. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17972. 770.09 s [unordered-containers] delete: OK (0.02s)
  17973. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17974. 770.09 s [unordered-containers] union: OK (0.05s)
  17975. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17976. 770.09 s [unordered-containers] map: OK (0.25s)
  17977. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17978. 770.09 s [unordered-containers] foldr: OK
  17979. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17980. 770.09 s [unordered-containers] foldl': OK (0.01s)
  17981. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17982. 770.09 s [unordered-containers] filter: OK (0.30s)
  17983. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17984. 770.09 s [unordered-containers] toList: OK (0.01s)
  17985. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17986. 770.09 s [unordered-containers] Data.HashMap.Internal.List
  17987. 770.09 s [unordered-containers] isPermutationBy: OK
  17988. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17989. 770.09 s [unordered-containers] isPermutationBy of different length: OK
  17990. 770.09 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  17991. 770.09 s [unordered-containers] pUnorderedCompare: OK (0.05s)
  17992. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17993. 770.09 s [unordered-containers] modelUnorderedCompare
  17994. 770.09 s [unordered-containers] reflexive: OK
  17995. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17996. 770.09 s [unordered-containers] anti-symmetric: OK (0.01s)
  17997. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  17998. 770.09 s [unordered-containers] transitive: OK
  17999. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18000. 770.09 s [unordered-containers] Regression tests
  18001. 770.09 s [unordered-containers] issue32: OK
  18002. 770.09 s [unordered-containers] issue39a: OK
  18003. 770.09 s [unordered-containers] issue39b: OK (0.01s)
  18004. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18005. 770.09 s [unordered-containers] issue254 lazy: OK (0.01s)
  18006. 770.09 s [unordered-containers] issue254 strict: OK
  18007. 770.09 s [unordered-containers] issue379
  18008. 770.09 s [unordered-containers] Lazy.unionWith: OK
  18009. 770.09 s [unordered-containers] union: OK
  18010. 770.09 s [unordered-containers] Strict.unionWith: OK
  18011. 770.09 s [unordered-containers] Strict.unionWithKey: OK
  18012. 770.09 s [unordered-containers] issue381
  18013. 770.09 s [unordered-containers] mapMaybe: OK
  18014. 770.09 s [unordered-containers] mapMaybeWithKey: OK
  18015. 770.09 s [unordered-containers] issue382: OK
  18016. 770.09 s [unordered-containers] issue383: OK
  18017. 770.09 s [unordered-containers] issue420: OK
  18018. 770.09 s [unordered-containers] issue491
  18019. 770.09 s [unordered-containers] 1: OK
  18020. 770.09 s [unordered-containers] 2: OK
  18021. 770.09 s [unordered-containers] 3: OK
  18022. 770.09 s [unordered-containers] Strictness
  18023. 770.09 s [unordered-containers] HashMap.Strict
  18024. 770.09 s [unordered-containers] singleton is key-strict: OK
  18025. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18026. 770.09 s [unordered-containers] singleton is value-strict: OK
  18027. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18028. 770.09 s [unordered-containers] member is key-strict: OK
  18029. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18030. 770.09 s [unordered-containers] lookup is key-strict: OK
  18031. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18032. 770.09 s [unordered-containers] lookupDefault is key-strict: OK
  18033. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18034. 770.09 s [unordered-containers] findWithDefault is key-strict: OK
  18035. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18036. 770.09 s [unordered-containers] ! is key-strict: OK
  18037. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18038. 770.09 s [unordered-containers] delete is key-strict: OK
  18039. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18040. 770.09 s [unordered-containers] adjust is key-strict: OK
  18041. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18042. 770.09 s [unordered-containers] adjust is value-strict: OK
  18043. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18044. 770.09 s [unordered-containers] insert is key-strict: OK
  18045. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18046. 770.09 s [unordered-containers] insert is value-strict: OK
  18047. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18048. 770.09 s [unordered-containers] insertWith is key-strict: OK
  18049. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18050. 770.09 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  18051. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18052. 770.09 s [unordered-containers] fromList is key-strict: OK
  18053. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18054. 770.09 s [unordered-containers] fromList is value-strict: OK
  18055. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18056. 770.09 s [unordered-containers] fromListWith is key-strict: OK
  18057. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18058. 770.09 s [unordered-containers] fromListWith is value-strict: OK (0.01s)
  18059. 770.09 s [unordered-containers] +++ OK, passed 100 tests.
  18060. 770.09 s [unordered-containers]
  18061. 770.09 s [unordered-containers] All 257 tests passed (0.88s)
  18062. 770.11 s [unordered-containers] Test suite unordered-containers-tests: PASS
  18063. 770.11 s [unordered-containers] Test suite logged to:
  18064. 770.11 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  18065. 770.11 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  18066. 770.11 s [unordered-containers] Phase: haddockPhase
  18067. 770.24 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1..
  18068. 770.25 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1..
  18069. 770.30 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18070. 770.43 s [unordered-containers]
  18071. 770.43 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [-Wdeprecated-flags]
  18072. 770.43 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  18073. 770.43 s [unordered-containers] |
  18074. 770.43 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  18075. 770.43 s [unordered-containers] | ^^^^^^^^^^
  18076. 770.73 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  18077. 770.73 s [unordered-containers] Missing documentation for:
  18078. 770.73 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  18079. 770.73 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  18080. 770.73 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:207)
  18081. 770.73 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:224)
  18082. 770.73 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:228)
  18083. 770.73 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:232)
  18084. 770.73 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:241)
  18085. 770.73 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:153)
  18086. 770.73 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:161)
  18087. 770.73 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:248)
  18088. 770.73 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:254)
  18089. 770.73 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:261)
  18090. 770.73 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:273)
  18091. 770.73 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:267)
  18092. 770.73 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:139)
  18093. 770.73 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:279)
  18094. 770.73 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:285)
  18095. 770.73 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:135)
  18096. 770.73 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:291)
  18097. 770.73 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:313)
  18098. 770.73 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:403)
  18099. 770.73 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:374)
  18100. 770.73 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:393)
  18101. 770.73 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:384)
  18102. 770.73 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:416)
  18103. 770.73 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:435)
  18104. 770.73 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:460)
  18105. 770.73 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:536)
  18106. 770.73 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:552)
  18107. 770.73 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:528)
  18108. 770.73 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:493)
  18109. 770.73 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:505)
  18110. 770.79 s [unordered-containers]
  18111. 770.79 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [-Wunused-imports]
  18112. 770.79 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  18113. 770.79 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  18114. 770.79 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  18115. 770.79 s [unordered-containers] |
  18116. 770.79 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  18117. 770.79 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  18118. 770.86 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  18119. 770.86 s [unordered-containers] Missing documentation for:
  18120. 770.86 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:39)
  18121. 770.86 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:82)
  18122. 770.86 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:67)
  18123. 771.19 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  18124. 771.19 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  18125. 771.19 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  18126. 771.19 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  18127. 771.19 s [unordered-containers] by specifying the type/value namespace explicitly.
  18128. 771.19 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  18129. 771.19 s [unordered-containers] Warning: 'at' is out of scope.
  18130. 771.19 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18131. 771.20 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  18132. 771.20 s [unordered-containers] Missing documentation for:
  18133. 771.20 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  18134. 771.20 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1858)
  18135. 771.20 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2372)
  18136. 771.20 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:512)
  18137. 771.20 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:496)
  18138. 771.20 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:679)
  18139. 771.20 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  18140. 771.20 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:661)
  18141. 771.20 s [unordered-containers] insert' (Data/HashMap/Internal.hs:807)
  18142. 771.20 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1125)
  18143. 771.20 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:849)
  18144. 771.20 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:884)
  18145. 771.72 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  18146. 771.72 s [unordered-containers] Missing documentation for:
  18147. 771.72 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:97)
  18148. 771.72 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  18149. 771.72 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  18150. 771.80 s [unordered-containers] Warning: 'lookup' is out of scope.
  18151. 771.80 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18152. 771.80 s [unordered-containers] Warning: 'at' is out of scope.
  18153. 771.80 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  18154. 771.80 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  18155. 771.91 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  18156. 771.96 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  18157. 771.96 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  18158. 771.97 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  18159. 775.65 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  18160. 775.65 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  18161. 775.82 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1..
  18162. 775.82 s [unordered-containers] Phase: installPhase
  18163. 775.82 s [unordered-containers] Installing library in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18164. 776.31 s [unordered-containers] Phase: fixupPhase
  18165. 776.34 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18166. 776.35 s [unordered-containers] shrinking /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSunordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM-ghc9.6.7.so
  18167. 776.37 s [unordered-containers] checking for references to /build/ in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1...
  18168. 776.40 s [unordered-containers] patching script interpreter paths in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18169. 776.41 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1/lib
  18170. 776.59 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc
  18171. 776.62 s [unordered-containers] checking for references to /build/ in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc...
  18172. 776.65 s [unordered-containers] patching script interpreter paths in /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc
  18173. 776.82 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18174. 777.46 s [unordered-containers:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  18175. 777.46 s [unordered-containers:post-build]
  18176. 777.82 s [unordered-containers:post-build] Pushing /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc (4.49 MiB)
  18177. 777.90 s [unordered-containers:post-build] Pushing /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1 (9.38 MiB)
  18178. 778.92 s [unordered-containers:post-build]
  18179. 778.92 s [unordered-containers:post-build] All done.
  18180. 778.94 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc /nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1
  18181. 778.99 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18182. 779.25 s [unordered-containers:post-build] copying 2 paths...
  18183. 779.25 s [unordered-containers:post-build] copying path '/nix/store/2cl5in0x8b0jlys44fy13l2hlbfflq9r-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  18184. 779.90 s [unordered-containers:post-build] copying path '/nix/store/5qwpqs2rqkqdg3cr2fzav5w0sd0czbnq-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  18185. 782.71 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18186. 782.98 s [unordered-containers:post-build] copying 1 paths...
  18187. 783.02 s [unordered-containers:post-build] copying path '/nix/store/r6c54pd7rjdnrnb1680lxsm637gx7aas-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  18188. 783.22 s Progress: 11 of 19 built, 73 of 73 downloaded from cache
  18189. 783.27 s Building /nix/store/mhwhijz5wvy4bhp1z51p2l6vbhw1cfkk-quickcheck-instances-0.3.33.drv
  18190. 783.42 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  18191. 783.43 s [quickcheck-instances] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  18192. 783.64 s [quickcheck-instances] Phase: unpackPhase
  18193. 783.64 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  18194. 783.65 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  18195. 783.65 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  18196. 783.66 s [quickcheck-instances] Phase: patchPhase
  18197. 783.66 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  18198. 783.68 s [quickcheck-instances] Phase: compileBuildDriverPhase
  18199. 783.68 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.xsB3HyXzg7/setup-package.conf.d -threaded
  18200. 783.74 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.xsB3HyXzg7/Main.o )
  18201. 783.82 s [quickcheck-instances] [2 of 2] Linking Setup
  18202. 785.18 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  18203. 785.19 s [quickcheck-instances] Phase: configurePhase
  18204. 785.19 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.xsB3HyXzg7/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18205. 785.20 s [quickcheck-instances] Using Parsec parser
  18206. 785.20 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  18207. 785.53 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  18208. 785.53 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  18209. 785.53 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  18210. 785.53 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.18.3.0
  18211. 785.53 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.11.5.4
  18212. 785.54 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  18213. 785.54 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.7
  18214. 785.54 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  18215. 785.54 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  18216. 785.54 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  18217. 785.54 s [quickcheck-instances] integer-logarithms-1.0.4
  18218. 785.54 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  18219. 785.54 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  18220. 785.54 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  18221. 785.54 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  18222. 785.54 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  18223. 785.54 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  18224. 785.54 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.0.2
  18225. 785.54 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  18226. 785.54 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  18227. 785.54 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  18228. 785.54 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  18229. 785.54 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  18230. 785.54 s [quickcheck-instances] unordered-containers-0.2.20.1
  18231. 785.54 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  18232. 785.54 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  18233. 785.54 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  18234. 785.54 s [quickcheck-instances] Dependency base: using base-4.18.3.0
  18235. 785.54 s [quickcheck-instances] Dependency containers: using containers-0.6.7
  18236. 785.54 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  18237. 785.54 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  18238. 785.54 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  18239. 785.54 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  18240. 785.88 s [quickcheck-instances] Source component graph:
  18241. 785.88 s [quickcheck-instances] component lib
  18242. 785.88 s [quickcheck-instances] component test:self-test dependency lib
  18243. 785.88 s [quickcheck-instances] Configured component graph:
  18244. 785.88 s [quickcheck-instances] component quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18245. 785.88 s [quickcheck-instances] include OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18246. 785.88 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18247. 785.88 s [quickcheck-instances] include array-0.5.8.0
  18248. 785.88 s [quickcheck-instances] include base-4.18.3.0
  18249. 785.88 s [quickcheck-instances] include bytestring-0.11.5.4
  18250. 785.88 s [quickcheck-instances] include case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18251. 785.88 s [quickcheck-instances] include containers-0.6.7
  18252. 785.88 s [quickcheck-instances] include data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18253. 785.88 s [quickcheck-instances] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18254. 785.88 s [quickcheck-instances] include integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18255. 785.88 s [quickcheck-instances] include old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18256. 785.88 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18257. 785.88 s [quickcheck-instances] include scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18258. 785.88 s [quickcheck-instances] include splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18259. 785.88 s [quickcheck-instances] include strict-0.5.1-BVr8qLht12993kusR3GXIV
  18260. 785.88 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18261. 785.88 s [quickcheck-instances] include text-2.0.2
  18262. 785.88 s [quickcheck-instances] include text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18263. 785.88 s [quickcheck-instances] include these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18264. 785.88 s [quickcheck-instances] include time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18265. 785.88 s [quickcheck-instances] include transformers-0.6.1.0
  18266. 785.88 s [quickcheck-instances] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18267. 785.88 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18268. 785.88 s [quickcheck-instances] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18269. 785.89 s [quickcheck-instances] component quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18270. 785.89 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18271. 785.89 s [quickcheck-instances] include base-4.18.3.0
  18272. 785.89 s [quickcheck-instances] include containers-0.6.7
  18273. 785.89 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18274. 785.89 s [quickcheck-instances] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18275. 785.89 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18276. 785.89 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18277. 785.89 s [quickcheck-instances] Linked component graph:
  18278. 785.89 s [quickcheck-instances] unit quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18279. 785.89 s [quickcheck-instances] include OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18280. 785.89 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18281. 785.89 s [quickcheck-instances] include array-0.5.8.0
  18282. 785.89 s [quickcheck-instances] include base-4.18.3.0
  18283. 785.89 s [quickcheck-instances] include bytestring-0.11.5.4
  18284. 785.89 s [quickcheck-instances] include case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18285. 785.89 s [quickcheck-instances] include containers-0.6.7
  18286. 785.89 s [quickcheck-instances] include data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18287. 785.89 s [quickcheck-instances] include hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18288. 785.89 s [quickcheck-instances] include integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18289. 785.89 s [quickcheck-instances] include old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18290. 785.89 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18291. 785.89 s [quickcheck-instances] include scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18292. 785.89 s [quickcheck-instances] include splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18293. 785.89 s [quickcheck-instances] include strict-0.5.1-BVr8qLht12993kusR3GXIV
  18294. 785.89 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18295. 785.89 s [quickcheck-instances] include text-2.0.2
  18296. 785.89 s [quickcheck-instances] include text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18297. 785.89 s [quickcheck-instances] include these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18298. 785.89 s [quickcheck-instances] include time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18299. 785.89 s [quickcheck-instances] include transformers-0.6.1.0
  18300. 785.89 s [quickcheck-instances] include unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18301. 785.89 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18302. 785.89 s [quickcheck-instances] include vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18303. 785.89 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG:Test.QuickCheck.Instances.Void
  18304. 785.89 s [quickcheck-instances] unit quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18305. 785.89 s [quickcheck-instances] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18306. 785.89 s [quickcheck-instances] include base-4.18.3.0
  18307. 785.89 s [quickcheck-instances] include containers-0.6.7
  18308. 785.89 s [quickcheck-instances] include primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18309. 785.89 s [quickcheck-instances] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18310. 785.89 s [quickcheck-instances] include tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18311. 785.89 s [quickcheck-instances] include uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18312. 785.89 s [quickcheck-instances] Ready component graph:
  18313. 785.89 s [quickcheck-instances] definite quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18314. 785.89 s [quickcheck-instances] depends OneTuple-0.4.2-E6LMDiDR57u1sdMFWqvEaZ
  18315. 785.89 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18316. 785.89 s [quickcheck-instances] depends array-0.5.8.0
  18317. 785.89 s [quickcheck-instances] depends base-4.18.3.0
  18318. 785.89 s [quickcheck-instances] depends bytestring-0.11.5.4
  18319. 785.89 s [quickcheck-instances] depends case-insensitive-1.2.1.0-GWWJ6ZWVp6tA7ngBCihzBU
  18320. 785.89 s [quickcheck-instances] depends containers-0.6.7
  18321. 785.89 s [quickcheck-instances] depends data-fix-0.3.4-AcAPhugfrDwIDrYImKkD5s
  18322. 785.89 s [quickcheck-instances] depends hashable-1.5.0.0-II7DXkzNtxH8nnlaFY2yyd
  18323. 785.89 s [quickcheck-instances] depends integer-logarithms-1.0.4-Kqj40tLB9M5QvuRzlkGw5
  18324. 785.89 s [quickcheck-instances] depends old-time-1.1.0.4-7AzLy2qj38ABPDdVX4FG2O
  18325. 785.89 s [quickcheck-instances] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18326. 785.89 s [quickcheck-instances] depends scientific-0.3.8.0-FOrGyw7jA1i5To2VDVtr2u
  18327. 785.89 s [quickcheck-instances] depends splitmix-0.1.3.1-JNqGhIvJBLcIrlYC1TgNv5
  18328. 785.89 s [quickcheck-instances] depends strict-0.5.1-BVr8qLht12993kusR3GXIV
  18329. 785.89 s [quickcheck-instances] depends tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18330. 785.89 s [quickcheck-instances] depends text-2.0.2
  18331. 785.89 s [quickcheck-instances] depends text-short-0.1.6-ClzZv9zBabOFPQm5gd1kWn
  18332. 785.89 s [quickcheck-instances] depends these-1.2.1-JLGGsXaGNeM2KSRfWwKtkj
  18333. 785.89 s [quickcheck-instances] depends time-compat-1.9.8-CD8fmPidPr6BzOD9ykPsxD
  18334. 785.89 s [quickcheck-instances] depends transformers-0.6.1.0
  18335. 785.89 s [quickcheck-instances] depends unordered-containers-0.2.20.1-6qkUm67GmzqFcEjp5sJNgM
  18336. 785.89 s [quickcheck-instances] depends uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18337. 785.89 s [quickcheck-instances] depends vector-0.13.2.0-3No4Y3iptNDJgxyVLpyx4I
  18338. 785.89 s [quickcheck-instances] definite quickcheck-instances-0.3.33-Hfj2WsaCXK7JsuTXgkyNSA-self-test
  18339. 785.89 s [quickcheck-instances] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18340. 785.89 s [quickcheck-instances] depends base-4.18.3.0
  18341. 785.89 s [quickcheck-instances] depends containers-0.6.7
  18342. 785.89 s [quickcheck-instances] depends primitive-0.9.1.0-AElAOg7RWPrK8TD1mt4mft
  18343. 785.89 s [quickcheck-instances] depends quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18344. 785.90 s [quickcheck-instances] depends tagged-0.8.9-KUDtXXtqGKP9XaJY0E80bP
  18345. 785.90 s [quickcheck-instances] depends uuid-types-1.0.6-7gd88fgJIsD4NjBUsU0Bzn
  18346. 785.90 s [quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.6
  18347. 785.90 s [quickcheck-instances] Using compiler: ghc-9.6.7
  18348. 785.90 s [quickcheck-instances] Using install prefix:
  18349. 785.90 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18350. 785.90 s [quickcheck-instances] Executables installed in:
  18351. 785.90 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/bin
  18352. 785.90 s [quickcheck-instances] Libraries installed in:
  18353. 785.90 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18354. 785.91 s [quickcheck-instances] Dynamic Libraries installed in:
  18355. 785.91 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  18356. 785.91 s [quickcheck-instances] Private executables installed in:
  18357. 785.91 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33
  18358. 785.91 s [quickcheck-instances] Data files installed in:
  18359. 785.91 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33
  18360. 785.91 s [quickcheck-instances] Documentation installed in:
  18361. 785.91 s [quickcheck-instances] /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  18362. 785.91 s [quickcheck-instances] Configuration files installed in:
  18363. 785.91 s [quickcheck-instances] /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/etc
  18364. 785.91 s [quickcheck-instances] No alex found
  18365. 785.91 s [quickcheck-instances] Using ar found on system at:
  18366. 785.91 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18367. 785.91 s [quickcheck-instances] No c2hs found
  18368. 785.91 s [quickcheck-instances] No cpphs found
  18369. 785.91 s [quickcheck-instances] No doctest found
  18370. 785.91 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  18371. 785.91 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18372. 785.91 s [quickcheck-instances] Using ghc version 9.6.7 found on system at:
  18373. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  18374. 785.91 s [quickcheck-instances] Using ghc-pkg version 9.6.7 found on system at:
  18375. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  18376. 785.91 s [quickcheck-instances] No ghcjs found
  18377. 785.91 s [quickcheck-instances] No ghcjs-pkg found
  18378. 785.91 s [quickcheck-instances] No greencard found
  18379. 785.91 s [quickcheck-instances] Using haddock version 2.29.2 found on system at:
  18380. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  18381. 785.91 s [quickcheck-instances] No happy found
  18382. 785.91 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  18383. 785.91 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18384. 785.91 s [quickcheck-instances] No hmake found
  18385. 785.91 s [quickcheck-instances] Using hpc version 0.68 found on system at:
  18386. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  18387. 785.91 s [quickcheck-instances] Using hsc2hs version 0.68.9 found on system at:
  18388. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  18389. 785.91 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  18390. 785.91 s [quickcheck-instances] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  18391. 785.91 s [quickcheck-instances] No jhc found
  18392. 785.91 s [quickcheck-instances] Using ld found on system at:
  18393. 785.91 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18394. 785.91 s [quickcheck-instances] No pkg-config found
  18395. 785.91 s [quickcheck-instances] Using runghc version 9.6.7 found on system at:
  18396. 785.91 s [quickcheck-instances] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  18397. 785.91 s [quickcheck-instances] Using strip version 2.44 found on system at:
  18398. 785.91 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18399. 785.91 s [quickcheck-instances] Using tar found on system at:
  18400. 785.91 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18401. 785.91 s [quickcheck-instances] No uhc found
  18402. 786.34 s [quickcheck-instances] Phase: buildPhase
  18403. 786.53 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18404. 786.55 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33..
  18405. 786.67 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 )
  18406. 786.72 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 )
  18407. 786.92 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 )
  18408. 787.00 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 )
  18409. 787.00 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 )
  18410. 787.30 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 )
  18411. 787.30 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 )
  18412. 787.30 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 )
  18413. 787.30 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 )
  18414. 787.30 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 )
  18415. 787.30 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 )
  18416. 787.30 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 )
  18417. 787.30 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 )
  18418. 787.30 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 )
  18419. 787.30 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 )
  18420. 787.31 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 )
  18421. 787.31 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 )
  18422. 787.31 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 )
  18423. 787.31 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 )
  18424. 787.31 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 )
  18425. 787.74 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 )
  18426. 787.74 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 )
  18427. 787.74 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 )
  18428. 787.74 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 )
  18429. 787.74 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 )
  18430. 787.74 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 )
  18431. 788.04 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 )
  18432. 788.20 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 )
  18433. 788.21 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 )
  18434. 788.52 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 )
  18435. 788.67 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 )
  18436. 788.68 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 )
  18437. 788.68 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 )
  18438. 788.68 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 )
  18439. 788.68 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 )
  18440. 789.02 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 )
  18441. 789.02 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 )
  18442. 789.02 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 )
  18443. 789.02 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 )
  18444. 789.02 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 )
  18445. 789.02 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 )
  18446. 789.02 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 )
  18447. 789.02 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 )
  18448. 789.02 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 )
  18449. 789.02 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 )
  18450. 789.02 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 )
  18451. 789.61 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 )
  18452. 789.61 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 )
  18453. 789.61 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 )
  18454. 789.61 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 )
  18455. 789.61 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 )
  18456. 789.61 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  18457. 791.52 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18458. 791.52 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33..
  18459. 791.58 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  18460. 792.22 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  18461. 793.30 s [quickcheck-instances] Phase: checkPhase
  18462. 793.33 s [quickcheck-instances] Running 1 test suites...
  18463. 793.33 s [quickcheck-instances] Test suite self-test: RUNNING...
  18464. 793.37 s [quickcheck-instances] +++ OK, passed 100 tests.
  18465. 793.37 s [quickcheck-instances] +++ OK, passed 100 tests.
  18466. 793.37 s [quickcheck-instances] +++ OK, passed 100 tests.
  18467. 793.37 s [quickcheck-instances] +++ OK, passed 100 tests.
  18468. 793.37 s [quickcheck-instances] +++ OK, passed 100 tests.
  18469. 793.37 s [quickcheck-instances] Test suite self-test: PASS
  18470. 793.37 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  18471. 793.37 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  18472. 793.37 s [quickcheck-instances] Phase: haddockPhase
  18473. 793.55 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33..
  18474. 793.57 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33..
  18475. 793.57 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  18476. 793.57 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  18477. 793.65 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  18478. 793.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  18479. 793.90 s [quickcheck-instances] Missing documentation for:
  18480. 793.90 s [quickcheck-instances] Module header
  18481. 794.13 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  18482. 794.13 s [quickcheck-instances] Missing documentation for:
  18483. 794.13 s [quickcheck-instances] Module header
  18484. 794.17 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  18485. 794.17 s [quickcheck-instances] Missing documentation for:
  18486. 794.17 s [quickcheck-instances] Module header
  18487. 794.19 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  18488. 794.19 s [quickcheck-instances] Missing documentation for:
  18489. 794.19 s [quickcheck-instances] Module header
  18490. 794.20 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  18491. 794.20 s [quickcheck-instances] Missing documentation for:
  18492. 794.20 s [quickcheck-instances] Module header
  18493. 794.21 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  18494. 794.21 s [quickcheck-instances] Missing documentation for:
  18495. 794.21 s [quickcheck-instances] Module header
  18496. 794.22 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  18497. 794.22 s [quickcheck-instances] Missing documentation for:
  18498. 794.22 s [quickcheck-instances] Module header
  18499. 794.23 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  18500. 794.23 s [quickcheck-instances] Missing documentation for:
  18501. 794.23 s [quickcheck-instances] Module header
  18502. 794.28 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  18503. 794.28 s [quickcheck-instances] Missing documentation for:
  18504. 794.28 s [quickcheck-instances] Module header
  18505. 794.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  18506. 794.29 s [quickcheck-instances] Missing documentation for:
  18507. 794.29 s [quickcheck-instances] Module header
  18508. 794.29 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  18509. 794.29 s [quickcheck-instances] Missing documentation for:
  18510. 794.29 s [quickcheck-instances] Module header
  18511. 794.40 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  18512. 794.40 s [quickcheck-instances] Missing documentation for:
  18513. 794.40 s [quickcheck-instances] Module header
  18514. 794.42 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  18515. 794.42 s [quickcheck-instances] Missing documentation for:
  18516. 794.42 s [quickcheck-instances] Module header
  18517. 794.45 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  18518. 794.45 s [quickcheck-instances] Missing documentation for:
  18519. 794.45 s [quickcheck-instances] Module header
  18520. 794.52 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  18521. 794.52 s [quickcheck-instances] Missing documentation for:
  18522. 794.52 s [quickcheck-instances] Module header
  18523. 794.53 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  18524. 794.53 s [quickcheck-instances] Missing documentation for:
  18525. 794.53 s [quickcheck-instances] Module header
  18526. 794.54 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  18527. 794.54 s [quickcheck-instances] Missing documentation for:
  18528. 794.54 s [quickcheck-instances] Module header
  18529. 794.55 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  18530. 794.55 s [quickcheck-instances] Missing documentation for:
  18531. 794.55 s [quickcheck-instances] Module header
  18532. 794.62 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  18533. 794.62 s [quickcheck-instances] Missing documentation for:
  18534. 794.62 s [quickcheck-instances] Module header
  18535. 794.67 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  18536. 794.67 s [quickcheck-instances] Missing documentation for:
  18537. 794.67 s [quickcheck-instances] Module header
  18538. 794.70 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  18539. 794.70 s [quickcheck-instances] Missing documentation for:
  18540. 794.70 s [quickcheck-instances] Module header
  18541. 794.73 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  18542. 794.73 s [quickcheck-instances] Missing documentation for:
  18543. 794.74 s [quickcheck-instances] Module header
  18544. 794.93 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  18545. 794.93 s [quickcheck-instances] Missing documentation for:
  18546. 794.93 s [quickcheck-instances] Module header
  18547. 794.95 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  18548. 794.95 s [quickcheck-instances] Missing documentation for:
  18549. 794.95 s [quickcheck-instances] Module header
  18550. 794.96 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  18551. 795.75 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  18552. 795.75 s [quickcheck-instances] - Data.Vector.Vector
  18553. 795.75 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  18554. 795.75 s [quickcheck-instances] - Data.Vector.Storable.Vector
  18555. 795.75 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  18556. 795.75 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  18557. 795.75 s [quickcheck-instances] - Data.Vector.Strict.Vector
  18558. 799.73 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  18559. 799.79 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  18560. 799.79 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33..
  18561. 799.80 s [quickcheck-instances] Phase: installPhase
  18562. 799.87 s [quickcheck-instances] Installing library in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18563. 800.42 s [quickcheck-instances] Phase: fixupPhase
  18564. 800.44 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18565. 800.44 s [quickcheck-instances] shrinking /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSquickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG-ghc9.6.7.so
  18566. 800.47 s [quickcheck-instances] checking for references to /build/ in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33...
  18567. 800.50 s [quickcheck-instances] patching script interpreter paths in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33
  18568. 800.51 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33/lib
  18569. 800.64 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18570. 800.65 s [quickcheck-instances] checking for references to /build/ in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc...
  18571. 800.68 s [quickcheck-instances] patching script interpreter paths in /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18572. 800.80 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18573. 801.38 s [quickcheck-instances:post-build] Pushing 2 paths (134 are already present) using zstd to cache sellout ⏳
  18574. 801.38 s [quickcheck-instances:post-build]
  18575. 801.77 s [quickcheck-instances:post-build] Pushing /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc (1.50 MiB)
  18576. 801.93 s [quickcheck-instances:post-build] Pushing /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 (5.53 MiB)
  18577. 803.03 s [quickcheck-instances:post-build]
  18578. 803.03 s [quickcheck-instances:post-build] All done.
  18579. 803.05 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33 /nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc
  18580. 803.10 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18581. 803.32 s [quickcheck-instances:post-build] copying 2 paths...
  18582. 803.32 s [quickcheck-instances:post-build] copying path '/nix/store/fdlrrpdf05a38rjf5g9wxk7f9d1mr1xm-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  18583. 803.74 s [quickcheck-instances:post-build] copying path '/nix/store/6z7s99zvw3j5k9b1ivmi5l6gh640ssxb-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  18584. 805.29 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  18585. 805.57 s [quickcheck-instances:post-build] copying 1 paths...
  18586. 805.61 s [quickcheck-instances:post-build] copying path '/nix/store/mhwhijz5wvy4bhp1z51p2l6vbhw1cfkk-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  18587. 805.82 s Progress: 12 of 19 built, 73 of 73 downloaded from cache
  18588. 805.86 s Building /nix/store/3rrsnsd4hgj7rn4hwa31j58wlp8sw3px-extra-1.8.1.drv
  18589. 806.00 s [extra] Phase: setupCompilerEnvironmentPhase
  18590. 806.01 s [extra] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  18591. 806.21 s [extra] Phase: unpackPhase
  18592. 806.21 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  18593. 806.22 s [extra] source root is extra-1.8.1
  18594. 806.23 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  18595. 806.23 s [extra] Phase: patchPhase
  18596. 806.24 s [extra] Phase: compileBuildDriverPhase
  18597. 806.24 s [extra] setupCompileFlags: -package-db=/build/tmp.N8WLUyMjlf/setup-package.conf.d -threaded
  18598. 806.30 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.N8WLUyMjlf/Main.o )
  18599. 806.34 s [extra] [2 of 2] Linking Setup
  18600. 807.58 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  18601. 807.59 s [extra] Phase: configurePhase
  18602. 807.59 s [extra] configureFlags: --verbose --prefix=/nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.N8WLUyMjlf/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  18603. 807.60 s [extra] Using Parsec parser
  18604. 807.60 s [extra] Configuring extra-1.8.1...
  18605. 807.95 s [extra] Dependency base >=4.9 && <5: using base-4.18.3.0
  18606. 807.95 s [extra] Dependency clock >=0.7: using clock-0.8.4
  18607. 807.95 s [extra] Dependency directory: using directory-1.3.8.5
  18608. 807.95 s [extra] Dependency filepath: using filepath-1.4.301.0
  18609. 807.95 s [extra] Dependency process: using process-1.6.19.0
  18610. 807.95 s [extra] Dependency time: using time-1.12.2
  18611. 807.95 s [extra] Dependency unix: using unix-2.8.6.0
  18612. 807.95 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  18613. 807.95 s [extra] Dependency base >=4 && <5: using base-4.18.3.0
  18614. 807.95 s [extra] Dependency directory: using directory-1.3.8.5
  18615. 807.95 s [extra] Dependency extra: using extra-1.8.1
  18616. 807.95 s [extra] Dependency filepath: using filepath-1.4.301.0
  18617. 807.95 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  18618. 807.95 s [extra] Dependency unix: using unix-2.8.6.0
  18619. 808.25 s [extra] Source component graph:
  18620. 808.25 s [extra] component lib
  18621. 808.25 s [extra] component test:extra-test dependency lib
  18622. 808.25 s [extra] Configured component graph:
  18623. 808.25 s [extra] component extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18624. 808.25 s [extra] include base-4.18.3.0
  18625. 808.25 s [extra] include clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18626. 808.25 s [extra] include directory-1.3.8.5
  18627. 808.25 s [extra] include filepath-1.4.301.0
  18628. 808.25 s [extra] include process-1.6.19.0
  18629. 808.25 s [extra] include time-1.12.2
  18630. 808.25 s [extra] include unix-2.8.6.0
  18631. 808.25 s [extra] component extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18632. 808.25 s [extra] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18633. 808.25 s [extra] include base-4.18.3.0
  18634. 808.25 s [extra] include directory-1.3.8.5
  18635. 808.25 s [extra] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18636. 808.25 s [extra] include filepath-1.4.301.0
  18637. 808.25 s [extra] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18638. 808.25 s [extra] include unix-2.8.6.0
  18639. 808.25 s [extra] Linked component graph:
  18640. 808.25 s [extra] unit extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18641. 808.25 s [extra] include base-4.18.3.0
  18642. 808.25 s [extra] include clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18643. 808.25 s [extra] include directory-1.3.8.5
  18644. 808.25 s [extra] include filepath-1.4.301.0
  18645. 808.25 s [extra] include process-1.6.19.0
  18646. 808.25 s [extra] include time-1.12.2
  18647. 808.25 s [extra] include unix-2.8.6.0
  18648. 808.25 s [extra] Control.Concurrent.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Data.Version.Extra,Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Extra,Numeric.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Numeric.Extra,System.Directory.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Environment.Extra,System.IO.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.IO.Extra,System.Info.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Info.Extra,System.Process.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Process.Extra,System.Time.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:System.Time.Extra,Text.Read.Extra=extra-1.8.1-mqL7YRifC8HhGrjpGYIL3:Text.Read.Extra
  18649. 808.25 s [extra] unit extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18650. 808.25 s [extra] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18651. 808.25 s [extra] include base-4.18.3.0
  18652. 808.25 s [extra] include directory-1.3.8.5
  18653. 808.25 s [extra] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18654. 808.25 s [extra] include filepath-1.4.301.0
  18655. 808.25 s [extra] include quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18656. 808.25 s [extra] include unix-2.8.6.0
  18657. 808.25 s [extra] Ready component graph:
  18658. 808.25 s [extra] definite extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18659. 808.25 s [extra] depends base-4.18.3.0
  18660. 808.25 s [extra] depends clock-0.8.4-H1jR5WrkMt9F2ejdYkzAGi
  18661. 808.25 s [extra] depends directory-1.3.8.5
  18662. 808.25 s [extra] depends filepath-1.4.301.0
  18663. 808.25 s [extra] depends process-1.6.19.0
  18664. 808.25 s [extra] depends time-1.12.2
  18665. 808.25 s [extra] depends unix-2.8.6.0
  18666. 808.25 s [extra] definite extra-1.8.1-If46t5tU3xvFUhIUlXGutj-extra-test
  18667. 808.25 s [extra] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  18668. 808.25 s [extra] depends base-4.18.3.0
  18669. 808.25 s [extra] depends directory-1.3.8.5
  18670. 808.25 s [extra] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18671. 808.25 s [extra] depends filepath-1.4.301.0
  18672. 808.25 s [extra] depends quickcheck-instances-0.3.33-FVVqg59kBqgEZGRoc8T9zG
  18673. 808.25 s [extra] depends unix-2.8.6.0
  18674. 808.25 s [extra] Using Cabal-3.10.3.0 compiled by ghc-9.6
  18675. 808.25 s [extra] Using compiler: ghc-9.6.7
  18676. 808.25 s [extra] Using install prefix: /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  18677. 808.25 s [extra] Executables installed in:
  18678. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/bin
  18679. 808.25 s [extra] Libraries installed in:
  18680. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  18681. 808.25 s [extra] Dynamic Libraries installed in:
  18682. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  18683. 808.25 s [extra] Private executables installed in:
  18684. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/libexec/x86_64-linux-ghc-9.6.7/extra-1.8.1
  18685. 808.25 s [extra] Data files installed in:
  18686. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/share/x86_64-linux-ghc-9.6.7/extra-1.8.1
  18687. 808.25 s [extra] Documentation installed in:
  18688. 808.25 s [extra] /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc/share/doc/extra-1.8.1
  18689. 808.25 s [extra] Configuration files installed in:
  18690. 808.25 s [extra] /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/etc
  18691. 808.25 s [extra] No alex found
  18692. 808.25 s [extra] Using ar found on system at:
  18693. 808.25 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  18694. 808.25 s [extra] No c2hs found
  18695. 808.25 s [extra] No cpphs found
  18696. 808.25 s [extra] No doctest found
  18697. 808.25 s [extra] Using gcc version 14.3.0 given by user at:
  18698. 808.25 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  18699. 808.25 s [extra] Using ghc version 9.6.7 found on system at:
  18700. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  18701. 808.25 s [extra] Using ghc-pkg version 9.6.7 found on system at:
  18702. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  18703. 808.25 s [extra] No ghcjs found
  18704. 808.25 s [extra] No ghcjs-pkg found
  18705. 808.25 s [extra] No greencard found
  18706. 808.25 s [extra] Using haddock version 2.29.2 found on system at:
  18707. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  18708. 808.25 s [extra] No happy found
  18709. 808.25 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  18710. 808.25 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  18711. 808.25 s [extra] No hmake found
  18712. 808.25 s [extra] Using hpc version 0.68 found on system at:
  18713. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  18714. 808.25 s [extra] Using hsc2hs version 0.68.9 found on system at:
  18715. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  18716. 808.25 s [extra] Using hscolour version 1.25 found on system at:
  18717. 808.25 s [extra] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  18718. 808.25 s [extra] No jhc found
  18719. 808.25 s [extra] Using ld found on system at:
  18720. 808.25 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  18721. 808.25 s [extra] No pkg-config found
  18722. 808.25 s [extra] Using runghc version 9.6.7 found on system at:
  18723. 808.25 s [extra] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  18724. 808.25 s [extra] Using strip version 2.44 found on system at:
  18725. 808.25 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  18726. 808.25 s [extra] Using tar found on system at:
  18727. 808.25 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  18728. 808.25 s [extra] No uhc found
  18729. 808.46 s [extra] Phase: buildPhase
  18730. 808.53 s [extra] Preprocessing library for extra-1.8.1..
  18731. 808.54 s [extra] Building library for extra-1.8.1..
  18732. 808.82 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 )
  18733. 808.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 )
  18734. 808.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 )
  18735. 808.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 )
  18736. 808.92 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  18737. 808.92 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  18738. 808.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 )
  18739. 809.89 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 )
  18740. 809.93 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 )
  18741. 810.02 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 )
  18742. 810.02 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 )
  18743. 810.03 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 )
  18744. 810.19 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 )
  18745. 810.27 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 )
  18746. 810.45 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 )
  18747. 810.45 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 )
  18748. 810.45 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 )
  18749. 810.61 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 )
  18750. 810.73 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 )
  18751. 810.73 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 )
  18752. 810.73 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  18753. 810.73 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 )
  18754. 811.09 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  18755. 811.32 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  18756. 811.32 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  18757. 811.32 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  18758. 811.32 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  18759. 811.32 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  18760. 811.32 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  18761. 812.36 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  18762. 812.52 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  18763. 812.59 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  18764. 812.59 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  18765. 812.59 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  18766. 812.91 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  18767. 813.09 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  18768. 813.26 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  18769. 813.26 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  18770. 813.26 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  18771. 813.50 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  18772. 813.50 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  18773. 813.64 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  18774. 813.64 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  18775. 813.80 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  18776. 814.92 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  18777. 814.92 s [extra] Building test suite 'extra-test' for extra-1.8.1..
  18778. 814.99 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  18779. 815.32 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  18780. 817.13 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  18781. 817.18 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  18782. 817.60 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  18783. 818.52 s [extra] Phase: checkPhase
  18784. 818.54 s [extra] Running 1 test suites...
  18785. 818.54 s [extra] Test suite extra-test: RUNNING...
  18786. 818.55 s [extra] withTempFile
  18787. 818.55 s [extra] +++ OK, passed 100 tests.
  18788. 818.55 s [extra] captureOutput
  18789. 818.55 s [extra] +++ OK, passed 100 tests.
  18790. 818.55 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  18791. 818.58 s [extra] +++ OK, passed 100 tests.
  18792. 818.58 s [extra] \(x :: IO Int) -> join (once x) == x
  18793. 818.60 s [extra] +++ OK, passed 100 tests.
  18794. 818.60 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  18795. 818.63 s [extra] +++ OK, passed 100 tests.
  18796. 818.63 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  18797. 818.67 s [extra] +++ OK, passed 100 tests.
  18798. 818.67 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  18799. 818.70 s [extra] +++ OK, passed 100 tests.
  18800. 818.70 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  18801. 818.73 s [extra] +++ OK, passed 100 tests.
  18802. 818.73 s [extra] stringException "test" == pure "test"
  18803. 818.73 s [extra] +++ OK, passed 100 tests.
  18804. 818.73 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  18805. 818.73 s [extra] +++ OK, passed 100 tests.
  18806. 818.73 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  18807. 818.73 s [extra] +++ OK, passed 100 tests.
  18808. 818.73 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  18809. 818.73 s [extra] +++ OK, passed 100 tests.
  18810. 818.73 s [extra] ignore (print 1) == print 1
  18811. 818.74 s [extra] +++ OK, passed 100 tests.
  18812. 818.74 s [extra] ignore (fail "die") == pure ()
  18813. 818.74 s [extra] +++ OK, passed 100 tests.
  18814. 818.74 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  18815. 818.74 s [extra] +++ OK, passed 100 tests.
  18816. 818.74 s [extra] seq (errorIO "foo") (print 1) == print 1
  18817. 818.74 s [extra] +++ OK, passed 100 tests.
  18818. 818.74 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  18819. 818.74 s [extra] +++ OK, passed 100 tests.
  18820. 818.74 s [extra] seq (assertIO False) (print 1) == print 1
  18821. 818.74 s [extra] +++ OK, passed 100 tests.
  18822. 818.74 s [extra] retry 1 (print "x") == print "x"
  18823. 818.74 s [extra] +++ OK, passed 100 tests.
  18824. 818.74 s [extra] retry 3 (fail "die") == fail "die"
  18825. 818.74 s [extra] +++ OK, passed 100 tests.
  18826. 818.74 s [extra] whenJust Nothing print == pure ()
  18827. 818.74 s [extra] +++ OK, passed 100 tests.
  18828. 818.74 s [extra] whenJust (Just 1) print == print 1
  18829. 818.74 s [extra] +++ OK, passed 100 tests.
  18830. 818.74 s [extra] pureIf @Maybe True 5 == Just 5
  18831. 818.74 s [extra] +++ OK, passed 100 tests.
  18832. 818.74 s [extra] pureIf @Maybe False 5 == Nothing
  18833. 818.74 s [extra] +++ OK, passed 100 tests.
  18834. 818.74 s [extra] pureIf @[] True 5 == [5]
  18835. 818.74 s [extra] +++ OK, passed 100 tests.
  18836. 818.74 s [extra] pureIf @[] False 5 == []
  18837. 818.74 s [extra] +++ OK, passed 100 tests.
  18838. 818.74 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  18839. 818.74 s [extra] +++ OK, passed 100 tests.
  18840. 818.74 s [extra] whenMaybe False (print 1) == pure Nothing
  18841. 818.74 s [extra] +++ OK, passed 100 tests.
  18842. 818.74 s [extra] \(x :: Maybe ()) -> unit x == x
  18843. 818.74 s [extra] +++ OK, passed 100 tests.
  18844. 818.74 s [extra] guarded even 2 == [2]
  18845. 818.74 s [extra] +++ OK, passed 100 tests.
  18846. 818.74 s [extra] guarded odd 2 == Nothing
  18847. 818.74 s [extra] +++ OK, passed 100 tests.
  18848. 818.74 s [extra] guarded (not.null) "My Name" == Just "My Name"
  18849. 818.74 s [extra] +++ OK, passed 100 tests.
  18850. 818.74 s [extra] guardedA (return . even) 42 == Just [42]
  18851. 818.74 s [extra] +++ OK, passed 100 tests.
  18852. 818.74 s [extra] guardedA (return . odd) 42 == Just []
  18853. 818.74 s [extra] +++ OK, passed 100 tests.
  18854. 818.74 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  18855. 818.74 s [extra] +++ OK, passed 100 tests.
  18856. 818.74 s [extra] fold1M (\x y -> Just x) [] == undefined
  18857. 818.74 s [extra] +++ OK, passed 100 tests.
  18858. 818.74 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  18859. 818.74 s [extra] +++ OK, passed 100 tests.
  18860. 818.74 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  18861. 818.74 s [extra] +++ OK, passed 100 tests.
  18862. 818.74 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  18863. 818.74 s [extra] +++ OK, passed 100 tests.
  18864. 818.74 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  18865. 818.74 s [extra] +++ OK, passed 100 tests.
  18866. 818.74 s [extra] Just True ||^ undefined == Just True
  18867. 818.74 s [extra] +++ OK, passed 100 tests.
  18868. 818.74 s [extra] Just False ||^ Just True == Just True
  18869. 818.74 s [extra] +++ OK, passed 100 tests.
  18870. 818.74 s [extra] Just False ||^ Just False == Just False
  18871. 818.75 s [extra] +++ OK, passed 100 tests.
  18872. 818.75 s [extra] Just False &&^ undefined == Just False
  18873. 818.75 s [extra] +++ OK, passed 100 tests.
  18874. 818.75 s [extra] Just True &&^ Just True == Just True
  18875. 818.75 s [extra] +++ OK, passed 100 tests.
  18876. 818.75 s [extra] Just True &&^ Just False == Just False
  18877. 818.75 s [extra] +++ OK, passed 100 tests.
  18878. 818.75 s [extra] anyM Just [False,True ,undefined] == Just True
  18879. 818.75 s [extra] +++ OK, passed 100 tests.
  18880. 818.75 s [extra] anyM Just [False,False,undefined] == undefined
  18881. 818.75 s [extra] +++ OK, passed 100 tests.
  18882. 818.75 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18883. 818.75 s [extra] +++ OK, passed 100 tests.
  18884. 818.75 s [extra] allM Just [True,False,undefined] == Just False
  18885. 818.75 s [extra] +++ OK, passed 100 tests.
  18886. 818.75 s [extra] allM Just [True,True ,undefined] == undefined
  18887. 818.75 s [extra] +++ OK, passed 100 tests.
  18888. 818.75 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  18889. 818.75 s [extra] +++ OK, passed 100 tests.
  18890. 818.75 s [extra] orM [Just False,Just True ,undefined] == Just True
  18891. 818.75 s [extra] +++ OK, passed 100 tests.
  18892. 818.75 s [extra] orM [Just False,Just False,undefined] == undefined
  18893. 818.75 s [extra] +++ OK, passed 100 tests.
  18894. 818.75 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  18895. 818.75 s [extra] +++ OK, passed 100 tests.
  18896. 818.75 s [extra] andM [Just True,Just False,undefined] == Just False
  18897. 818.75 s [extra] +++ OK, passed 100 tests.
  18898. 818.75 s [extra] andM [Just True,Just True ,undefined] == undefined
  18899. 818.75 s [extra] +++ OK, passed 100 tests.
  18900. 818.75 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  18901. 818.75 s [extra] +++ OK, passed 100 tests.
  18902. 818.75 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  18903. 818.75 s [extra] +++ OK, passed 100 tests.
  18904. 818.75 s [extra] findM (Just . isUpper) "test" == Just Nothing
  18905. 818.75 s [extra] +++ OK, passed 100 tests.
  18906. 818.75 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  18907. 818.75 s [extra] +++ OK, passed 100 tests.
  18908. 818.75 s [extra] fromLeft 1 (Left 3) == 3
  18909. 818.75 s [extra] +++ OK, passed 100 tests.
  18910. 818.75 s [extra] fromLeft 1 (Right "foo") == 1
  18911. 818.75 s [extra] +++ OK, passed 100 tests.
  18912. 818.75 s [extra] fromRight 1 (Right 3) == 3
  18913. 818.75 s [extra] +++ OK, passed 100 tests.
  18914. 818.75 s [extra] fromRight 1 (Left "foo") == 1
  18915. 818.75 s [extra] +++ OK, passed 100 tests.
  18916. 818.75 s [extra] \x -> fromLeft' (Left x) == x
  18917. 818.75 s [extra] +++ OK, passed 100 tests.
  18918. 818.75 s [extra] \x -> fromLeft' (Right x) == undefined
  18919. 818.75 s [extra] +++ OK, passed 100 tests.
  18920. 818.75 s [extra] \x -> fromRight' (Right x) == x
  18921. 818.75 s [extra] +++ OK, passed 100 tests.
  18922. 818.75 s [extra] \x -> fromRight' (Left x) == undefined
  18923. 818.76 s [extra] +++ OK, passed 100 tests.
  18924. 818.76 s [extra] \x -> fromEither (Left x ) == x
  18925. 818.76 s [extra] +++ OK, passed 100 tests.
  18926. 818.76 s [extra] \x -> fromEither (Right x) == x
  18927. 818.76 s [extra] +++ OK, passed 100 tests.
  18928. 818.76 s [extra] \a b -> maybeToEither a (Just b) == Right b
  18929. 818.76 s [extra] +++ OK, passed 100 tests.
  18930. 818.76 s [extra] \a -> maybeToEither a Nothing == Left a
  18931. 818.76 s [extra] +++ OK, passed 100 tests.
  18932. 818.76 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  18933. 818.76 s [extra] +++ OK, passed 100 tests.
  18934. 818.76 s [extra] \x -> eitherToMaybe (Right x) == Just x
  18935. 818.76 s [extra] +++ OK, passed 100 tests.
  18936. 818.76 s [extra] mapLeft show (Left 1) == Left "1"
  18937. 818.76 s [extra] +++ OK, passed 100 tests.
  18938. 818.76 s [extra] mapLeft show (Right True) == Right True
  18939. 818.76 s [extra] +++ OK, passed 100 tests.
  18940. 818.76 s [extra] mapRight show (Left 1) == Left 1
  18941. 818.76 s [extra] +++ OK, passed 100 tests.
  18942. 818.76 s [extra] mapRight show (Right True) == Right "True"
  18943. 818.76 s [extra] +++ OK, passed 100 tests.
  18944. 818.76 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  18945. 818.76 s [extra] +++ OK, passed 100 tests.
  18946. 818.76 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  18947. 818.76 s [extra] +++ OK, passed 100 tests.
  18948. 818.76 s [extra] \xs -> repeatedly line1 xs == lines xs
  18949. 818.76 s [extra] +++ OK, passed 100 tests.
  18950. 818.76 s [extra] disjoint [1,2,3] [4,5] == True
  18951. 818.76 s [extra] +++ OK, passed 100 tests.
  18952. 818.76 s [extra] disjoint [1,2,3] [4,1] == False
  18953. 818.76 s [extra] +++ OK, passed 100 tests.
  18954. 818.76 s [extra] disjointOrd [1,2,3] [4,5] == True
  18955. 818.76 s [extra] +++ OK, passed 100 tests.
  18956. 818.76 s [extra] disjointOrd [1,2,3] [4,1] == False
  18957. 818.76 s [extra] +++ OK, passed 100 tests.
  18958. 818.76 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  18959. 818.76 s [extra] +++ OK, passed 100 tests.
  18960. 818.76 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  18961. 818.76 s [extra] +++ OK, passed 100 tests.
  18962. 818.76 s [extra] anySame [1,1,2] == True
  18963. 818.76 s [extra] +++ OK, passed 100 tests.
  18964. 818.76 s [extra] anySame [1,2,3] == False
  18965. 818.76 s [extra] +++ OK, passed 100 tests.
  18966. 818.76 s [extra] anySame (1:2:1:undefined) == True
  18967. 818.76 s [extra] +++ OK, passed 100 tests.
  18968. 818.76 s [extra] anySame [] == False
  18969. 818.76 s [extra] +++ OK, passed 100 tests.
  18970. 818.76 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  18971. 818.76 s [extra] +++ OK, passed 100 tests.
  18972. 818.76 s [extra] allSame [1,1,2] == False
  18973. 818.76 s [extra] +++ OK, passed 100 tests.
  18974. 818.76 s [extra] allSame [1,1,1] == True
  18975. 818.76 s [extra] +++ OK, passed 100 tests.
  18976. 818.76 s [extra] allSame [1] == True
  18977. 818.76 s [extra] +++ OK, passed 100 tests.
  18978. 818.76 s [extra] allSame [] == True
  18979. 818.76 s [extra] +++ OK, passed 100 tests.
  18980. 818.76 s [extra] allSame (1:1:2:undefined) == False
  18981. 818.76 s [extra] +++ OK, passed 100 tests.
  18982. 818.76 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  18983. 818.76 s [extra] +++ OK, passed 100 tests.
  18984. 818.76 s [extra] headDef 1 [] == 1
  18985. 818.76 s [extra] +++ OK, passed 100 tests.
  18986. 818.76 s [extra] headDef 1 [2,3,4] == 2
  18987. 818.76 s [extra] +++ OK, passed 100 tests.
  18988. 818.76 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  18989. 818.76 s [extra] +++ OK, passed 100 tests.
  18990. 818.76 s [extra] lastDef 1 [] == 1
  18991. 818.76 s [extra] +++ OK, passed 100 tests.
  18992. 818.76 s [extra] lastDef 1 [2,3,4] == 4
  18993. 818.76 s [extra] +++ OK, passed 100 tests.
  18994. 818.76 s [extra] \x xs -> lastDef x xs == last (x:xs)
  18995. 818.76 s [extra] +++ OK, passed 100 tests.
  18996. 818.76 s [extra] [2,3,4] !? 1 == Just 3
  18997. 818.76 s [extra] +++ OK, passed 100 tests.
  18998. 818.76 s [extra] [2,3,4] !? (-1) == Nothing
  18999. 818.76 s [extra] +++ OK, passed 100 tests.
  19000. 818.76 s [extra] [] !? 0 == Nothing
  19001. 818.76 s [extra] +++ OK, passed 100 tests.
  19002. 818.76 s [extra] notNull [] == False
  19003. 818.76 s [extra] +++ OK, passed 100 tests.
  19004. 818.76 s [extra] notNull [1] == True
  19005. 818.76 s [extra] +++ OK, passed 100 tests.
  19006. 818.76 s [extra] \xs -> notNull xs == not (null xs)
  19007. 818.76 s [extra] +++ OK, passed 100 tests.
  19008. 818.76 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  19009. 818.76 s [extra] +++ OK, passed 100 tests.
  19010. 818.76 s [extra] list 1 (\v _ -> v - 2) [] == 1
  19011. 818.76 s [extra] +++ OK, passed 100 tests.
  19012. 818.76 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  19013. 818.76 s [extra] +++ OK, passed 100 tests.
  19014. 818.76 s [extra] unsnoc "test" == Just ("tes",'t')
  19015. 818.76 s [extra] +++ OK, passed 100 tests.
  19016. 818.76 s [extra] unsnoc "" == Nothing
  19017. 818.76 s [extra] +++ OK, passed 100 tests.
  19018. 818.76 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  19019. 818.76 s [extra] +++ OK, passed 100 tests.
  19020. 818.76 s [extra] cons 't' "est" == "test"
  19021. 818.77 s [extra] +++ OK, passed 100 tests.
  19022. 818.77 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  19023. 818.77 s [extra] +++ OK, passed 100 tests.
  19024. 818.77 s [extra] snoc "tes" 't' == "test"
  19025. 818.77 s [extra] +++ OK, passed 100 tests.
  19026. 818.77 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  19027. 818.77 s [extra] +++ OK, passed 100 tests.
  19028. 818.77 s [extra] enumerate == [False, True]
  19029. 818.77 s [extra] +++ OK, passed 100 tests.
  19030. 818.77 s [extra] takeEnd 3 "hello" == "llo"
  19031. 818.77 s [extra] +++ OK, passed 100 tests.
  19032. 818.77 s [extra] takeEnd 5 "bye" == "bye"
  19033. 818.77 s [extra] +++ OK, passed 100 tests.
  19034. 818.77 s [extra] takeEnd (-1) "bye" == ""
  19035. 818.77 s [extra] +++ OK, passed 100 tests.
  19036. 818.77 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  19037. 818.77 s [extra] +++ OK, passed 100 tests.
  19038. 818.77 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  19039. 818.77 s [extra] +++ OK, passed 100 tests.
  19040. 818.77 s [extra] dropEnd 3 "hello" == "he"
  19041. 818.77 s [extra] +++ OK, passed 100 tests.
  19042. 818.77 s [extra] dropEnd 5 "bye" == ""
  19043. 818.77 s [extra] +++ OK, passed 100 tests.
  19044. 818.77 s [extra] dropEnd (-1) "bye" == "bye"
  19045. 818.77 s [extra] +++ OK, passed 100 tests.
  19046. 818.77 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  19047. 818.77 s [extra] +++ OK, passed 100 tests.
  19048. 818.77 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  19049. 818.77 s [extra] +++ OK, passed 100 tests.
  19050. 818.77 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  19051. 818.77 s [extra] +++ OK, passed 100 tests.
  19052. 818.77 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  19053. 818.77 s [extra] +++ OK, passed 100 tests.
  19054. 818.77 s [extra] splitAtEnd 3 "he" == ("", "he")
  19055. 818.77 s [extra] +++ OK, passed 100 tests.
  19056. 818.77 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  19057. 818.77 s [extra] +++ OK, passed 100 tests.
  19058. 818.77 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  19059. 818.77 s [extra] +++ OK, passed 100 tests.
  19060. 818.77 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  19061. 818.77 s [extra] +++ OK, passed 100 tests.
  19062. 818.77 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  19063. 818.77 s [extra] +++ OK, passed 100 tests.
  19064. 818.77 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  19065. 818.77 s [extra] +++ OK, passed 100 tests.
  19066. 818.77 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  19067. 818.77 s [extra] +++ OK, passed 100 tests.
  19068. 818.77 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  19069. 818.77 s [extra] +++ OK, passed 100 tests.
  19070. 818.77 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  19071. 818.77 s [extra] +++ OK, passed 100 tests.
  19072. 818.77 s [extra] trim " hello " == "hello"
  19073. 818.77 s [extra] +++ OK, passed 100 tests.
  19074. 818.77 s [extra] trimStart " hello " == "hello "
  19075. 818.77 s [extra] +++ OK, passed 100 tests.
  19076. 818.77 s [extra] trimEnd " hello " == " hello"
  19077. 818.77 s [extra] +++ OK, passed 100 tests.
  19078. 818.77 s [extra] \s -> trim s == trimEnd (trimStart s)
  19079. 818.77 s [extra] +++ OK, passed 100 tests.
  19080. 818.77 s [extra] lower "This is A TEST" == "this is a test"
  19081. 818.77 s [extra] +++ OK, passed 100 tests.
  19082. 818.77 s [extra] lower "" == ""
  19083. 818.77 s [extra] +++ OK, passed 100 tests.
  19084. 818.77 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  19085. 818.77 s [extra] +++ OK, passed 100 tests.
  19086. 818.77 s [extra] upper "" == ""
  19087. 818.77 s [extra] +++ OK, passed 100 tests.
  19088. 818.77 s [extra] word1 "" == ("", "")
  19089. 818.77 s [extra] +++ OK, passed 100 tests.
  19090. 818.77 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  19091. 818.77 s [extra] +++ OK, passed 100 tests.
  19092. 818.77 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  19093. 818.77 s [extra] +++ OK, passed 100 tests.
  19094. 818.77 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  19095. 818.77 s [extra] +++ OK, passed 100 tests.
  19096. 818.77 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  19097. 818.77 s [extra] +++ OK, passed 100 tests.
  19098. 818.77 s [extra] line1 "" == ("", "")
  19099. 818.77 s [extra] +++ OK, passed 100 tests.
  19100. 818.77 s [extra] line1 "test" == ("test","")
  19101. 818.77 s [extra] +++ OK, passed 100 tests.
  19102. 818.77 s [extra] line1 "test\n" == ("test","")
  19103. 818.77 s [extra] +++ OK, passed 100 tests.
  19104. 818.78 s [extra] line1 "test\nrest" == ("test","rest")
  19105. 818.78 s [extra] +++ OK, passed 100 tests.
  19106. 818.78 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  19107. 818.78 s [extra] +++ OK, passed 100 tests.
  19108. 818.78 s [extra] escapeHTML "this is a test" == "this is a test"
  19109. 818.78 s [extra] +++ OK, passed 100 tests.
  19110. 818.78 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  19111. 818.78 s [extra] +++ OK, passed 100 tests.
  19112. 818.78 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  19113. 818.78 s [extra] +++ OK, passed 100 tests.
  19114. 818.78 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  19115. 818.78 s [extra] +++ OK, passed 100 tests.
  19116. 818.78 s [extra] escapeJSON "this is a test" == "this is a test"
  19117. 818.78 s [extra] +++ OK, passed 100 tests.
  19118. 818.78 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  19119. 818.78 s [extra] +++ OK, passed 100 tests.
  19120. 818.78 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  19121. 818.78 s [extra] +++ OK, passed 100 tests.
  19122. 818.78 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  19123. 818.78 s [extra] +++ OK, passed 100 tests.
  19124. 818.78 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  19125. 818.78 s [extra] +++ OK, passed 100 tests.
  19126. 818.78 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  19127. 818.78 s [extra] +++ OK, passed 100 tests.
  19128. 818.78 s [extra] maximumOn id [] == undefined
  19129. 818.78 s [extra] +++ OK, passed 100 tests.
  19130. 818.78 s [extra] maximumOn length ["test","extra","a"] == "extra"
  19131. 818.78 s [extra] +++ OK, passed 100 tests.
  19132. 818.78 s [extra] minimumOn id [] == undefined
  19133. 818.78 s [extra] +++ OK, passed 100 tests.
  19134. 818.78 s [extra] minimumOn length ["test","extra","a"] == "a"
  19135. 818.78 s [extra] +++ OK, passed 100 tests.
  19136. 818.78 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  19137. 818.78 s [extra] +++ OK, passed 100 tests.
  19138. 818.78 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  19139. 818.78 s [extra] +++ OK, passed 100 tests.
  19140. 818.78 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  19141. 818.78 s [extra] +++ OK, passed 100 tests.
  19142. 818.78 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19143. 818.78 s [extra] +++ OK, passed 100 tests.
  19144. 818.78 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  19145. 818.78 s [extra] +++ OK, passed 100 tests.
  19146. 818.78 s [extra] sum' [1, 2, 3] == 6
  19147. 818.78 s [extra] +++ OK, passed 100 tests.
  19148. 818.78 s [extra] sumOn' read ["1", "2", "3"] == 6
  19149. 818.78 s [extra] +++ OK, passed 100 tests.
  19150. 818.78 s [extra] product' [1, 2, 4] == 8
  19151. 818.78 s [extra] +++ OK, passed 100 tests.
  19152. 818.78 s [extra] productOn' read ["1", "2", "4"] == 8
  19153. 818.78 s [extra] +++ OK, passed 100 tests.
  19154. 818.78 s [extra] merge "ace" "bd" == "abcde"
  19155. 818.78 s [extra] +++ OK, passed 100 tests.
  19156. 818.78 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  19157. 818.79 s [extra] +++ OK, passed 100 tests.
  19158. 818.79 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  19159. 818.79 s [extra] +++ OK, passed 100 tests.
  19160. 818.79 s [extra] replace "el" "e" "Hello" == "Helo"
  19161. 818.79 s [extra] +++ OK, passed 100 tests.
  19162. 818.79 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  19163. 818.79 s [extra] +++ OK, passed 100 tests.
  19164. 818.79 s [extra] replace "" "x" "" == "x"
  19165. 818.79 s [extra] +++ OK, passed 100 tests.
  19166. 818.79 s [extra] \xs ys -> replace xs xs ys == ys
  19167. 818.79 s [extra] +++ OK, passed 100 tests.
  19168. 818.79 s [extra] breakEnd isLower "youRE" == ("you","RE")
  19169. 818.79 s [extra] +++ OK, passed 100 tests.
  19170. 818.79 s [extra] breakEnd isLower "youre" == ("youre","")
  19171. 818.79 s [extra] +++ OK, passed 100 tests.
  19172. 818.79 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  19173. 818.79 s [extra] +++ OK, passed 100 tests.
  19174. 818.79 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  19175. 818.79 s [extra] +++ OK, passed 100 tests.
  19176. 818.79 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  19177. 818.79 s [extra] +++ OK, passed 100 tests.
  19178. 818.79 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  19179. 818.79 s [extra] +++ OK, passed 100 tests.
  19180. 818.79 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  19181. 818.79 s [extra] +++ OK, passed 100 tests.
  19182. 818.79 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  19183. 818.79 s [extra] +++ OK, passed 100 tests.
  19184. 818.79 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  19185. 818.79 s [extra] +++ OK, passed 100 tests.
  19186. 818.79 s [extra] \s -> wordsBy isSpace s == words s
  19187. 818.79 s [extra] +++ OK, passed 100 tests.
  19188. 818.79 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  19189. 818.79 s [extra] +++ OK, passed 100 tests.
  19190. 818.79 s [extra] \s -> linesBy (== '\n') s == lines s
  19191. 818.79 s [extra] +++ OK, passed 100 tests.
  19192. 818.79 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  19193. 818.79 s [extra] +++ OK, passed 100 tests.
  19194. 818.79 s [extra] firstJust id [Nothing,Just 3] == Just 3
  19195. 818.79 s [extra] +++ OK, passed 100 tests.
  19196. 818.79 s [extra] firstJust id [Nothing,Nothing] == Nothing
  19197. 818.79 s [extra] +++ OK, passed 100 tests.
  19198. 818.79 s [extra] drop1 "" == ""
  19199. 818.79 s [extra] +++ OK, passed 100 tests.
  19200. 818.79 s [extra] drop1 "test" == "est"
  19201. 818.79 s [extra] +++ OK, passed 100 tests.
  19202. 818.79 s [extra] \xs -> drop 1 xs == drop1 xs
  19203. 818.79 s [extra] +++ OK, passed 100 tests.
  19204. 818.79 s [extra] dropEnd1 "" == ""
  19205. 818.79 s [extra] +++ OK, passed 100 tests.
  19206. 818.79 s [extra] dropEnd1 "test" == "tes"
  19207. 818.79 s [extra] +++ OK, passed 100 tests.
  19208. 818.79 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  19209. 818.79 s [extra] +++ OK, passed 100 tests.
  19210. 818.79 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  19211. 818.79 s [extra] +++ OK, passed 100 tests.
  19212. 818.79 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  19213. 818.81 s [extra] +++ OK, passed 100 tests.
  19214. 818.81 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  19215. 818.81 s [extra] +++ OK, passed 100 tests.
  19216. 818.81 s [extra] breakOn "/" "foobar" == ("foobar", "")
  19217. 818.81 s [extra] +++ OK, passed 100 tests.
  19218. 818.81 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  19219. 818.81 s [extra] +++ OK, passed 100 tests.
  19220. 818.81 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  19221. 818.81 s [extra] +++ OK, passed 100 tests.
  19222. 818.81 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  19223. 818.81 s [extra] +++ OK, passed 100 tests.
  19224. 818.81 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  19225. 818.81 s [extra] +++ OK, passed 100 tests.
  19226. 818.81 s [extra] splitOn "x" "x" == ["",""]
  19227. 818.81 s [extra] +++ OK, passed 100 tests.
  19228. 818.81 s [extra] splitOn "x" "" == [""]
  19229. 818.81 s [extra] +++ OK, passed 100 tests.
  19230. 818.81 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  19231. 818.81 s [extra] +++ OK, passed 100 tests; 21 discarded.
  19232. 818.81 s [extra] \c x -> splitOn [c] x == split (==c) x
  19233. 818.81 s [extra] +++ OK, passed 100 tests.
  19234. 818.81 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  19235. 818.81 s [extra] +++ OK, passed 100 tests.
  19236. 818.81 s [extra] split (== 'a') "" == [""]
  19237. 818.81 s [extra] +++ OK, passed 100 tests.
  19238. 818.81 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  19239. 818.81 s [extra] +++ OK, passed 100 tests.
  19240. 818.81 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  19241. 818.81 s [extra] +++ OK, passed 100 tests.
  19242. 818.81 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  19243. 818.81 s [extra] +++ OK, passed 100 tests.
  19244. 818.81 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  19245. 818.81 s [extra] +++ OK, passed 100 tests.
  19246. 818.81 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  19247. 818.81 s [extra] +++ OK, passed 100 tests.
  19248. 818.81 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  19249. 818.81 s [extra] +++ OK, passed 100 tests.
  19250. 818.82 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  19251. 818.82 s [extra] +++ OK, passed 100 tests.
  19252. 818.82 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  19253. 818.82 s [extra] +++ OK, passed 100 tests.
  19254. 818.82 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  19255. 818.82 s [extra] +++ OK, passed 100 tests.
  19256. 818.82 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  19257. 818.82 s [extra] +++ OK, passed 100 tests.
  19258. 818.82 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  19259. 818.82 s [extra] +++ OK, passed 100 tests.
  19260. 818.82 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  19261. 818.82 s [extra] +++ OK, passed 100 tests.
  19262. 818.82 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  19263. 818.82 s [extra] +++ OK, passed 100 tests.
  19264. 818.82 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  19265. 818.82 s [extra] +++ OK, passed 100 tests.
  19266. 818.82 s [extra] stripSuffix "" "baz" == Just "baz"
  19267. 818.82 s [extra] +++ OK, passed 100 tests.
  19268. 818.82 s [extra] stripSuffix "foo" "quux" == Nothing
  19269. 818.82 s [extra] +++ OK, passed 100 tests.
  19270. 818.82 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  19271. 818.82 s [extra] +++ OK, passed 100 tests.
  19272. 818.82 s [extra] stripInfix "/" "foobar" == Nothing
  19273. 818.82 s [extra] +++ OK, passed 100 tests.
  19274. 818.82 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  19275. 818.82 s [extra] +++ OK, passed 100 tests.
  19276. 818.82 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  19277. 818.82 s [extra] +++ OK, passed 100 tests.
  19278. 818.82 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  19279. 818.82 s [extra] +++ OK, passed 100 tests.
  19280. 818.82 s [extra] chunksOf 8 "" == []
  19281. 818.82 s [extra] +++ OK, passed 100 tests.
  19282. 818.82 s [extra] chunksOf 0 "test" == undefined
  19283. 818.82 s [extra] +++ OK, passed 100 tests.
  19284. 818.82 s [extra] nubSort "this is a test" == " aehist"
  19285. 818.82 s [extra] +++ OK, passed 100 tests.
  19286. 818.82 s [extra] \xs -> nubSort xs == nub (sort xs)
  19287. 818.82 s [extra] +++ OK, passed 100 tests.
  19288. 818.82 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  19289. 818.82 s [extra] +++ OK, passed 100 tests.
  19290. 818.82 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  19291. 818.82 s [extra] +++ OK, passed 100 tests.
  19292. 818.82 s [extra] nubOrd "this is a test" == "this ae"
  19293. 818.82 s [extra] +++ OK, passed 100 tests.
  19294. 818.82 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  19295. 818.82 s [extra] +++ OK, passed 100 tests.
  19296. 818.82 s [extra] \xs -> nubOrd xs == nub xs
  19297. 818.82 s [extra] +++ OK, passed 100 tests.
  19298. 818.82 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  19299. 818.82 s [extra] +++ OK, passed 100 tests.
  19300. 818.82 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  19301. 818.82 s [extra] +++ OK, passed 100 tests.
  19302. 818.82 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  19303. 818.82 s [extra] +++ OK, passed 100 tests.
  19304. 818.82 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  19305. 818.82 s [extra] +++ OK, passed 100 tests.
  19306. 818.82 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  19307. 818.82 s [extra] +++ OK, passed 100 tests.
  19308. 818.82 s [extra] comparingLength [1,2,3] [False] == GT
  19309. 818.82 s [extra] +++ OK, passed 100 tests.
  19310. 818.82 s [extra] comparingLength [1,2] "ab" == EQ
  19311. 818.82 s [extra] +++ OK, passed 100 tests.
  19312. 818.82 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  19313. 818.82 s [extra] +++ OK, passed 100 tests.
  19314. 818.82 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  19315. 818.82 s [extra] +++ OK, passed 100 tests.
  19316. 818.82 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  19317. 818.82 s [extra] +++ OK, passed 100 tests.
  19318. 818.82 s [extra] mwhen True "test" == "test"
  19319. 818.82 s [extra] +++ OK, passed 100 tests.
  19320. 818.82 s [extra] mwhen False "test" == ""
  19321. 818.82 s [extra] +++ OK, passed 100 tests.
  19322. 818.82 s [extra] first succ (1,"test") == (2,"test")
  19323. 818.82 s [extra] +++ OK, passed 100 tests.
  19324. 818.82 s [extra] second reverse (1,"test") == (1,"tset")
  19325. 818.82 s [extra] +++ OK, passed 100 tests.
  19326. 818.82 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  19327. 818.82 s [extra] +++ OK, passed 100 tests.
  19328. 818.82 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  19329. 818.82 s [extra] +++ OK, passed 100 tests.
  19330. 818.82 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  19331. 818.82 s [extra] +++ OK, passed 100 tests.
  19332. 818.82 s [extra] (succ &&& pred) 1 == (2,0)
  19333. 818.82 s [extra] +++ OK, passed 100 tests.
  19334. 818.82 s [extra] dupe 12 == (12, 12)
  19335. 818.82 s [extra] +++ OK, passed 100 tests.
  19336. 818.82 s [extra] both succ (1,2) == (2,3)
  19337. 818.82 s [extra] +++ OK, passed 100 tests.
  19338. 818.82 s [extra] first3 succ (1,1,1) == (2,1,1)
  19339. 818.82 s [extra] +++ OK, passed 100 tests.
  19340. 818.82 s [extra] second3 succ (1,1,1) == (1,2,1)
  19341. 818.82 s [extra] +++ OK, passed 100 tests.
  19342. 818.82 s [extra] third3 succ (1,1,1) == (1,1,2)
  19343. 818.82 s [extra] +++ OK, passed 100 tests.
  19344. 818.82 s [extra] \x -> readVersion (showVersion x) == x
  19345. 818.82 s [extra] +++ OK, passed 100 tests.
  19346. 818.82 s [extra] readVersion "hello" == undefined
  19347. 818.82 s [extra] +++ OK, passed 100 tests.
  19348. 818.82 s [extra] showDP 4 pi == "3.1416"
  19349. 818.82 s [extra] +++ OK, passed 100 tests.
  19350. 818.82 s [extra] showDP 0 pi == "3"
  19351. 818.82 s [extra] +++ OK, passed 100 tests.
  19352. 818.82 s [extra] showDP 2 3 == "3.00"
  19353. 818.82 s [extra] +++ OK, passed 100 tests.
  19354. 818.82 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  19355. 818.82 s [extra] +++ OK, passed 100 tests.
  19356. 818.82 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  19357. 818.82 s [extra] +++ OK, passed 100 tests.
  19358. 818.82 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  19359. 818.83 s [extra] +++ OK, passed 100 tests.
  19360. 818.83 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  19361. 818.83 s [extra] +++ OK, passed 100 tests.
  19362. 818.83 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  19363. 818.83 s [extra] +++ OK, passed 100 tests.
  19364. 818.83 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19365. 818.83 s [extra] +++ OK, passed 100 tests.
  19366. 818.83 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  19367. 818.83 s [extra] +++ OK, passed 100 tests.
  19368. 818.83 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  19369. 818.83 s [extra] +++ OK, passed 100 tests.
  19370. 818.83 s [extra] isWindows == (os == "mingw32")
  19371. 818.83 s [extra] +++ OK, passed 100 tests.
  19372. 818.83 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  19373. 818.85 s [extra] +++ OK, passed 100 tests.
  19374. 818.85 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  19375. 818.87 s [extra] +++ OK, passed 100 tests.
  19376. 818.87 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  19377. 818.90 s [extra] +++ OK, passed 100 tests.
  19378. 818.90 s [extra] captureOutput (print 1) == pure ("1\n",())
  19379. 818.90 s [extra] +++ OK, passed 100 tests.
  19380. 818.90 s [extra] withTempFile doesFileExist == pure True
  19381. 818.91 s [extra] +++ OK, passed 100 tests.
  19382. 818.91 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  19383. 818.91 s [extra] +++ OK, passed 100 tests.
  19384. 818.91 s [extra] withTempFile readFile' == pure ""
  19385. 818.91 s [extra] +++ OK, passed 100 tests.
  19386. 818.91 s [extra] withTempDir doesDirectoryExist == pure True
  19387. 818.91 s [extra] +++ OK, passed 100 tests.
  19388. 818.92 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  19389. 818.92 s [extra] +++ OK, passed 100 tests.
  19390. 818.92 s [extra] withTempDir listFiles == pure []
  19391. 818.92 s [extra] +++ OK, passed 100 tests.
  19392. 818.92 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  19393. 818.92 s [extra] +++ OK, passed 100 tests.
  19394. 818.92 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  19395. 818.92 s [extra] +++ OK, passed 100 tests.
  19396. 818.92 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  19397. 818.92 s [extra] +++ OK, passed 100 tests.
  19398. 818.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  19399. 818.92 s [extra] +++ OK, passed 100 tests.
  19400. 818.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  19401. 818.92 s [extra] +++ OK, passed 100 tests.
  19402. 818.92 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  19403. 818.92 s [extra] +++ OK, passed 100 tests.
  19404. 818.92 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  19405. 819.91 s [extra] +++ OK, passed 100 tests.
  19406. 819.91 s [extra] timeout (-3) (print 1) == pure Nothing
  19407. 819.91 s [extra] +++ OK, passed 100 tests.
  19408. 819.91 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  19409. 819.91 s [extra] +++ OK, passed 100 tests.
  19410. 819.91 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  19411. 820.01 s [extra] 0.100582582
  19412. 820.01 s [extra] +++ OK, passed 100 tests.
  19413. 820.01 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  19414. 820.11 s [extra] +++ OK, passed 100 tests.
  19415. 820.11 s [extra] showDuration 3.435 == "3.44s"
  19416. 820.11 s [extra] +++ OK, passed 100 tests.
  19417. 820.11 s [extra] showDuration 623.8 == "10m24s"
  19418. 820.11 s [extra] +++ OK, passed 100 tests.
  19419. 820.11 s [extra] showDuration 62003.8 == "17h13m"
  19420. 820.11 s [extra] +++ OK, passed 100 tests.
  19421. 820.11 s [extra] showDuration 1e8 == "27777h47m"
  19422. 820.11 s [extra] +++ OK, passed 100 tests.
  19423. 820.11 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  19424. 820.11 s [extra] +++ OK, passed 100 tests.
  19425. 820.11 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  19426. 821.11 s [extra] +++ OK, passed 100 tests.
  19427. 821.11 s [extra] Extra export
  19428. 821.11 s [extra] +++ OK, passed 100 tests.
  19429. 821.11 s [extra] withTempFile
  19430. 821.12 s [extra] ....done
  19431. 821.12 s [extra] withTempDir
  19432. 821.13 s [extra] ....done
  19433. 821.13 s [extra] retry
  19434. 821.13 s [extra] +++ OK, passed 100 tests.
  19435. 821.13 s [extra] barrier
  19436. 821.13 s [extra] Success (325 tests)
  19437. 821.16 s [extra] Test suite extra-test: PASS
  19438. 821.16 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  19439. 821.16 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  19440. 821.17 s [extra] Phase: haddockPhase
  19441. 821.29 s [extra] Preprocessing library for extra-1.8.1..
  19442. 821.30 s [extra] Running Haddock on library for extra-1.8.1..
  19443. 821.35 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  19444. 821.69 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  19445. 821.70 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  19446. 821.72 s [extra] Warning: 'Arrow' is out of scope.
  19447. 821.72 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19448. 821.72 s [extra] 100% ( 22 / 22) in 'Data.Tuple.Extra'
  19449. 821.73 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  19450. 821.75 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  19451. 821.87 s [extra] Warning: '(:)' is out of scope.
  19452. 821.87 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19453. 821.87 s [extra] Warning: 'firstJustM' is out of scope.
  19454. 821.87 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19455. 821.88 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  19456. 822.02 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  19457. 822.03 s [extra] Warning: 'length' is ambiguous. It is defined
  19458. 822.03 s [extra] * in ‘Data.Foldable’
  19459. 822.03 s [extra] * in ‘Data.List.NonEmpty’
  19460. 822.03 s [extra] You may be able to disambiguate the identifier by qualifying it or
  19461. 822.03 s [extra] by specifying the type/value namespace explicitly.
  19462. 822.03 s [extra] Defaulting to the one defined in ‘Data.Foldable’
  19463. 822.03 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  19464. 822.05 s [extra] Warning: 'fromJust' is out of scope.
  19465. 822.05 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19466. 822.05 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  19467. 822.06 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  19468. 822.09 s [extra] Warning: 'partition' is out of scope.
  19469. 822.09 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19470. 822.09 s [extra] Warning: 'mconcatMap' is out of scope.
  19471. 822.09 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19472. 822.09 s [extra] Warning: 'find' is out of scope.
  19473. 822.09 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  19474. 822.09 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  19475. 822.11 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  19476. 822.11 s [extra] Missing documentation for:
  19477. 822.11 s [extra] Module header
  19478. 822.13 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  19479. 822.20 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  19480. 822.36 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  19481. 822.36 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  19482. 822.36 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  19483. 822.36 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  19484. 822.36 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  19485. 822.46 s [extra] 100% (270 /270) in 'Extra'
  19486. 822.54 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  19487. 825.84 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  19488. 825.89 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1..
  19489. 825.90 s [extra] Phase: installPhase
  19490. 825.96 s [extra] Installing library in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19491. 826.43 s [extra] Phase: fixupPhase
  19492. 826.44 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19493. 826.45 s [extra] shrinking /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSextra-1.8.1-mqL7YRifC8HhGrjpGYIL3-ghc9.6.7.so
  19494. 826.46 s [extra] checking for references to /build/ in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1...
  19495. 826.49 s [extra] patching script interpreter paths in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19496. 826.50 s [extra] stripping (with command strip and flags -S -p) in /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1/lib
  19497. 826.65 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc
  19498. 826.66 s [extra] checking for references to /build/ in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc...
  19499. 826.70 s [extra] patching script interpreter paths in /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc
  19500. 826.81 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19501. 827.31 s [extra:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  19502. 827.31 s [extra:post-build]
  19503. 827.71 s [extra:post-build] Pushing /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc (3.00 MiB)
  19504. 827.90 s [extra:post-build] Pushing /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1 (4.16 MiB)
  19505. 829.01 s [extra:post-build]
  19506. 829.01 s [extra:post-build] All done.
  19507. 829.03 s [extra:post-build] Uploading to the NixCI cache: /nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc /nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1
  19508. 829.07 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19509. 829.29 s [extra:post-build] copying 2 paths...
  19510. 829.29 s [extra:post-build] copying path '/nix/store/dspg2xlv4si0v54n05w0m1gxfapn9z5g-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  19511. 829.83 s [extra:post-build] copying path '/nix/store/s7h48499ayc8w49q97zca6agbglc2ydz-extra-1.8.1' to 'https://cache.nix-ci.com'...
  19512. 831.23 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  19513. 831.51 s [extra:post-build] copying 1 paths...
  19514. 831.51 s [extra:post-build] copying path '/nix/store/3rrsnsd4hgj7rn4hwa31j58wlp8sw3px-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  19515. 831.76 s Progress: 13 of 19 built, 73 of 73 downloaded from cache
  19516. 831.80 s Building /nix/store/5mjvdf48pmvcbc8jll342q9vilpiv5lj-algebraic-graphs-0.7.drv
  19517. 831.88 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  19518. 831.88 s [algebraic-graphs] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  19519. 832.03 s [algebraic-graphs] Phase: unpackPhase
  19520. 832.04 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  19521. 832.04 s [algebraic-graphs] source root is algebraic-graphs-0.7
  19522. 832.05 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  19523. 832.06 s [algebraic-graphs] Phase: patchPhase
  19524. 832.06 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  19525. 832.07 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  19526. 832.07 s [algebraic-graphs] patching file algebraic-graphs.cabal
  19527. 832.07 s [algebraic-graphs] Phase: compileBuildDriverPhase
  19528. 832.07 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.pnTNndxmzX/setup-package.conf.d -threaded
  19529. 832.14 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.pnTNndxmzX/Main.o )
  19530. 832.20 s [algebraic-graphs] [2 of 2] Linking Setup
  19531. 833.55 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  19532. 833.56 s [algebraic-graphs] Phase: configurePhase
  19533. 833.56 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.pnTNndxmzX/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  19534. 833.60 s [algebraic-graphs] Using Parsec parser
  19535. 833.60 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  19536. 833.90 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19537. 833.90 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  19538. 833.90 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19539. 833.90 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19540. 833.90 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19541. 833.90 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  19542. 833.90 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  19543. 833.90 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  19544. 833.90 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.18.3.0
  19545. 833.90 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.7
  19546. 833.90 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.4.8.1
  19547. 833.90 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  19548. 833.90 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  19549. 833.90 s [algebraic-graphs] inspection-testing-0.6.2
  19550. 833.90 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  19551. 834.21 s [algebraic-graphs] Source component graph:
  19552. 834.21 s [algebraic-graphs] component lib
  19553. 834.21 s [algebraic-graphs] component test:main dependency lib
  19554. 834.21 s [algebraic-graphs] Configured component graph:
  19555. 834.21 s [algebraic-graphs] component algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19556. 834.21 s [algebraic-graphs] include array-0.5.8.0
  19557. 834.21 s [algebraic-graphs] include base-4.18.3.0
  19558. 834.21 s [algebraic-graphs] include containers-0.6.7
  19559. 834.21 s [algebraic-graphs] include deepseq-1.4.8.1
  19560. 834.21 s [algebraic-graphs] include transformers-0.6.1.0
  19561. 834.21 s [algebraic-graphs] component algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19562. 834.21 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19563. 834.21 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19564. 834.21 s [algebraic-graphs] include array-0.5.8.0
  19565. 834.21 s [algebraic-graphs] include base-4.18.3.0
  19566. 834.21 s [algebraic-graphs] include containers-0.6.7
  19567. 834.21 s [algebraic-graphs] include deepseq-1.4.8.1
  19568. 834.21 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19569. 834.21 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19570. 834.21 s [algebraic-graphs] include transformers-0.6.1.0
  19571. 834.21 s [algebraic-graphs] Linked component graph:
  19572. 834.21 s [algebraic-graphs] unit algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19573. 834.21 s [algebraic-graphs] include array-0.5.8.0
  19574. 834.21 s [algebraic-graphs] include base-4.18.3.0
  19575. 834.21 s [algebraic-graphs] include containers-0.6.7
  19576. 834.21 s [algebraic-graphs] include deepseq-1.4.8.1
  19577. 834.21 s [algebraic-graphs] include transformers-0.6.1.0
  19578. 834.21 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE:Data.Graph.Typed
  19579. 834.21 s [algebraic-graphs] unit algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19580. 834.21 s [algebraic-graphs] include QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19581. 834.21 s [algebraic-graphs] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19582. 834.21 s [algebraic-graphs] include array-0.5.8.0
  19583. 834.21 s [algebraic-graphs] include base-4.18.3.0
  19584. 834.21 s [algebraic-graphs] include containers-0.6.7
  19585. 834.21 s [algebraic-graphs] include deepseq-1.4.8.1
  19586. 834.21 s [algebraic-graphs] include extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19587. 834.21 s [algebraic-graphs] include inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19588. 834.21 s [algebraic-graphs] include transformers-0.6.1.0
  19589. 834.21 s [algebraic-graphs] Ready component graph:
  19590. 834.21 s [algebraic-graphs] definite algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19591. 834.21 s [algebraic-graphs] depends array-0.5.8.0
  19592. 834.21 s [algebraic-graphs] depends base-4.18.3.0
  19593. 834.21 s [algebraic-graphs] depends containers-0.6.7
  19594. 834.21 s [algebraic-graphs] depends deepseq-1.4.8.1
  19595. 834.21 s [algebraic-graphs] depends transformers-0.6.1.0
  19596. 834.21 s [algebraic-graphs] definite algebraic-graphs-0.7-Hb7qr09bMx9JHq5kA09kif-main
  19597. 834.21 s [algebraic-graphs] depends QuickCheck-2.15.0.1-8TOXA7GkEi42wTg0ODsItP
  19598. 834.21 s [algebraic-graphs] depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19599. 834.21 s [algebraic-graphs] depends array-0.5.8.0
  19600. 834.21 s [algebraic-graphs] depends base-4.18.3.0
  19601. 834.21 s [algebraic-graphs] depends containers-0.6.7
  19602. 834.21 s [algebraic-graphs] depends deepseq-1.4.8.1
  19603. 834.21 s [algebraic-graphs] depends extra-1.8.1-mqL7YRifC8HhGrjpGYIL3
  19604. 834.21 s [algebraic-graphs] depends inspection-testing-0.6.2-3QX2depSWaUFw922pdySLQ
  19605. 834.21 s [algebraic-graphs] depends transformers-0.6.1.0
  19606. 834.21 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.6
  19607. 834.21 s [algebraic-graphs] Using compiler: ghc-9.6.7
  19608. 834.21 s [algebraic-graphs] Using install prefix:
  19609. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  19610. 834.22 s [algebraic-graphs] Executables installed in:
  19611. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/bin
  19612. 834.22 s [algebraic-graphs] Libraries installed in:
  19613. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  19614. 834.22 s [algebraic-graphs] Dynamic Libraries installed in:
  19615. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  19616. 834.22 s [algebraic-graphs] Private executables installed in:
  19617. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  19618. 834.22 s [algebraic-graphs] Data files installed in:
  19619. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7
  19620. 834.22 s [algebraic-graphs] Documentation installed in:
  19621. 834.22 s [algebraic-graphs] /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  19622. 834.22 s [algebraic-graphs] Configuration files installed in:
  19623. 834.22 s [algebraic-graphs] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/etc
  19624. 834.22 s [algebraic-graphs] No alex found
  19625. 834.22 s [algebraic-graphs] Using ar found on system at:
  19626. 834.22 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  19627. 834.22 s [algebraic-graphs] No c2hs found
  19628. 834.22 s [algebraic-graphs] No cpphs found
  19629. 834.22 s [algebraic-graphs] No doctest found
  19630. 834.22 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  19631. 834.22 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  19632. 834.22 s [algebraic-graphs] Using ghc version 9.6.7 found on system at:
  19633. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  19634. 834.22 s [algebraic-graphs] Using ghc-pkg version 9.6.7 found on system at:
  19635. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  19636. 834.22 s [algebraic-graphs] No ghcjs found
  19637. 834.22 s [algebraic-graphs] No ghcjs-pkg found
  19638. 834.22 s [algebraic-graphs] No greencard found
  19639. 834.22 s [algebraic-graphs] Using haddock version 2.29.2 found on system at:
  19640. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  19641. 834.22 s [algebraic-graphs] No happy found
  19642. 834.22 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  19643. 834.22 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  19644. 834.22 s [algebraic-graphs] No hmake found
  19645. 834.22 s [algebraic-graphs] Using hpc version 0.68 found on system at:
  19646. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  19647. 834.22 s [algebraic-graphs] Using hsc2hs version 0.68.9 found on system at:
  19648. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  19649. 834.22 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  19650. 834.22 s [algebraic-graphs] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  19651. 834.22 s [algebraic-graphs] No jhc found
  19652. 834.22 s [algebraic-graphs] Using ld found on system at:
  19653. 834.22 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  19654. 834.22 s [algebraic-graphs] No pkg-config found
  19655. 834.22 s [algebraic-graphs] Using runghc version 9.6.7 found on system at:
  19656. 834.22 s [algebraic-graphs] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  19657. 834.22 s [algebraic-graphs] Using strip version 2.44 found on system at:
  19658. 834.22 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  19659. 834.22 s [algebraic-graphs] Using tar found on system at:
  19660. 834.22 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  19661. 834.22 s [algebraic-graphs] No uhc found
  19662. 834.40 s [algebraic-graphs] Phase: buildPhase
  19663. 834.45 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  19664. 834.46 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  19665. 834.60 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 )
  19666. 835.56 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 )
  19667. 836.16 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 )
  19668. 836.46 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 )
  19669. 836.46 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  19670. 837.61 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 )
  19671. 837.87 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 )
  19672. 838.41 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 )
  19673. 839.08 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 )
  19674. 839.17 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 )
  19675. 839.17 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 )
  19676. 839.17 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 )
  19677. 839.17 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 )
  19678. 839.17 s [algebraic-graphs]
  19679. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19680. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19681. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19682. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19683. 839.17 s [algebraic-graphs] |
  19684. 839.17 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19685. 839.17 s [algebraic-graphs] | ^
  19686. 839.17 s [algebraic-graphs]
  19687. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19688. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19689. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19690. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19691. 839.17 s [algebraic-graphs] |
  19692. 839.17 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19693. 839.17 s [algebraic-graphs] | ^
  19694. 839.17 s [algebraic-graphs]
  19695. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19696. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19697. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19698. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19699. 839.17 s [algebraic-graphs] |
  19700. 839.17 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19701. 839.17 s [algebraic-graphs] | ^
  19702. 839.17 s [algebraic-graphs]
  19703. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19704. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19705. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19706. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19707. 839.17 s [algebraic-graphs] |
  19708. 839.17 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19709. 839.17 s [algebraic-graphs] | ^
  19710. 839.17 s [algebraic-graphs]
  19711. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19712. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19713. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19714. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19715. 839.17 s [algebraic-graphs] |
  19716. 839.17 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19717. 839.17 s [algebraic-graphs] | ^
  19718. 839.17 s [algebraic-graphs]
  19719. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19720. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19721. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19722. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19723. 839.17 s [algebraic-graphs] |
  19724. 839.17 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19725. 839.17 s [algebraic-graphs] | ^
  19726. 839.17 s [algebraic-graphs]
  19727. 839.17 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19728. 839.17 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19729. 839.17 s [algebraic-graphs] will become an error in a future GHC release.
  19730. 839.17 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19731. 839.17 s [algebraic-graphs] |
  19732. 839.17 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19733. 839.17 s [algebraic-graphs] | ^
  19734. 839.17 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 )
  19735. 839.17 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 )
  19736. 839.43 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 )
  19737. 839.47 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 )
  19738. 839.47 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 )
  19739. 840.08 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 )
  19740. 840.24 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
  19741. 840.47 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 )
  19742. 840.47 s [algebraic-graphs]
  19743. 840.47 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19744. 840.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19745. 840.47 s [algebraic-graphs] will become an error in a future GHC release.
  19746. 840.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19747. 840.47 s [algebraic-graphs] |
  19748. 840.47 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19749. 840.47 s [algebraic-graphs] | ^
  19750. 840.47 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 )
  19751. 840.47 s [algebraic-graphs]
  19752. 840.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19753. 840.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19754. 840.47 s [algebraic-graphs] will become an error in a future GHC release.
  19755. 840.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19756. 840.47 s [algebraic-graphs] |
  19757. 840.47 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19758. 840.47 s [algebraic-graphs] | ^
  19759. 840.47 s [algebraic-graphs]
  19760. 840.47 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19761. 840.47 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19762. 840.47 s [algebraic-graphs] will become an error in a future GHC release.
  19763. 840.47 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19764. 840.47 s [algebraic-graphs] |
  19765. 840.47 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19766. 840.47 s [algebraic-graphs] | ^
  19767. 840.47 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 )
  19768. 840.47 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 )
  19769. 840.47 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 )
  19770. 840.47 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 )
  19771. 840.47 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 )
  19772. 840.47 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 )
  19773. 840.50 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 )
  19774. 840.85 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  19775. 841.86 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  19776. 842.40 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 )
  19777. 842.77 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  19778. 842.77 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  19779. 843.91 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 )
  19780. 844.26 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 )
  19781. 844.75 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 )
  19782. 845.50 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  19783. 845.50 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 )
  19784. 845.50 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 )
  19785. 845.50 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 )
  19786. 845.50 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  19787. 845.50 s [algebraic-graphs]
  19788. 845.50 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19789. 845.50 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19790. 845.50 s [algebraic-graphs] will become an error in a future GHC release.
  19791. 845.50 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19792. 845.50 s [algebraic-graphs] |
  19793. 845.50 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  19794. 845.50 s [algebraic-graphs] | ^
  19795. 845.50 s [algebraic-graphs]
  19796. 845.50 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19797. 845.50 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19798. 845.50 s [algebraic-graphs] will become an error in a future GHC release.
  19799. 845.50 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19800. 845.50 s [algebraic-graphs] |
  19801. 845.50 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19802. 845.50 s [algebraic-graphs] | ^
  19803. 845.50 s [algebraic-graphs]
  19804. 845.50 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19805. 845.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19806. 845.51 s [algebraic-graphs] will become an error in a future GHC release.
  19807. 845.51 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19808. 845.51 s [algebraic-graphs] |
  19809. 845.51 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  19810. 845.51 s [algebraic-graphs] | ^
  19811. 845.51 s [algebraic-graphs]
  19812. 845.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19813. 845.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19814. 845.51 s [algebraic-graphs] will become an error in a future GHC release.
  19815. 845.51 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19816. 845.51 s [algebraic-graphs] |
  19817. 845.51 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19818. 845.51 s [algebraic-graphs] | ^
  19819. 845.51 s [algebraic-graphs]
  19820. 845.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19821. 845.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19822. 845.51 s [algebraic-graphs] will become an error in a future GHC release.
  19823. 845.51 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19824. 845.51 s [algebraic-graphs] |
  19825. 845.51 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  19826. 845.51 s [algebraic-graphs] | ^
  19827. 845.51 s [algebraic-graphs]
  19828. 845.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19829. 845.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19830. 845.51 s [algebraic-graphs] will become an error in a future GHC release.
  19831. 845.51 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19832. 845.51 s [algebraic-graphs] |
  19833. 845.51 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19834. 845.51 s [algebraic-graphs] | ^
  19835. 845.51 s [algebraic-graphs]
  19836. 845.51 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19837. 845.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19838. 845.51 s [algebraic-graphs] will become an error in a future GHC release.
  19839. 845.51 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19840. 845.51 s [algebraic-graphs] |
  19841. 845.51 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  19842. 845.51 s [algebraic-graphs] | ^
  19843. 845.51 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  19844. 845.74 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 )
  19845. 846.22 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  19846. 846.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 )
  19847. 846.22 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  19848. 846.74 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 )
  19849. 846.98 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 )
  19850. 847.11 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  19851. 847.11 s [algebraic-graphs]
  19852. 847.12 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19853. 847.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19854. 847.12 s [algebraic-graphs] will become an error in a future GHC release.
  19855. 847.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19856. 847.12 s [algebraic-graphs] |
  19857. 847.12 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  19858. 847.12 s [algebraic-graphs] | ^
  19859. 847.12 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 )
  19860. 847.12 s [algebraic-graphs]
  19861. 847.12 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19862. 847.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19863. 847.12 s [algebraic-graphs] will become an error in a future GHC release.
  19864. 847.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19865. 847.12 s [algebraic-graphs] |
  19866. 847.12 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  19867. 847.12 s [algebraic-graphs] | ^
  19868. 847.12 s [algebraic-graphs]
  19869. 847.12 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  19870. 847.12 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  19871. 847.12 s [algebraic-graphs] will become an error in a future GHC release.
  19872. 847.12 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  19873. 847.12 s [algebraic-graphs] |
  19874. 847.12 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  19875. 847.12 s [algebraic-graphs] | ^
  19876. 847.12 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  19877. 847.12 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  19878. 847.12 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 )
  19879. 847.23 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 )
  19880. 847.23 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 )
  19881. 847.23 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 )
  19882. 847.27 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  19883. 848.37 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  19884. 848.37 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  19885. 848.51 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 )
  19886. 849.64 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 )
  19887. 852.32 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 )
  19888. 852.32 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 )
  19889. 852.34 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 )
  19890. 854.35 s [algebraic-graphs] [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
  19891. 854.35 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 )
  19892. 854.35 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 )
  19893. 857.48 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 )
  19894. 857.63 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 )
  19895. 857.63 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 )
  19896. 858.19 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 )
  19897. 858.19 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 )
  19898. 858.19 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 )
  19899. 858.96 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 )
  19900. 858.96 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 )
  19901. 858.96 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 )
  19902. 858.96 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 )
  19903. 858.96 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 )
  19904. 858.96 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 )
  19905. 858.96 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  19906. 858.96 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  19907. 858.96 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  19908. 858.96 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  19909. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  19910. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  19911. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  19912. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  19913. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  19914. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  19915. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  19916. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  19917. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19918. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  19919. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  19920. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  19921. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  19922. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  19923. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  19924. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  19925. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  19926. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  19927. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  19928. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19929. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  19930. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19931. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  19932. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  19933. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19934. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  19935. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  19936. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  19937. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  19938. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  19939. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  19940. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  19941. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  19942. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19943. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  19944. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  19945. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  19946. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  19947. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  19948. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  19949. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  19950. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  19951. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  19952. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  19953. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19954. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  19955. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  19956. 858.97 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  19957. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  19958. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  19959. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  19960. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  19961. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  19962. 858.98 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  19963. 858.98 s [algebraic-graphs] inspection testing successful
  19964. 858.98 s [algebraic-graphs] expected successes: 58
  19965. 858.98 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 )
  19966. 858.98 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 )
  19967. 858.98 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 )
  19968. 859.61 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  19969. 860.46 s [algebraic-graphs] Phase: checkPhase
  19970. 860.48 s [algebraic-graphs] Running 1 test suites...
  19971. 860.48 s [algebraic-graphs] Test suite main: RUNNING...
  19972. 867.02 s [algebraic-graphs]
  19973. 867.02 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  19974. 867.05 s [algebraic-graphs] OK: show empty == "empty"
  19975. 867.05 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  19976. 867.05 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  19977. 867.05 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  19978. 867.05 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  19979. 867.05 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  19980. 867.05 s [algebraic-graphs]
  19981. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  19982. 867.05 s [algebraic-graphs] OK: fromAcyclic empty == empty
  19983. 867.05 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  19984. 867.05 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  19985. 867.05 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  19986. 867.05 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  19987. 867.05 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  19988. 867.05 s [algebraic-graphs]
  19989. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  19990. 867.05 s [algebraic-graphs] OK: isEmpty empty == True
  19991. 867.05 s [algebraic-graphs] OK: hasVertex x empty == False
  19992. 867.05 s [algebraic-graphs] OK: vertexCount empty == 0
  19993. 867.05 s [algebraic-graphs] OK: edgeCount empty == 0
  19994. 867.05 s [algebraic-graphs]
  19995. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  19996. 867.05 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19997. 867.05 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19998. 867.05 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19999. 867.05 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20000. 867.05 s [algebraic-graphs]
  20001. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  20002. 867.05 s [algebraic-graphs] OK: vertices [] == empty
  20003. 867.05 s [algebraic-graphs] OK: vertices [x] == vertex x
  20004. 867.05 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20005. 867.05 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20006. 867.05 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20007. 867.05 s [algebraic-graphs]
  20008. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  20009. 867.05 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  20010. 867.05 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  20011. 867.05 s [algebraic-graphs]
  20012. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  20013. 867.05 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  20014. 867.05 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  20015. 867.05 s [algebraic-graphs]
  20016. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  20017. 867.05 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20018. 867.05 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20019. 867.05 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20020. 867.05 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  20021. 867.05 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20022. 867.05 s [algebraic-graphs]
  20023. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  20024. 867.05 s [algebraic-graphs] OK: isEmpty empty == True
  20025. 867.05 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20026. 867.05 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20027. 867.05 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  20028. 867.05 s [algebraic-graphs]
  20029. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  20030. 867.05 s [algebraic-graphs] OK: hasVertex x empty == False
  20031. 867.05 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20032. 867.05 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20033. 867.05 s [algebraic-graphs]
  20034. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  20035. 867.05 s [algebraic-graphs] OK: hasEdge x y empty == False
  20036. 867.05 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20037. 867.05 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  20038. 867.05 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20039. 867.05 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20040. 867.05 s [algebraic-graphs]
  20041. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  20042. 867.05 s [algebraic-graphs] OK: vertexCount empty == 0
  20043. 867.05 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20044. 867.05 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20045. 867.05 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20046. 867.05 s [algebraic-graphs]
  20047. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  20048. 867.05 s [algebraic-graphs] OK: edgeCount empty == 0
  20049. 867.05 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20050. 867.05 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  20051. 867.05 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20052. 867.05 s [algebraic-graphs]
  20053. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  20054. 867.05 s [algebraic-graphs] OK: vertexList empty == []
  20055. 867.05 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20056. 867.05 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20057. 867.05 s [algebraic-graphs]
  20058. 867.05 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  20059. 867.05 s [algebraic-graphs] OK: edgeList empty == []
  20060. 867.06 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20061. 867.06 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  20062. 867.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20063. 867.06 s [algebraic-graphs]
  20064. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  20065. 867.06 s [algebraic-graphs] OK: adjacencyList empty == []
  20066. 867.06 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20067. 867.06 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  20068. 867.06 s [algebraic-graphs]
  20069. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  20070. 867.06 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20071. 867.06 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20072. 867.06 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20073. 867.06 s [algebraic-graphs]
  20074. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  20075. 867.06 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20076. 867.06 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20077. 867.06 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  20078. 867.06 s [algebraic-graphs]
  20079. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  20080. 867.06 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20081. 867.06 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20082. 867.06 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  20083. 867.06 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  20084. 867.06 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  20085. 867.06 s [algebraic-graphs]
  20086. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  20087. 867.06 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20088. 867.06 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20089. 867.06 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  20090. 867.06 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  20091. 867.06 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  20092. 867.06 s [algebraic-graphs]
  20093. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  20094. 867.06 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20095. 867.06 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20096. 867.06 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  20097. 867.06 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20098. 867.06 s [algebraic-graphs]
  20099. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  20100. 867.06 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  20101. 867.06 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20102. 867.06 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20103. 867.06 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  20104. 867.06 s [algebraic-graphs]
  20105. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  20106. 867.06 s [algebraic-graphs] OK: transpose empty == empty
  20107. 867.06 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20108. 867.06 s [algebraic-graphs] OK: transpose . transpose == id
  20109. 867.06 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20110. 867.06 s [algebraic-graphs]
  20111. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  20112. 867.06 s [algebraic-graphs] OK: induce (const True ) x == x
  20113. 867.06 s [algebraic-graphs] OK: induce (const False) x == empty
  20114. 867.06 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20115. 867.06 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20116. 867.06 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20117. 867.06 s [algebraic-graphs]
  20118. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  20119. 867.06 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20120. 867.06 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  20121. 867.06 s [algebraic-graphs]
  20122. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  20123. 867.06 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  20124. 867.06 s [algebraic-graphs]
  20125. 867.06 s [algebraic-graphs] OK: box x y ~~ box y x
  20126. 867.06 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20127. 867.06 s [algebraic-graphs] OK: box x empty ~~ empty
  20128. 867.06 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20129. 867.06 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20130. 867.06 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20131. 867.06 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20132. 867.06 s [algebraic-graphs]
  20133. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  20134. 867.06 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20135. 867.06 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20136. 867.06 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  20137. 867.06 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20138. 867.06 s [algebraic-graphs]
  20139. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  20140. 867.06 s [algebraic-graphs] OK: topSort empty == []
  20141. 867.06 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  20142. 867.06 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  20143. 867.06 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  20144. 867.06 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  20145. 867.06 s [algebraic-graphs]
  20146. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  20147. 867.06 s [algebraic-graphs] OK: scc empty == empty
  20148. 867.06 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  20149. 867.06 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  20150. 867.06 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  20151. 867.06 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  20152. 867.06 s [algebraic-graphs]
  20153. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  20154. 867.06 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  20155. 867.06 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  20156. 867.06 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  20157. 867.06 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  20158. 867.06 s [algebraic-graphs]
  20159. 867.06 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  20160. 867.06 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  20161. 867.06 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  20162. 867.06 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  20163. 867.06 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  20164. 867.06 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  20165. 867.06 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  20166. 870.21 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  20167. 870.21 s [algebraic-graphs]
  20168. 870.21 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  20169. 870.21 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  20170. 870.21 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  20171. 870.21 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  20172. 870.21 s [algebraic-graphs]
  20173. 870.21 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  20174. 870.21 s [algebraic-graphs] OK: Arbitrary
  20175. 870.21 s [algebraic-graphs] OK: empty
  20176. 870.22 s [algebraic-graphs] OK: vertex
  20177. 870.22 s [algebraic-graphs] OK: vertices
  20178. 870.22 s [algebraic-graphs] OK: union
  20179. 870.22 s [algebraic-graphs] OK: join
  20180. 870.22 s [algebraic-graphs] OK: transpose
  20181. 870.22 s [algebraic-graphs] OK: box
  20182. 870.22 s [algebraic-graphs] OK: transitiveClosure
  20183. 870.22 s [algebraic-graphs] OK: scc
  20184. 870.22 s [algebraic-graphs] OK: toAcyclic
  20185. 870.22 s [algebraic-graphs] OK: toAcyclicOrd
  20186. 870.22 s [algebraic-graphs]
  20187. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap ============
  20188. 870.22 s [algebraic-graphs] OK: Axioms of graphs
  20189. 870.22 s [algebraic-graphs]
  20190. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  20191. 870.22 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  20192. 870.22 s [algebraic-graphs]
  20193. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  20194. 870.22 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20195. 870.22 s [algebraic-graphs]
  20196. 870.22 s [algebraic-graphs] OK: consistent empty == True
  20197. 870.22 s [algebraic-graphs] OK: consistent (vertex x) == True
  20198. 870.22 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20199. 870.22 s [algebraic-graphs] OK: consistent (connect x y) == True
  20200. 870.22 s [algebraic-graphs] OK: consistent (edge x y) == True
  20201. 870.22 s [algebraic-graphs] OK: consistent (edges xs) == True
  20202. 870.22 s [algebraic-graphs] OK: consistent (stars xs) == True
  20203. 870.22 s [algebraic-graphs]
  20204. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  20205. 870.22 s [algebraic-graphs] OK: show (empty ) == "empty"
  20206. 870.22 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20207. 870.22 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20208. 870.22 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20209. 870.22 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20210. 870.22 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20211. 870.22 s [algebraic-graphs]
  20212. 870.22 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20213. 870.22 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20214. 870.22 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20215. 870.22 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20216. 870.22 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20217. 870.22 s [algebraic-graphs]
  20218. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  20219. 870.22 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20220. 870.22 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20221. 870.22 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20222. 870.22 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20223. 870.22 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20224. 870.22 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20225. 870.22 s [algebraic-graphs] OK: x <= x + y
  20226. 870.22 s [algebraic-graphs] OK: x + y <= x * y
  20227. 870.22 s [algebraic-graphs]
  20228. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  20229. 870.22 s [algebraic-graphs] OK: isEmpty empty == True
  20230. 870.22 s [algebraic-graphs] OK: hasVertex x empty == False
  20231. 870.22 s [algebraic-graphs] OK: vertexCount empty == 0
  20232. 870.22 s [algebraic-graphs] OK: edgeCount empty == 0
  20233. 870.22 s [algebraic-graphs]
  20234. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  20235. 870.22 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20236. 870.22 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20237. 870.22 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20238. 870.22 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20239. 870.22 s [algebraic-graphs]
  20240. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  20241. 870.22 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20242. 870.22 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20243. 870.22 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20244. 870.22 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20245. 870.22 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20246. 870.22 s [algebraic-graphs]
  20247. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  20248. 870.22 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20249. 870.22 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20250. 870.22 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20251. 870.22 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20252. 870.22 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20253. 870.22 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20254. 870.22 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20255. 870.22 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20256. 870.22 s [algebraic-graphs]
  20257. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  20258. 870.22 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20259. 870.22 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20260. 870.22 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20261. 870.22 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20262. 870.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20263. 870.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20264. 870.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20265. 870.22 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20266. 870.22 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20267. 870.22 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20268. 870.22 s [algebraic-graphs]
  20269. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  20270. 870.22 s [algebraic-graphs] OK: vertices [] == empty
  20271. 870.22 s [algebraic-graphs] OK: vertices [x] == vertex x
  20272. 870.22 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20273. 870.22 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20274. 870.22 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20275. 870.22 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20276. 870.22 s [algebraic-graphs]
  20277. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  20278. 870.22 s [algebraic-graphs] OK: edges [] == empty
  20279. 870.22 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20280. 870.22 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20281. 870.22 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20282. 870.22 s [algebraic-graphs]
  20283. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  20284. 870.22 s [algebraic-graphs] OK: overlays [] == empty
  20285. 870.22 s [algebraic-graphs] OK: overlays [x] == x
  20286. 870.22 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20287. 870.22 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20288. 870.22 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20289. 870.22 s [algebraic-graphs]
  20290. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  20291. 870.22 s [algebraic-graphs] OK: connects [] == empty
  20292. 870.22 s [algebraic-graphs] OK: connects [x] == x
  20293. 870.22 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20294. 870.22 s [algebraic-graphs] OK: connects == foldr connect empty
  20295. 870.22 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20296. 870.22 s [algebraic-graphs]
  20297. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  20298. 870.22 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  20299. 870.22 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  20300. 870.22 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  20301. 870.22 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  20302. 870.22 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  20303. 870.22 s [algebraic-graphs]
  20304. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  20305. 870.22 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20306. 870.22 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20307. 870.22 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20308. 870.22 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20309. 870.22 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20310. 870.22 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20311. 870.22 s [algebraic-graphs]
  20312. 870.22 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  20313. 870.22 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20314. 870.22 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20315. 870.22 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20316. 870.22 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20317. 870.22 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20318. 870.22 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20319. 870.22 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20320. 870.22 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20321. 870.22 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20322. 870.22 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20323. 870.22 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20324. 870.22 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20325. 870.22 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20326. 870.22 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20327. 870.22 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20328. 870.22 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20329. 870.22 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20330. 870.22 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20331. 870.22 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20332. 870.22 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20333. 870.22 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20334. 870.22 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20335. 870.22 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20336. 870.22 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20337. 870.22 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20338. 870.22 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20339. 870.22 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20340. 870.22 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20341. 870.22 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20342. 870.22 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20343. 870.22 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20344. 870.22 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20345. 870.22 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20346. 870.22 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20347. 870.89 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20348. 870.89 s [algebraic-graphs]
  20349. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  20350. 870.89 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20351. 870.89 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20352. 870.89 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20353. 870.89 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20354. 870.89 s [algebraic-graphs]
  20355. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  20356. 870.89 s [algebraic-graphs] OK: isEmpty empty == True
  20357. 870.89 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20358. 870.89 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20359. 870.89 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20360. 870.89 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20361. 870.89 s [algebraic-graphs]
  20362. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  20363. 870.89 s [algebraic-graphs] OK: hasVertex x empty == False
  20364. 870.89 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20365. 870.89 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20366. 870.89 s [algebraic-graphs]
  20367. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  20368. 870.89 s [algebraic-graphs] OK: hasEdge x y empty == False
  20369. 870.89 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20370. 870.89 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20371. 870.89 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20372. 870.89 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20373. 870.89 s [algebraic-graphs]
  20374. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  20375. 870.89 s [algebraic-graphs] OK: vertexCount empty == 0
  20376. 870.89 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20377. 870.89 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20378. 870.89 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20379. 870.89 s [algebraic-graphs]
  20380. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  20381. 870.89 s [algebraic-graphs] OK: edgeCount empty == 0
  20382. 870.89 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20383. 870.89 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20384. 870.89 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20385. 870.89 s [algebraic-graphs]
  20386. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  20387. 870.89 s [algebraic-graphs] OK: vertexList empty == []
  20388. 870.89 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20389. 870.89 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20390. 870.89 s [algebraic-graphs]
  20391. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  20392. 870.89 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20393. 870.89 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20394. 870.89 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20395. 870.89 s [algebraic-graphs]
  20396. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  20397. 870.89 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20398. 870.89 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20399. 870.89 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20400. 870.89 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20401. 870.89 s [algebraic-graphs]
  20402. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  20403. 870.89 s [algebraic-graphs] OK: edgeList empty == []
  20404. 870.89 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20405. 870.89 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20406. 870.89 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20407. 870.89 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20408. 870.89 s [algebraic-graphs]
  20409. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  20410. 870.89 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20411. 870.89 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20412. 870.89 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20413. 870.89 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20414. 870.89 s [algebraic-graphs]
  20415. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  20416. 870.89 s [algebraic-graphs] OK: adjacencyList empty == []
  20417. 870.89 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20418. 870.89 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20419. 870.89 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20420. 870.89 s [algebraic-graphs]
  20421. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  20422. 870.89 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20423. 870.89 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20424. 870.89 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20425. 870.89 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20426. 870.89 s [algebraic-graphs]
  20427. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  20428. 870.89 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20429. 870.89 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20430. 870.89 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20431. 870.89 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20432. 870.89 s [algebraic-graphs]
  20433. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  20434. 870.89 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20435. 870.89 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20436. 870.89 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20437. 870.89 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20438. 870.89 s [algebraic-graphs]
  20439. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  20440. 870.89 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20441. 870.89 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20442. 870.89 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20443. 870.89 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20444. 870.89 s [algebraic-graphs]
  20445. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  20446. 870.89 s [algebraic-graphs] OK: path [] == empty
  20447. 870.89 s [algebraic-graphs] OK: path [x] == vertex x
  20448. 870.89 s [algebraic-graphs] OK: path [x,y] == edge x y
  20449. 870.89 s [algebraic-graphs]
  20450. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  20451. 870.89 s [algebraic-graphs] OK: circuit [] == empty
  20452. 870.89 s [algebraic-graphs] OK: circuit [x] == edge x x
  20453. 870.89 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20454. 870.89 s [algebraic-graphs]
  20455. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  20456. 870.89 s [algebraic-graphs] OK: clique [] == empty
  20457. 870.89 s [algebraic-graphs] OK: clique [x] == vertex x
  20458. 870.89 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20459. 870.89 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20460. 870.89 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20461. 870.89 s [algebraic-graphs]
  20462. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  20463. 870.89 s [algebraic-graphs] OK: biclique [] [] == empty
  20464. 870.89 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20465. 870.89 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20466. 870.89 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20467. 870.89 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20468. 870.89 s [algebraic-graphs]
  20469. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  20470. 870.89 s [algebraic-graphs] OK: star x [] == vertex x
  20471. 870.89 s [algebraic-graphs] OK: star x [y] == edge x y
  20472. 870.89 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20473. 870.89 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20474. 870.89 s [algebraic-graphs]
  20475. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  20476. 870.89 s [algebraic-graphs] OK: stars [] == empty
  20477. 870.89 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20478. 870.89 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20479. 870.89 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20480. 870.89 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20481. 870.89 s [algebraic-graphs] OK: stars . adjacencyList == id
  20482. 870.89 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20483. 870.89 s [algebraic-graphs]
  20484. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  20485. 870.89 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20486. 870.89 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20487. 870.89 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20488. 870.89 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20489. 870.89 s [algebraic-graphs]
  20490. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  20491. 870.89 s [algebraic-graphs] OK: forest [] == empty
  20492. 870.89 s [algebraic-graphs] OK: forest [x] == tree x
  20493. 870.89 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20494. 870.89 s [algebraic-graphs] OK: forest == overlays . map tree
  20495. 870.89 s [algebraic-graphs]
  20496. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  20497. 870.89 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20498. 870.89 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20499. 870.89 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20500. 870.89 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20501. 870.89 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20502. 870.89 s [algebraic-graphs]
  20503. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  20504. 870.89 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20505. 870.89 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20506. 870.89 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20507. 870.89 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20508. 870.89 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20509. 870.89 s [algebraic-graphs]
  20510. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  20511. 870.89 s [algebraic-graphs] OK: replaceVertex x x == id
  20512. 870.89 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20513. 870.89 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20514. 870.89 s [algebraic-graphs]
  20515. 870.89 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  20516. 870.89 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20517. 870.89 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20518. 870.89 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20519. 870.90 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20520. 870.90 s [algebraic-graphs]
  20521. 870.90 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  20522. 870.90 s [algebraic-graphs] OK: transpose empty == empty
  20523. 870.90 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20524. 870.90 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20525. 870.90 s [algebraic-graphs] OK: transpose . transpose == id
  20526. 870.90 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20527. 870.90 s [algebraic-graphs]
  20528. 870.90 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  20529. 870.90 s [algebraic-graphs] OK: gmap f empty == empty
  20530. 870.90 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20531. 870.90 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20532. 870.90 s [algebraic-graphs] OK: gmap id == id
  20533. 870.90 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20534. 870.90 s [algebraic-graphs]
  20535. 870.90 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  20536. 870.90 s [algebraic-graphs] OK: induce (const True ) x == x
  20537. 870.90 s [algebraic-graphs] OK: induce (const False) x == empty
  20538. 870.90 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20539. 870.90 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20540. 870.90 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20541. 870.90 s [algebraic-graphs]
  20542. 870.90 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  20543. 870.90 s [algebraic-graphs] OK: compose empty x == empty
  20544. 870.90 s [algebraic-graphs] OK: compose x empty == empty
  20545. 870.90 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20546. 870.90 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20547. 870.90 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20548. 870.90 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20549. 871.10 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20550. 871.10 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20551. 871.10 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20552. 871.10 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20553. 871.10 s [algebraic-graphs]
  20554. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  20555. 871.10 s [algebraic-graphs] OK: closure empty == empty
  20556. 871.10 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20557. 871.10 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20558. 871.10 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20559. 871.10 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20560. 871.10 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20561. 871.10 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20562. 871.10 s [algebraic-graphs] OK: closure . closure == closure
  20563. 871.10 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20564. 871.10 s [algebraic-graphs]
  20565. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  20566. 871.10 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20567. 871.10 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20568. 871.10 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20569. 871.10 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20570. 871.10 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20571. 871.10 s [algebraic-graphs]
  20572. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  20573. 871.10 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20574. 871.10 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20575. 871.10 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20576. 871.10 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20577. 871.10 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20578. 871.10 s [algebraic-graphs]
  20579. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  20580. 871.10 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20581. 871.10 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20582. 871.10 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20583. 871.10 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20584. 871.10 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20585. 871.10 s [algebraic-graphs]
  20586. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  20587. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  20588. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  20589. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  20590. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  20591. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  20592. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  20593. 871.10 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  20594. 871.10 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  20595. 871.10 s [algebraic-graphs] OK: bfsForest x [] == []
  20596. 871.10 s [algebraic-graphs] OK: bfsForest empty vs == []
  20597. 871.10 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20598. 871.10 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  20599. 871.10 s [algebraic-graphs]
  20600. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  20601. 871.10 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  20602. 871.10 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  20603. 871.10 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  20604. 871.10 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  20605. 871.10 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  20606. 871.10 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  20607. 871.10 s [algebraic-graphs] OK: bfs empty vs == []
  20608. 871.10 s [algebraic-graphs] OK: bfs x [] == []
  20609. 871.10 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  20610. 871.10 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  20611. 871.10 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  20612. 871.10 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  20613. 871.10 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  20614. 871.10 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  20615. 871.10 s [algebraic-graphs]
  20616. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  20617. 871.10 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  20618. 871.10 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  20619. 871.10 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  20620. 871.10 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  20621. 871.10 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  20622. 871.10 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  20623. 871.10 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  20624. 871.10 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  20625. 871.10 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  20626. 871.10 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  20627. 871.10 s [algebraic-graphs]
  20628. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  20629. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  20630. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  20631. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  20632. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  20633. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  20634. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  20635. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  20636. 871.10 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  20637. 871.10 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  20638. 871.10 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  20639. 871.10 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  20640. 871.10 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  20641. 871.10 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  20642. 871.10 s [algebraic-graphs]
  20643. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20644. 871.10 s [algebraic-graphs] OK: dfs empty vs == []
  20645. 871.10 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  20646. 871.10 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  20647. 871.10 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  20648. 871.10 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  20649. 871.10 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  20650. 871.10 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  20651. 871.10 s [algebraic-graphs] OK: dfs x [] == []
  20652. 871.10 s [algebraic-graphs]
  20653. 871.10 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  20654. 871.10 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  20655. 871.10 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  20656. 871.10 s [algebraic-graphs]
  20657. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  20658. 871.10 s [algebraic-graphs] OK: reachable empty x == []
  20659. 871.10 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  20660. 871.10 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  20661. 871.10 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  20662. 871.10 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  20663. 871.10 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  20664. 871.10 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  20665. 871.10 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  20666. 871.10 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  20667. 871.10 s [algebraic-graphs]
  20668. 871.10 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  20669. 871.10 s [algebraic-graphs]
  20670. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  20671. 871.10 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  20672. 871.10 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  20673. 871.10 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  20674. 871.10 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  20675. 871.10 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  20676. 871.10 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  20677. 871.10 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  20678. 871.10 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  20679. 871.10 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  20680. 871.10 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  20681. 871.10 s [algebraic-graphs]
  20682. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  20683. 871.10 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  20684. 871.10 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  20685. 871.10 s [algebraic-graphs] OK: isAcyclic . circuit == null
  20686. 871.10 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  20687. 871.10 s [algebraic-graphs]
  20688. 871.10 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  20689. 871.10 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  20690. 871.10 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  20691. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  20692. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  20693. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  20694. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  20695. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  20696. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  20697. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  20698. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  20699. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  20700. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  20701. 871.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  20702. 875.43 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  20703. 875.43 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  20704. 875.56 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  20705. 875.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  20706. 875.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  20707. 875.57 s [algebraic-graphs]
  20708. 875.57 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  20709. 875.57 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  20710. 875.57 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  20711. 875.57 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  20712. 875.57 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  20713. 875.57 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  20714. 875.57 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  20715. 875.57 s [algebraic-graphs]
  20716. 875.57 s [algebraic-graphs] ============ AdjacencyMap ============
  20717. 875.57 s [algebraic-graphs] OK: Axioms of graphs
  20718. 875.57 s [algebraic-graphs]
  20719. 875.57 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  20720. 875.57 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20721. 875.57 s [algebraic-graphs]
  20722. 875.57 s [algebraic-graphs] OK: consistent empty == True
  20723. 875.57 s [algebraic-graphs] OK: consistent (vertex x) == True
  20724. 875.57 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20725. 875.57 s [algebraic-graphs] OK: consistent (connect x y) == True
  20726. 875.57 s [algebraic-graphs] OK: consistent (edge x y) == True
  20727. 875.57 s [algebraic-graphs] OK: consistent (edges xs) == True
  20728. 875.57 s [algebraic-graphs] OK: consistent (stars xs) == True
  20729. 875.57 s [algebraic-graphs]
  20730. 875.57 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  20731. 875.57 s [algebraic-graphs] OK: show (empty ) == "empty"
  20732. 875.57 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20733. 875.57 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20734. 875.57 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20735. 875.57 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20736. 875.57 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20737. 875.57 s [algebraic-graphs]
  20738. 875.57 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20739. 875.57 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20740. 875.57 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20741. 875.57 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20742. 875.57 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20743. 875.57 s [algebraic-graphs]
  20744. 875.57 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  20745. 875.57 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20746. 875.57 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20747. 875.57 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20748. 875.57 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20749. 875.57 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20750. 875.57 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20751. 875.57 s [algebraic-graphs] OK: x <= x + y
  20752. 875.57 s [algebraic-graphs] OK: x + y <= x * y
  20753. 875.57 s [algebraic-graphs]
  20754. 875.57 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  20755. 875.57 s [algebraic-graphs] OK: isEmpty empty == True
  20756. 875.57 s [algebraic-graphs] OK: hasVertex x empty == False
  20757. 875.57 s [algebraic-graphs] OK: vertexCount empty == 0
  20758. 875.57 s [algebraic-graphs] OK: edgeCount empty == 0
  20759. 875.57 s [algebraic-graphs]
  20760. 875.57 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  20761. 875.57 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20762. 875.57 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20763. 875.57 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20764. 875.57 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20765. 875.57 s [algebraic-graphs]
  20766. 875.57 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  20767. 875.57 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20768. 875.57 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20769. 875.57 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20770. 875.57 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20771. 875.57 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20772. 875.57 s [algebraic-graphs]
  20773. 875.57 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  20774. 875.57 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20775. 875.57 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20776. 875.57 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20777. 875.57 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20778. 875.57 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20779. 875.57 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20780. 875.57 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20781. 875.57 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20782. 875.57 s [algebraic-graphs]
  20783. 875.57 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  20784. 875.57 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20785. 875.57 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20786. 875.57 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20787. 875.57 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20788. 875.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20789. 875.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20790. 875.57 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20791. 875.57 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20792. 875.57 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20793. 875.57 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20794. 875.57 s [algebraic-graphs]
  20795. 875.57 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  20796. 875.57 s [algebraic-graphs] OK: vertices [] == empty
  20797. 875.57 s [algebraic-graphs] OK: vertices [x] == vertex x
  20798. 875.57 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20799. 875.57 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20800. 875.57 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20801. 875.57 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20802. 875.57 s [algebraic-graphs]
  20803. 875.57 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  20804. 875.57 s [algebraic-graphs] OK: edges [] == empty
  20805. 875.57 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20806. 875.57 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20807. 875.57 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20808. 875.57 s [algebraic-graphs]
  20809. 875.57 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  20810. 875.57 s [algebraic-graphs] OK: overlays [] == empty
  20811. 875.57 s [algebraic-graphs] OK: overlays [x] == x
  20812. 875.57 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20813. 875.57 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20814. 875.57 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20815. 875.57 s [algebraic-graphs]
  20816. 875.57 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  20817. 875.57 s [algebraic-graphs] OK: connects [] == empty
  20818. 875.57 s [algebraic-graphs] OK: connects [x] == x
  20819. 875.57 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20820. 875.57 s [algebraic-graphs] OK: connects == foldr connect empty
  20821. 875.57 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20822. 875.57 s [algebraic-graphs]
  20823. 875.57 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  20824. 875.57 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  20825. 875.57 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  20826. 875.57 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  20827. 875.57 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  20828. 875.57 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  20829. 875.57 s [algebraic-graphs]
  20830. 875.57 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  20831. 875.57 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20832. 875.57 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20833. 875.57 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20834. 875.57 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20835. 875.57 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20836. 875.57 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20837. 875.57 s [algebraic-graphs]
  20838. 875.57 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  20839. 875.57 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20840. 875.57 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20841. 875.57 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20842. 875.57 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20843. 875.57 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20844. 875.57 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20845. 875.57 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20846. 875.57 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20847. 875.57 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20848. 875.57 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20849. 875.57 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20850. 875.57 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20851. 875.57 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20852. 875.57 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20853. 875.57 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20854. 875.57 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20855. 875.57 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20856. 875.57 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20857. 875.57 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20858. 875.57 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20859. 875.57 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20860. 875.57 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20861. 875.57 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20862. 875.57 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20863. 875.57 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20864. 875.57 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20865. 875.57 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20866. 875.57 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20867. 875.57 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20868. 875.57 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20869. 875.57 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20870. 875.57 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20871. 875.57 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20872. 876.99 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20873. 877.00 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20874. 877.00 s [algebraic-graphs]
  20875. 877.00 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  20876. 877.00 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20877. 877.00 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20878. 877.00 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20879. 877.00 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20880. 877.00 s [algebraic-graphs]
  20881. 877.00 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  20882. 877.00 s [algebraic-graphs] OK: isEmpty empty == True
  20883. 877.00 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20884. 877.00 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20885. 877.00 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20886. 877.00 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20887. 877.00 s [algebraic-graphs]
  20888. 877.00 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  20889. 877.00 s [algebraic-graphs] OK: hasVertex x empty == False
  20890. 877.00 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20891. 877.00 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20892. 877.00 s [algebraic-graphs]
  20893. 877.00 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  20894. 877.00 s [algebraic-graphs] OK: hasEdge x y empty == False
  20895. 877.00 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20896. 877.00 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20897. 877.00 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20898. 877.00 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20899. 877.00 s [algebraic-graphs]
  20900. 877.00 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  20901. 877.00 s [algebraic-graphs] OK: vertexCount empty == 0
  20902. 877.00 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20903. 877.00 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20904. 877.00 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20905. 877.00 s [algebraic-graphs]
  20906. 877.00 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  20907. 877.00 s [algebraic-graphs] OK: edgeCount empty == 0
  20908. 877.00 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20909. 877.00 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20910. 877.00 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20911. 877.00 s [algebraic-graphs]
  20912. 877.00 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  20913. 877.00 s [algebraic-graphs] OK: vertexList empty == []
  20914. 877.00 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20915. 877.00 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20916. 877.00 s [algebraic-graphs]
  20917. 877.00 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  20918. 877.00 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20919. 877.00 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20920. 877.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20921. 877.00 s [algebraic-graphs]
  20922. 877.00 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  20923. 877.00 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20924. 877.00 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20925. 877.00 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20926. 877.00 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20927. 877.00 s [algebraic-graphs]
  20928. 877.00 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  20929. 877.00 s [algebraic-graphs] OK: edgeList empty == []
  20930. 877.00 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20931. 877.00 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20932. 877.00 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20933. 877.00 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20934. 877.00 s [algebraic-graphs]
  20935. 877.00 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  20936. 877.00 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20937. 877.00 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20938. 877.00 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20939. 877.00 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20940. 877.00 s [algebraic-graphs]
  20941. 877.00 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  20942. 877.00 s [algebraic-graphs] OK: adjacencyList empty == []
  20943. 877.00 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20944. 877.00 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20945. 877.00 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20946. 877.00 s [algebraic-graphs]
  20947. 877.00 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  20948. 877.00 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20949. 877.00 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20950. 877.00 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20951. 877.00 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20952. 877.00 s [algebraic-graphs]
  20953. 877.00 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  20954. 877.00 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20955. 877.00 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20956. 877.00 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20957. 877.00 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20958. 877.00 s [algebraic-graphs]
  20959. 877.00 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  20960. 877.00 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20961. 877.00 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20962. 877.00 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20963. 877.00 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20964. 877.00 s [algebraic-graphs]
  20965. 877.00 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  20966. 877.00 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20967. 877.00 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20968. 877.00 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20969. 877.00 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20970. 877.00 s [algebraic-graphs]
  20971. 877.00 s [algebraic-graphs] ============ AdjacencyMap.path ============
  20972. 877.00 s [algebraic-graphs] OK: path [] == empty
  20973. 877.00 s [algebraic-graphs] OK: path [x] == vertex x
  20974. 877.00 s [algebraic-graphs] OK: path [x,y] == edge x y
  20975. 877.00 s [algebraic-graphs]
  20976. 877.00 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  20977. 877.00 s [algebraic-graphs] OK: circuit [] == empty
  20978. 877.00 s [algebraic-graphs] OK: circuit [x] == edge x x
  20979. 877.00 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20980. 877.00 s [algebraic-graphs]
  20981. 877.00 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  20982. 877.00 s [algebraic-graphs] OK: clique [] == empty
  20983. 877.00 s [algebraic-graphs] OK: clique [x] == vertex x
  20984. 877.00 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20985. 877.00 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20986. 877.00 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20987. 877.00 s [algebraic-graphs]
  20988. 877.00 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  20989. 877.00 s [algebraic-graphs] OK: biclique [] [] == empty
  20990. 877.00 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20991. 877.00 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20992. 877.00 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20993. 877.00 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20994. 877.00 s [algebraic-graphs]
  20995. 877.00 s [algebraic-graphs] ============ AdjacencyMap.star ============
  20996. 877.00 s [algebraic-graphs] OK: star x [] == vertex x
  20997. 877.00 s [algebraic-graphs] OK: star x [y] == edge x y
  20998. 877.00 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20999. 877.00 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21000. 877.00 s [algebraic-graphs]
  21001. 877.00 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  21002. 877.00 s [algebraic-graphs] OK: stars [] == empty
  21003. 877.00 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21004. 877.00 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21005. 877.00 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21006. 877.00 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21007. 877.00 s [algebraic-graphs] OK: stars . adjacencyList == id
  21008. 877.00 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21009. 877.00 s [algebraic-graphs]
  21010. 877.00 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  21011. 877.00 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21012. 877.00 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21013. 877.00 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21014. 877.00 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21015. 877.00 s [algebraic-graphs]
  21016. 877.00 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  21017. 877.00 s [algebraic-graphs] OK: forest [] == empty
  21018. 877.00 s [algebraic-graphs] OK: forest [x] == tree x
  21019. 877.00 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21020. 877.00 s [algebraic-graphs] OK: forest == overlays . map tree
  21021. 877.00 s [algebraic-graphs]
  21022. 877.00 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  21023. 877.00 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21024. 877.00 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21025. 877.00 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21026. 877.00 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21027. 877.00 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21028. 877.00 s [algebraic-graphs]
  21029. 877.00 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  21030. 877.00 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21031. 877.00 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21032. 877.00 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21033. 877.00 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21034. 877.00 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21035. 877.00 s [algebraic-graphs]
  21036. 877.00 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  21037. 877.00 s [algebraic-graphs] OK: replaceVertex x x == id
  21038. 877.00 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21039. 877.00 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21040. 877.00 s [algebraic-graphs]
  21041. 877.00 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  21042. 877.00 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21043. 877.01 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21044. 877.01 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21045. 877.01 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21046. 877.01 s [algebraic-graphs]
  21047. 877.01 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  21048. 877.01 s [algebraic-graphs] OK: transpose empty == empty
  21049. 877.01 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  21050. 877.01 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  21051. 877.01 s [algebraic-graphs] OK: transpose . transpose == id
  21052. 877.01 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  21053. 877.01 s [algebraic-graphs]
  21054. 877.01 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  21055. 877.01 s [algebraic-graphs] OK: gmap f empty == empty
  21056. 877.01 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21057. 877.01 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21058. 877.01 s [algebraic-graphs] OK: gmap id == id
  21059. 877.01 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21060. 877.01 s [algebraic-graphs]
  21061. 877.01 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  21062. 877.01 s [algebraic-graphs] OK: induce (const True ) x == x
  21063. 877.01 s [algebraic-graphs] OK: induce (const False) x == empty
  21064. 877.01 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21065. 877.01 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21066. 877.01 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21067. 877.01 s [algebraic-graphs]
  21068. 877.01 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  21069. 877.01 s [algebraic-graphs] OK: compose empty x == empty
  21070. 877.01 s [algebraic-graphs] OK: compose x empty == empty
  21071. 877.01 s [algebraic-graphs] OK: compose (vertex x) y == empty
  21072. 877.01 s [algebraic-graphs] OK: compose x (vertex y) == empty
  21073. 877.01 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  21074. 877.01 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  21075. 878.72 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  21076. 878.72 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  21077. 878.72 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  21078. 878.72 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  21079. 878.72 s [algebraic-graphs]
  21080. 878.72 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  21081. 878.72 s [algebraic-graphs] OK: closure empty == empty
  21082. 878.72 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  21083. 878.72 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  21084. 878.72 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21085. 878.72 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  21086. 878.72 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  21087. 878.72 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  21088. 878.72 s [algebraic-graphs] OK: closure . closure == closure
  21089. 878.72 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  21090. 878.72 s [algebraic-graphs]
  21091. 878.72 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  21092. 878.72 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  21093. 878.72 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  21094. 878.72 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  21095. 878.72 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  21096. 878.72 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  21097. 878.72 s [algebraic-graphs]
  21098. 878.72 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  21099. 878.72 s [algebraic-graphs] OK: symmetricClosure empty == empty
  21100. 878.72 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  21101. 878.72 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  21102. 878.72 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  21103. 878.72 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  21104. 878.72 s [algebraic-graphs]
  21105. 878.72 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  21106. 878.72 s [algebraic-graphs] OK: transitiveClosure empty == empty
  21107. 878.72 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  21108. 878.72 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  21109. 878.72 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  21110. 878.72 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  21111. 878.72 s [algebraic-graphs]
  21112. 878.72 s [algebraic-graphs] ============ AdjacencyMap.box ============
  21113. 878.72 s [algebraic-graphs] OK: box x y ~~ box y x
  21114. 878.72 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  21115. 878.72 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  21116. 878.72 s [algebraic-graphs] OK: box x empty ~~ empty
  21117. 878.72 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21118. 878.72 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  21119. 878.72 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  21120. 878.72 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21121. 878.72 s [algebraic-graphs]
  21122. 878.72 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  21123. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  21124. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  21125. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  21126. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  21127. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  21128. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  21129. 878.72 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  21130. 878.72 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  21131. 878.72 s [algebraic-graphs] OK: bfsForest x [] == []
  21132. 878.72 s [algebraic-graphs] OK: bfsForest empty vs == []
  21133. 878.72 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21134. 878.72 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  21135. 878.72 s [algebraic-graphs]
  21136. 878.72 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  21137. 878.72 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  21138. 878.72 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  21139. 878.72 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  21140. 878.72 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  21141. 878.72 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  21142. 878.72 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  21143. 878.72 s [algebraic-graphs] OK: bfs empty vs == []
  21144. 878.72 s [algebraic-graphs] OK: bfs x [] == []
  21145. 878.72 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  21146. 878.72 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  21147. 878.72 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  21148. 878.72 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  21149. 878.72 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  21150. 878.72 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  21151. 878.73 s [algebraic-graphs]
  21152. 878.73 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  21153. 878.73 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  21154. 878.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  21155. 878.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  21156. 878.73 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  21157. 878.73 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  21158. 878.73 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  21159. 878.73 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  21160. 878.73 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  21161. 878.73 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  21162. 878.73 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  21163. 878.73 s [algebraic-graphs]
  21164. 878.73 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  21165. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  21166. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  21167. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  21168. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  21169. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  21170. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  21171. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  21172. 878.73 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  21173. 878.73 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  21174. 878.73 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  21175. 878.73 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  21176. 878.73 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  21177. 878.73 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  21178. 878.73 s [algebraic-graphs]
  21179. 878.73 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21180. 878.73 s [algebraic-graphs] OK: dfs empty vs == []
  21181. 878.73 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  21182. 878.73 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  21183. 878.73 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  21184. 878.73 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  21185. 878.73 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  21186. 878.73 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  21187. 878.73 s [algebraic-graphs] OK: dfs x [] == []
  21188. 878.73 s [algebraic-graphs]
  21189. 878.73 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  21190. 878.73 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  21191. 878.73 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  21192. 878.73 s [algebraic-graphs]
  21193. 878.73 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  21194. 878.73 s [algebraic-graphs] OK: reachable empty x == []
  21195. 878.73 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  21196. 878.73 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  21197. 878.73 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  21198. 878.73 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  21199. 878.73 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  21200. 878.73 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  21201. 878.73 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  21202. 878.73 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  21203. 878.73 s [algebraic-graphs]
  21204. 878.73 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  21205. 878.73 s [algebraic-graphs]
  21206. 878.73 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  21207. 878.73 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  21208. 878.73 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  21209. 878.73 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  21210. 878.73 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  21211. 878.73 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  21212. 878.73 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  21213. 878.73 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  21214. 878.73 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  21215. 878.73 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  21216. 878.73 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  21217. 878.73 s [algebraic-graphs]
  21218. 878.73 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  21219. 878.73 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  21220. 878.73 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  21221. 878.73 s [algebraic-graphs] OK: isAcyclic . circuit == null
  21222. 878.73 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  21223. 878.73 s [algebraic-graphs]
  21224. 878.73 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  21225. 878.73 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  21226. 878.73 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  21227. 878.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  21228. 878.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  21229. 878.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  21230. 878.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  21231. 878.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  21232. 883.62 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  21233. 883.62 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  21234. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  21235. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  21236. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  21237. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  21238. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  21239. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  21240. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  21241. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  21242. 883.74 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  21243. 883.74 s [algebraic-graphs]
  21244. 883.74 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  21245. 883.74 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  21246. 883.74 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  21247. 883.74 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  21248. 883.74 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  21249. 883.74 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  21250. 883.74 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  21251. 883.74 s [algebraic-graphs]
  21252. 883.74 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  21253. 883.74 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21254. 883.74 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21255. 883.74 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21256. 883.74 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21257. 883.74 s [algebraic-graphs]
  21258. 883.74 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  21259. 883.74 s [algebraic-graphs] OK: scc empty == empty
  21260. 883.74 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  21261. 883.74 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  21262. 883.74 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  21263. 883.74 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  21264. 883.74 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  21265. 883.74 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  21266. 883.74 s [algebraic-graphs] OK: isAcyclic . scc == const True
  21267. 883.74 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  21268. 883.74 s [algebraic-graphs] OK: scc g == KL.scc g
  21269. 883.74 s [algebraic-graphs]
  21270. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  21271. 883.74 s [algebraic-graphs] OK: 0 == rightVertex 0
  21272. 883.74 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  21273. 883.74 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  21274. 883.74 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  21275. 883.74 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  21276. 883.74 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  21277. 883.74 s [algebraic-graphs]
  21278. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  21279. 883.74 s [algebraic-graphs] OK: show empty == "empty"
  21280. 883.74 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  21281. 883.74 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  21282. 883.74 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  21283. 883.74 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  21284. 883.74 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  21285. 883.74 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  21286. 883.74 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  21287. 883.74 s [algebraic-graphs]
  21288. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  21289. 883.74 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  21290. 883.74 s [algebraic-graphs]
  21291. 883.74 s [algebraic-graphs] OK: x + y == y + x
  21292. 883.74 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  21293. 883.74 s [algebraic-graphs] OK: x * empty == x
  21294. 883.74 s [algebraic-graphs] OK: empty * x == x
  21295. 883.74 s [algebraic-graphs] OK: x * y == y * x
  21296. 883.74 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  21297. 883.74 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  21298. 883.74 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  21299. 883.74 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  21300. 883.74 s [algebraic-graphs] OK: x + empty == x
  21301. 883.74 s [algebraic-graphs] OK: empty + x == x
  21302. 883.74 s [algebraic-graphs] OK: x + x == x
  21303. 883.74 s [algebraic-graphs] OK: x * y + x + y == x * y
  21304. 883.74 s [algebraic-graphs] OK: x * x * x == x * x
  21305. 883.74 s [algebraic-graphs]
  21306. 883.74 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  21307. 883.74 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  21308. 883.74 s [algebraic-graphs]
  21309. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  21310. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21311. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21312. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21313. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21314. 883.74 s [algebraic-graphs]
  21315. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  21316. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21317. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21318. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21319. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21320. 883.74 s [algebraic-graphs]
  21321. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  21322. 883.74 s [algebraic-graphs] OK: isEmpty empty == True
  21323. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  21324. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  21325. 883.74 s [algebraic-graphs] OK: hasVertex x empty == False
  21326. 883.74 s [algebraic-graphs]
  21327. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  21328. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  21329. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  21330. 883.74 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21331. 883.74 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21332. 883.74 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  21333. 883.74 s [algebraic-graphs]
  21334. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  21335. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  21336. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  21337. 883.74 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21338. 883.74 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21339. 883.74 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  21340. 883.74 s [algebraic-graphs]
  21341. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  21342. 883.74 s [algebraic-graphs] OK: vertex . Left == leftVertex
  21343. 883.74 s [algebraic-graphs] OK: vertex . Right == rightVertex
  21344. 883.74 s [algebraic-graphs]
  21345. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  21346. 883.74 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  21347. 883.74 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  21348. 883.74 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  21349. 883.74 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21350. 883.74 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  21351. 883.74 s [algebraic-graphs]
  21352. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  21353. 883.74 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21354. 883.74 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21355. 883.74 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21356. 883.74 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21357. 883.74 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21358. 883.74 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21359. 883.74 s [algebraic-graphs]
  21360. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  21361. 883.74 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  21362. 883.74 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  21363. 883.74 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  21364. 883.74 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  21365. 883.74 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  21366. 883.74 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21367. 883.74 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21368. 883.74 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21369. 883.74 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21370. 883.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21371. 883.74 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  21372. 883.74 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  21373. 883.74 s [algebraic-graphs]
  21374. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  21375. 883.74 s [algebraic-graphs] OK: vertices [] [] == empty
  21376. 883.74 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  21377. 883.74 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  21378. 883.74 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  21379. 883.74 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  21380. 883.74 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  21381. 883.74 s [algebraic-graphs]
  21382. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  21383. 883.74 s [algebraic-graphs] OK: edges [] == empty
  21384. 883.74 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21385. 883.74 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21386. 883.74 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  21387. 883.74 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21388. 883.74 s [algebraic-graphs]
  21389. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  21390. 883.74 s [algebraic-graphs] OK: overlays [] == empty
  21391. 883.74 s [algebraic-graphs] OK: overlays [x] == x
  21392. 883.74 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21393. 883.74 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21394. 883.74 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21395. 883.74 s [algebraic-graphs]
  21396. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  21397. 883.74 s [algebraic-graphs] OK: connects [] == empty
  21398. 883.74 s [algebraic-graphs] OK: connects [x] == x
  21399. 883.74 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21400. 883.74 s [algebraic-graphs] OK: connects == foldr connect empty
  21401. 883.74 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21402. 883.74 s [algebraic-graphs]
  21403. 883.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  21404. 884.74 s [algebraic-graphs] OK: swap empty == empty
  21405. 884.74 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  21406. 884.74 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  21407. 884.74 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  21408. 884.74 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  21409. 884.74 s [algebraic-graphs] OK: swap . swap == id
  21410. 884.74 s [algebraic-graphs]
  21411. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  21412. 884.74 s [algebraic-graphs] OK: toBipartite empty == empty
  21413. 884.74 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  21414. 884.74 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  21415. 884.74 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  21416. 884.74 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  21417. 884.74 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  21418. 884.74 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  21419. 884.74 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  21420. 884.74 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  21421. 884.74 s [algebraic-graphs]
  21422. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  21423. 884.74 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  21424. 884.74 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  21425. 884.74 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  21426. 884.74 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  21427. 884.74 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  21428. 884.74 s [algebraic-graphs]
  21429. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  21430. 884.74 s [algebraic-graphs] OK: fromBipartite empty == empty
  21431. 884.74 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  21432. 884.74 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  21433. 884.74 s [algebraic-graphs]
  21434. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  21435. 884.74 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  21436. 884.74 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  21437. 884.74 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  21438. 884.74 s [algebraic-graphs]
  21439. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  21440. 884.74 s [algebraic-graphs] OK: isEmpty empty == True
  21441. 884.74 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21442. 884.74 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21443. 884.74 s [algebraic-graphs] OK: isEmpty == (==) empty
  21444. 884.74 s [algebraic-graphs]
  21445. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  21446. 884.74 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  21447. 884.74 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  21448. 884.74 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  21449. 884.74 s [algebraic-graphs]
  21450. 884.74 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  21451. 884.75 s [algebraic-graphs] OK: hasRightVertex x empty == False
  21452. 884.75 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  21453. 884.75 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  21454. 884.75 s [algebraic-graphs]
  21455. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  21456. 884.75 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  21457. 884.75 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  21458. 884.75 s [algebraic-graphs]
  21459. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  21460. 884.75 s [algebraic-graphs] OK: hasEdge x y empty == False
  21461. 884.75 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21462. 884.75 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21463. 884.75 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21464. 884.75 s [algebraic-graphs]
  21465. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  21466. 884.75 s [algebraic-graphs] OK: leftVertexCount empty == 0
  21467. 884.75 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  21468. 884.75 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  21469. 884.75 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  21470. 884.75 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  21471. 884.75 s [algebraic-graphs]
  21472. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  21473. 884.75 s [algebraic-graphs] OK: rightVertexCount empty == 0
  21474. 884.75 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  21475. 884.75 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  21476. 884.75 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  21477. 884.75 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  21478. 884.75 s [algebraic-graphs]
  21479. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  21480. 884.75 s [algebraic-graphs] OK: vertexCount empty == 0
  21481. 884.75 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21482. 884.75 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  21483. 884.75 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  21484. 884.75 s [algebraic-graphs]
  21485. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  21486. 884.75 s [algebraic-graphs] OK: edgeCount empty == 0
  21487. 884.75 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21488. 884.75 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21489. 884.75 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21490. 884.75 s [algebraic-graphs]
  21491. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  21492. 884.75 s [algebraic-graphs] OK: leftVertexList empty == []
  21493. 884.75 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  21494. 884.75 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  21495. 884.75 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  21496. 884.75 s [algebraic-graphs]
  21497. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  21498. 884.75 s [algebraic-graphs] OK: rightVertexList empty == []
  21499. 884.75 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  21500. 884.75 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  21501. 884.75 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  21502. 884.75 s [algebraic-graphs]
  21503. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  21504. 884.75 s [algebraic-graphs] OK: vertexList empty == []
  21505. 884.75 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21506. 884.75 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  21507. 884.75 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  21508. 884.75 s [algebraic-graphs]
  21509. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  21510. 884.75 s [algebraic-graphs] OK: edgeList empty == []
  21511. 884.75 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21512. 884.75 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  21513. 884.75 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  21514. 884.75 s [algebraic-graphs]
  21515. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  21516. 884.75 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  21517. 884.75 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  21518. 884.75 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  21519. 884.75 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  21520. 884.75 s [algebraic-graphs]
  21521. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  21522. 884.75 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  21523. 884.75 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  21524. 884.75 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  21525. 884.75 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  21526. 884.75 s [algebraic-graphs]
  21527. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  21528. 884.75 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21529. 884.75 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21530. 884.75 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  21531. 884.75 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  21532. 884.75 s [algebraic-graphs]
  21533. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  21534. 884.75 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21535. 884.75 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21536. 884.75 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  21537. 884.75 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  21538. 884.75 s [algebraic-graphs]
  21539. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  21540. 884.75 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  21541. 884.75 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  21542. 884.75 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  21543. 884.75 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  21544. 884.75 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  21545. 884.75 s [algebraic-graphs]
  21546. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  21547. 884.75 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  21548. 884.75 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  21549. 884.75 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  21550. 884.75 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  21551. 884.75 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  21552. 884.75 s [algebraic-graphs]
  21553. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  21554. 884.75 s [algebraic-graphs] OK: evenList [] == Nil
  21555. 884.75 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  21556. 884.75 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  21557. 884.75 s [algebraic-graphs]
  21558. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  21559. 884.75 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  21560. 884.75 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  21561. 884.75 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  21562. 884.75 s [algebraic-graphs]
  21563. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  21564. 884.75 s [algebraic-graphs] OK: path Nil == empty
  21565. 884.75 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  21566. 884.75 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  21567. 884.75 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  21568. 884.75 s [algebraic-graphs]
  21569. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  21570. 884.75 s [algebraic-graphs] OK: circuit [] == empty
  21571. 884.75 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  21572. 884.75 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  21573. 884.75 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  21574. 884.75 s [algebraic-graphs]
  21575. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  21576. 884.75 s [algebraic-graphs] OK: biclique [] [] == empty
  21577. 884.75 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  21578. 884.75 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  21579. 884.75 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  21580. 884.75 s [algebraic-graphs]
  21581. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  21582. 884.75 s [algebraic-graphs] OK: star x [] == leftVertex x
  21583. 884.75 s [algebraic-graphs] OK: star x [y] == edge x y
  21584. 884.75 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21585. 884.75 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  21586. 884.75 s [algebraic-graphs]
  21587. 884.75 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  21588. 884.75 s [algebraic-graphs] OK: stars [] == empty
  21589. 884.75 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  21590. 884.75 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21591. 884.75 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21592. 896.09 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21593. 896.12 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21594. 896.12 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21595. 896.12 s [algebraic-graphs]
  21596. 896.12 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  21597. 896.12 s [algebraic-graphs] OK: mesh xs [] == empty
  21598. 896.12 s [algebraic-graphs] OK: mesh [] ys == empty
  21599. 896.12 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  21600. 896.12 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  21601. 896.13 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  21602. 896.13 s [algebraic-graphs]
  21603. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  21604. 896.13 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  21605. 896.13 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  21606. 896.13 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  21607. 896.13 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  21608. 896.13 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  21609. 896.13 s [algebraic-graphs]
  21610. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  21611. 896.13 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  21612. 896.13 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  21613. 896.13 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  21614. 896.13 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  21615. 896.13 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  21616. 896.13 s [algebraic-graphs]
  21617. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  21618. 896.13 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  21619. 896.13 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21620. 896.13 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  21621. 896.13 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  21622. 896.13 s [algebraic-graphs]
  21623. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  21624. 896.13 s [algebraic-graphs] OK: bimap f g empty == empty
  21625. 896.13 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  21626. 896.13 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  21627. 896.13 s [algebraic-graphs] OK: bimap id id == id
  21628. 896.13 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  21629. 896.13 s [algebraic-graphs]
  21630. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  21631. 896.13 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  21632. 896.13 s [algebraic-graphs]
  21633. 896.13 s [algebraic-graphs] OK: box x y ~~ box y x
  21634. 896.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21635. 896.13 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  21636. 896.13 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  21637. 896.13 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  21638. 896.13 s [algebraic-graphs] OK: box x empty ~~ empty
  21639. 896.13 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  21640. 896.13 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  21641. 896.13 s [algebraic-graphs]
  21642. 896.13 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  21643. 896.13 s [algebraic-graphs]
  21644. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  21645. 896.13 s [algebraic-graphs] OK: consistent empty == True
  21646. 896.13 s [algebraic-graphs] OK: consistent (vertex x) == True
  21647. 896.13 s [algebraic-graphs] OK: consistent (edge x y) == True
  21648. 896.13 s [algebraic-graphs] OK: consistent (edges x) == True
  21649. 896.13 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  21650. 896.13 s [algebraic-graphs] OK: consistent (swap x) == True
  21651. 896.13 s [algebraic-graphs] OK: consistent (circuit xs) == True
  21652. 896.13 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  21653. 896.13 s [algebraic-graphs]
  21654. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  21655. 896.13 s [algebraic-graphs] OK: detectParts empty == Right empty
  21656. 896.13 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  21657. 896.13 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  21658. 896.13 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  21659. 896.13 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  21660. 896.13 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  21661. 896.13 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  21662. 896.13 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  21663. 896.13 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  21664. 896.13 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  21665. 896.13 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  21666. 896.13 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  21667. 896.13 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  21668. 896.13 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  21669. 896.13 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  21670. 896.13 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  21671. 896.13 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  21672. 896.13 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  21673. 896.13 s [algebraic-graphs]
  21674. 896.13 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  21675. 896.13 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  21676. 896.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  21677. 896.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  21678. 896.13 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  21679. 896.13 s [algebraic-graphs]
  21680. 896.13 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21681. 896.13 s [algebraic-graphs] OK: show (matching []) == "matching []"
  21682. 896.13 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  21683. 896.13 s [algebraic-graphs]
  21684. 896.13 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  21685. 896.13 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  21686. 896.13 s [algebraic-graphs]
  21687. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  21688. 896.13 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  21689. 896.13 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  21690. 896.13 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  21691. 896.13 s [algebraic-graphs]
  21692. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  21693. 896.13 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  21694. 896.13 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  21695. 896.13 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  21696. 896.13 s [algebraic-graphs]
  21697. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  21698. 896.13 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  21699. 896.13 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  21700. 896.13 s [algebraic-graphs]
  21701. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  21702. 896.13 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  21703. 896.13 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  21704. 896.13 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  21705. 896.13 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  21706. 896.13 s [algebraic-graphs]
  21707. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  21708. 896.13 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  21709. 896.13 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  21710. 896.13 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  21711. 896.13 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  21712. 896.13 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  21713. 896.13 s [algebraic-graphs]
  21714. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  21715. 896.13 s [algebraic-graphs] OK: maxMatching empty == matching []
  21716. 896.13 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  21717. 896.13 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  21718. 896.13 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  21719. 896.13 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  21720. 896.13 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21721. 896.13 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  21722. 896.13 s [algebraic-graphs]
  21723. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  21724. 896.13 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  21725. 896.13 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21726. 896.13 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  21727. 896.13 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  21728. 896.13 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  21729. 896.13 s [algebraic-graphs]
  21730. 896.13 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  21731. 896.13 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  21732. 898.14 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  21733. 898.14 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  21734. 898.14 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  21735. 898.14 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  21736. 898.14 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  21737. 898.14 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  21738. 898.14 s [algebraic-graphs]
  21739. 898.14 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  21740. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  21741. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  21742. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  21743. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  21744. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  21745. 898.14 s [algebraic-graphs]
  21746. 898.14 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  21747. 898.14 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  21748. 898.14 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  21749. 898.14 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  21750. 898.14 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  21751. 898.14 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  21752. 898.14 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  21753. 898.14 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  21754. 898.14 s [algebraic-graphs]
  21755. 898.14 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  21756. 898.14 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  21757. 898.14 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  21758. 898.14 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  21759. 898.14 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  21760. 898.14 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  21761. 898.14 s [algebraic-graphs]
  21762. 898.14 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  21763. 898.14 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  21764. 898.14 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  21765. 898.14 s [algebraic-graphs]
  21766. 898.14 s [algebraic-graphs] ============ Export.Eq ============
  21767. 898.14 s [algebraic-graphs] OK: mempty /= literal ""
  21768. 898.14 s [algebraic-graphs]
  21769. 898.14 s [algebraic-graphs] ============ Export.Ord ============
  21770. 898.14 s [algebraic-graphs] OK: mempty < literal ""
  21771. 898.14 s [algebraic-graphs]
  21772. 898.14 s [algebraic-graphs] ============ Export.isEmpty ============
  21773. 898.14 s [algebraic-graphs] OK: isEmpty mempty == True
  21774. 898.14 s [algebraic-graphs] OK: isEmpty (literal "") == False
  21775. 898.14 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  21776. 898.14 s [algebraic-graphs]
  21777. 898.14 s [algebraic-graphs] ============ Export.literal ============
  21778. 898.14 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  21779. 898.14 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  21780. 898.14 s [algebraic-graphs] OK: render . literal == id
  21781. 898.14 s [algebraic-graphs]
  21782. 898.14 s [algebraic-graphs] ============ Export.render ============
  21783. 898.14 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  21784. 898.14 s [algebraic-graphs] OK: render mempty == mempty
  21785. 898.14 s [algebraic-graphs]
  21786. 898.14 s [algebraic-graphs] ============ Export.<+> ============
  21787. 898.14 s [algebraic-graphs] OK: x <+> mempty == x
  21788. 898.14 s [algebraic-graphs] OK: mempty <+> x == x
  21789. 898.14 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  21790. 898.14 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  21791. 898.14 s [algebraic-graphs]
  21792. 898.14 s [algebraic-graphs] ============ Export.brackets ============
  21793. 898.14 s [algebraic-graphs] OK: brackets "i" == "[i]"
  21794. 898.14 s [algebraic-graphs] OK: brackets mempty == "[]"
  21795. 898.14 s [algebraic-graphs]
  21796. 898.14 s [algebraic-graphs] ============ Export.doubleQuotes ============
  21797. 898.14 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  21798. 898.14 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  21799. 898.14 s [algebraic-graphs]
  21800. 898.14 s [algebraic-graphs] ============ Export.indent ============
  21801. 898.14 s [algebraic-graphs] OK: indent 0 == id
  21802. 898.14 s [algebraic-graphs] OK: indent 1 mempty == " "
  21803. 898.14 s [algebraic-graphs]
  21804. 898.14 s [algebraic-graphs] ============ Export.unlines ============
  21805. 898.14 s [algebraic-graphs] OK: unlines [] == mempty
  21806. 898.14 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  21807. 898.14 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  21808. 898.14 s [algebraic-graphs]
  21809. 898.14 s [algebraic-graphs] ============ Export.export ============
  21810. 898.14 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  21811. 898.14 s [algebraic-graphs]
  21812. 898.14 s [algebraic-graphs] ============ Export.Dot.export ============
  21813. 898.14 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21814. 898.14 s [algebraic-graphs]
  21815. 898.14 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  21816. 898.14 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  21817. 898.14 s [algebraic-graphs]
  21818. 898.14 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  21819. 898.14 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  21820. 898.14 s [algebraic-graphs]
  21821. 898.14 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  21822. 898.14 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  21823. 898.14 s [algebraic-graphs]
  21824. 898.15 s [algebraic-graphs] ============ Graph ============
  21825. 898.15 s [algebraic-graphs] OK: Axioms of graphs
  21826. 898.15 s [algebraic-graphs] OK: Theorems of graphs
  21827. 898.15 s [algebraic-graphs]
  21828. 898.15 s [algebraic-graphs] ============ Graph.Ord ============
  21829. 898.15 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21830. 898.15 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21831. 898.15 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21832. 898.15 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21833. 898.15 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21834. 898.15 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  21835. 898.15 s [algebraic-graphs] OK: x <= x + y
  21836. 898.15 s [algebraic-graphs] OK: x + y <= x * y
  21837. 898.15 s [algebraic-graphs]
  21838. 898.15 s [algebraic-graphs] ============ Graph.empty ============
  21839. 898.15 s [algebraic-graphs] OK: isEmpty empty == True
  21840. 898.15 s [algebraic-graphs] OK: hasVertex x empty == False
  21841. 898.15 s [algebraic-graphs] OK: vertexCount empty == 0
  21842. 898.15 s [algebraic-graphs] OK: edgeCount empty == 0
  21843. 898.15 s [algebraic-graphs]
  21844. 898.15 s [algebraic-graphs] ============ Graph.vertex ============
  21845. 898.15 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21846. 898.15 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21847. 898.15 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21848. 898.15 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21849. 898.15 s [algebraic-graphs]
  21850. 898.15 s [algebraic-graphs] ============ Graph.edge ============
  21851. 898.15 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21852. 898.15 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21853. 898.15 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21854. 898.15 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21855. 898.15 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21856. 898.15 s [algebraic-graphs]
  21857. 898.15 s [algebraic-graphs] ============ Graph.overlay ============
  21858. 898.15 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21859. 898.15 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21860. 898.15 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21861. 898.15 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21862. 898.15 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21863. 898.15 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21864. 898.15 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21865. 898.15 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21866. 898.15 s [algebraic-graphs]
  21867. 898.15 s [algebraic-graphs] ============ Graph.connect ============
  21868. 898.15 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21869. 898.15 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21870. 898.15 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21871. 898.15 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21872. 898.15 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21873. 898.15 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21874. 898.15 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  21875. 898.15 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21876. 898.15 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21877. 898.15 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21878. 898.15 s [algebraic-graphs]
  21879. 898.15 s [algebraic-graphs] ============ Graph.vertices ============
  21880. 898.15 s [algebraic-graphs] OK: vertices [] == empty
  21881. 898.15 s [algebraic-graphs] OK: vertices [x] == vertex x
  21882. 898.15 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21883. 898.15 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21884. 898.15 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21885. 898.15 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21886. 898.15 s [algebraic-graphs]
  21887. 898.15 s [algebraic-graphs] ============ Graph.edges ============
  21888. 898.15 s [algebraic-graphs] OK: edges [] == empty
  21889. 898.15 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21890. 898.15 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  21891. 898.15 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  21892. 898.15 s [algebraic-graphs]
  21893. 898.15 s [algebraic-graphs] ============ Graph.overlays ============
  21894. 898.15 s [algebraic-graphs] OK: overlays [] == empty
  21895. 898.15 s [algebraic-graphs] OK: overlays [x] == x
  21896. 898.15 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21897. 898.15 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21898. 898.15 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21899. 898.15 s [algebraic-graphs]
  21900. 898.15 s [algebraic-graphs] ============ Graph.connects ============
  21901. 898.15 s [algebraic-graphs] OK: connects [] == empty
  21902. 898.15 s [algebraic-graphs] OK: connects [x] == x
  21903. 898.15 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21904. 898.15 s [algebraic-graphs] OK: connects == foldr connect empty
  21905. 898.15 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21906. 898.15 s [algebraic-graphs]
  21907. 898.15 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  21908. 898.15 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21909. 898.15 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21910. 898.15 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21911. 898.15 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21912. 898.15 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21913. 898.15 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21914. 898.15 s [algebraic-graphs]
  21915. 898.15 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  21916. 898.15 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  21917. 898.15 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  21918. 898.15 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  21919. 898.15 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  21920. 898.15 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  21921. 898.15 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  21922. 898.15 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  21923. 898.15 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  21924. 898.15 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  21925. 898.78 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  21926. 898.78 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  21927. 898.78 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  21928. 898.78 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  21929. 898.78 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  21930. 898.78 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  21931. 898.78 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  21932. 898.78 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  21933. 898.78 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  21934. 898.78 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  21935. 898.78 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  21936. 898.78 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  21937. 898.78 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  21938. 898.78 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  21939. 898.78 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  21940. 898.78 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  21941. 898.78 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  21942. 898.78 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  21943. 898.78 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  21944. 898.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21945. 898.78 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  21946. 898.78 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  21947. 898.78 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  21948. 898.78 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  21949. 898.78 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21950. 898.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21951. 898.78 s [algebraic-graphs]
  21952. 898.78 s [algebraic-graphs] ============ Graph.foldg ============
  21953. 898.78 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  21954. 898.78 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  21955. 898.78 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  21956. 898.78 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  21957. 898.78 s [algebraic-graphs]
  21958. 898.78 s [algebraic-graphs] ============ Graph.isEmpty ============
  21959. 898.78 s [algebraic-graphs] OK: isEmpty empty == True
  21960. 898.78 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21961. 898.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21962. 898.78 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21963. 898.78 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21964. 898.78 s [algebraic-graphs]
  21965. 898.78 s [algebraic-graphs] ============ Graph.hasVertex ============
  21966. 898.78 s [algebraic-graphs] OK: hasVertex x empty == False
  21967. 898.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21968. 898.78 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21969. 898.78 s [algebraic-graphs]
  21970. 898.78 s [algebraic-graphs] ============ Graph.hasEdge ============
  21971. 898.78 s [algebraic-graphs] OK: hasEdge x y empty == False
  21972. 898.78 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21973. 898.78 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21974. 898.78 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21975. 898.78 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  21976. 898.78 s [algebraic-graphs]
  21977. 898.78 s [algebraic-graphs] ============ Graph.vertexCount ============
  21978. 898.78 s [algebraic-graphs] OK: vertexCount empty == 0
  21979. 898.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21980. 898.78 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21981. 898.78 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21982. 898.78 s [algebraic-graphs]
  21983. 898.78 s [algebraic-graphs] ============ Graph.edgeCount ============
  21984. 898.78 s [algebraic-graphs] OK: edgeCount empty == 0
  21985. 898.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21986. 898.78 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21987. 898.78 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21988. 898.78 s [algebraic-graphs]
  21989. 898.78 s [algebraic-graphs] ============ Graph.vertexList ============
  21990. 898.78 s [algebraic-graphs] OK: vertexList empty == []
  21991. 898.78 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21992. 898.78 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21993. 898.78 s [algebraic-graphs]
  21994. 898.78 s [algebraic-graphs] ============ Graph.vertexSet ============
  21995. 898.78 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21996. 898.78 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21997. 898.78 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21998. 898.78 s [algebraic-graphs]
  21999. 898.78 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  22000. 898.78 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  22001. 898.78 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  22002. 898.78 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  22003. 898.78 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  22004. 898.78 s [algebraic-graphs]
  22005. 898.78 s [algebraic-graphs] ============ Graph.edgeList ============
  22006. 898.78 s [algebraic-graphs] OK: edgeList empty == []
  22007. 898.78 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22008. 898.78 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22009. 898.78 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22010. 898.78 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  22011. 898.78 s [algebraic-graphs]
  22012. 898.78 s [algebraic-graphs] ============ Graph.edgeSet ============
  22013. 898.78 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22014. 898.78 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22015. 898.78 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22016. 898.78 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  22017. 898.78 s [algebraic-graphs]
  22018. 898.78 s [algebraic-graphs] ============ Graph.adjacencyList ============
  22019. 898.78 s [algebraic-graphs] OK: adjacencyList empty == []
  22020. 898.78 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  22021. 898.78 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  22022. 898.78 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  22023. 898.78 s [algebraic-graphs]
  22024. 898.78 s [algebraic-graphs] ============ Graph.preSet ============
  22025. 898.78 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22026. 898.78 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22027. 898.78 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22028. 898.78 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22029. 898.78 s [algebraic-graphs]
  22030. 898.78 s [algebraic-graphs] ============ Graph.preIntSet ============
  22031. 898.78 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  22032. 898.78 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  22033. 898.78 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  22034. 898.78 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  22035. 898.78 s [algebraic-graphs]
  22036. 898.78 s [algebraic-graphs] ============ Graph.postSet ============
  22037. 898.78 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22038. 898.78 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22039. 898.78 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22040. 898.78 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22041. 898.78 s [algebraic-graphs]
  22042. 898.78 s [algebraic-graphs] ============ Graph.postIntSet ============
  22043. 898.79 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  22044. 898.79 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  22045. 898.79 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  22046. 898.79 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  22047. 898.79 s [algebraic-graphs]
  22048. 898.79 s [algebraic-graphs] ============ Graph.size ============
  22049. 898.79 s [algebraic-graphs] OK: size empty == 1
  22050. 898.79 s [algebraic-graphs] OK: size (vertex x) == 1
  22051. 898.79 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22052. 898.79 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22053. 898.79 s [algebraic-graphs] OK: size x >= 1
  22054. 898.79 s [algebraic-graphs] OK: size x >= vertexCount x
  22055. 898.79 s [algebraic-graphs]
  22056. 898.79 s [algebraic-graphs] ============ Graph.path ============
  22057. 898.79 s [algebraic-graphs] OK: path [] == empty
  22058. 898.79 s [algebraic-graphs] OK: path [x] == vertex x
  22059. 898.79 s [algebraic-graphs] OK: path [x,y] == edge x y
  22060. 898.79 s [algebraic-graphs]
  22061. 898.79 s [algebraic-graphs] ============ Graph.circuit ============
  22062. 898.79 s [algebraic-graphs] OK: circuit [] == empty
  22063. 898.79 s [algebraic-graphs] OK: circuit [x] == edge x x
  22064. 898.79 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  22065. 898.79 s [algebraic-graphs]
  22066. 898.79 s [algebraic-graphs] ============ Graph.clique ============
  22067. 898.79 s [algebraic-graphs] OK: clique [] == empty
  22068. 898.79 s [algebraic-graphs] OK: clique [x] == vertex x
  22069. 898.79 s [algebraic-graphs] OK: clique [x,y] == edge x y
  22070. 898.79 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  22071. 898.79 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  22072. 898.79 s [algebraic-graphs]
  22073. 898.79 s [algebraic-graphs] ============ Graph.biclique ============
  22074. 898.79 s [algebraic-graphs] OK: biclique [] [] == empty
  22075. 898.79 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  22076. 898.79 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  22077. 898.79 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22078. 898.79 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  22079. 898.79 s [algebraic-graphs]
  22080. 898.79 s [algebraic-graphs] ============ Graph.star ============
  22081. 898.79 s [algebraic-graphs] OK: star x [] == vertex x
  22082. 898.79 s [algebraic-graphs] OK: star x [y] == edge x y
  22083. 898.79 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  22084. 898.79 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  22085. 898.79 s [algebraic-graphs]
  22086. 898.79 s [algebraic-graphs] ============ Graph.stars ============
  22087. 898.79 s [algebraic-graphs] OK: stars [] == empty
  22088. 898.79 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  22089. 898.79 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  22090. 898.79 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  22091. 898.79 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  22092. 898.79 s [algebraic-graphs] OK: stars . adjacencyList == id
  22093. 898.79 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  22094. 898.79 s [algebraic-graphs]
  22095. 898.79 s [algebraic-graphs] ============ Graph.tree ============
  22096. 898.79 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22097. 898.79 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  22098. 898.79 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22099. 898.79 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  22100. 898.79 s [algebraic-graphs]
  22101. 898.79 s [algebraic-graphs] ============ Graph.forest ============
  22102. 898.79 s [algebraic-graphs] OK: forest [] == empty
  22103. 898.79 s [algebraic-graphs] OK: forest [x] == tree x
  22104. 898.79 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  22105. 898.79 s [algebraic-graphs] OK: forest == overlays . map tree
  22106. 898.79 s [algebraic-graphs]
  22107. 898.79 s [algebraic-graphs] ============ Graph.removeVertex ============
  22108. 901.98 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22109. 901.98 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22110. 901.98 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  22111. 902.47 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  22112. 902.47 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22113. 902.47 s [algebraic-graphs]
  22114. 902.47 s [algebraic-graphs] ============ Graph.removeEdge ============
  22115. 902.47 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  22116. 902.47 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22117. 902.47 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22118. 902.47 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22119. 902.47 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22120. 902.47 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  22121. 902.47 s [algebraic-graphs]
  22122. 902.47 s [algebraic-graphs] ============ Graph.replaceVertex ============
  22123. 902.47 s [algebraic-graphs] OK: replaceVertex x x == id
  22124. 902.47 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22125. 902.47 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  22126. 902.47 s [algebraic-graphs]
  22127. 902.47 s [algebraic-graphs] ============ Graph.mergeVertices ============
  22128. 902.47 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  22129. 902.47 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  22130. 902.47 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  22131. 902.47 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  22132. 902.47 s [algebraic-graphs]
  22133. 902.47 s [algebraic-graphs] ============ Graph.transpose ============
  22134. 902.47 s [algebraic-graphs] OK: transpose empty == empty
  22135. 902.47 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22136. 902.47 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  22137. 902.47 s [algebraic-graphs] OK: transpose . transpose == id
  22138. 902.47 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22139. 902.47 s [algebraic-graphs]
  22140. 902.47 s [algebraic-graphs] ============ Graph.gmap ============
  22141. 902.47 s [algebraic-graphs] OK: gmap f empty == empty
  22142. 902.47 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22143. 902.47 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  22144. 902.47 s [algebraic-graphs] OK: gmap id == id
  22145. 902.47 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22146. 902.47 s [algebraic-graphs]
  22147. 902.47 s [algebraic-graphs] ============ Graph.induce ============
  22148. 902.47 s [algebraic-graphs] OK: induce (const True ) x == x
  22149. 902.47 s [algebraic-graphs] OK: induce (const False) x == empty
  22150. 902.47 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22151. 902.47 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22152. 902.47 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22153. 902.47 s [algebraic-graphs]
  22154. 902.47 s [algebraic-graphs] ============ Graph.induceJust ============
  22155. 902.47 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22156. 902.47 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22157. 902.47 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22158. 902.47 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22159. 902.47 s [algebraic-graphs]
  22160. 902.47 s [algebraic-graphs] ============ Graph.compose ============
  22161. 902.47 s [algebraic-graphs] OK: compose empty x == empty
  22162. 902.47 s [algebraic-graphs] OK: compose x empty == empty
  22163. 902.47 s [algebraic-graphs] OK: compose (vertex x) y == empty
  22164. 902.47 s [algebraic-graphs] OK: compose x (vertex y) == empty
  22165. 902.47 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  22166. 902.47 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  22167. 902.47 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  22168. 902.47 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  22169. 902.47 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  22170. 902.47 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  22171. 902.47 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  22172. 902.47 s [algebraic-graphs]
  22173. 902.47 s [algebraic-graphs] ============ Graph.(===) ============
  22174. 902.47 s [algebraic-graphs] OK: x === x == True
  22175. 902.47 s [algebraic-graphs] OK: x === x + empty == False
  22176. 902.47 s [algebraic-graphs] OK: x + y === x + y == True
  22177. 902.47 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  22178. 902.47 s [algebraic-graphs] OK: x + y === x * y == False
  22179. 902.47 s [algebraic-graphs]
  22180. 902.47 s [algebraic-graphs] ============ Graph.mesh ============
  22181. 902.47 s [algebraic-graphs] OK: mesh xs [] == empty
  22182. 902.47 s [algebraic-graphs] OK: mesh [] ys == empty
  22183. 902.47 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  22184. 902.47 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  22185. 902.47 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  22186. 902.47 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  22187. 902.47 s [algebraic-graphs]
  22188. 902.47 s [algebraic-graphs] ============ Graph.torus ============
  22189. 902.47 s [algebraic-graphs] OK: torus xs [] == empty
  22190. 902.47 s [algebraic-graphs] OK: torus [] ys == empty
  22191. 902.47 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  22192. 902.47 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  22193. 902.47 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  22194. 902.47 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  22195. 902.47 s [algebraic-graphs]
  22196. 902.47 s [algebraic-graphs] ============ Graph.deBruijn ============
  22197. 902.47 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  22198. 902.47 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  22199. 902.47 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  22200. 902.47 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  22201. 902.47 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  22202. 902.47 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  22203. 902.47 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  22204. 902.47 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  22205. 902.47 s [algebraic-graphs]
  22206. 902.47 s [algebraic-graphs] ============ Graph.splitVertex ============
  22207. 902.47 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  22208. 902.47 s [algebraic-graphs] OK: splitVertex x [x] == id
  22209. 902.47 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  22210. 902.47 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  22211. 902.47 s [algebraic-graphs]
  22212. 902.47 s [algebraic-graphs] ============ Graph.bind ============
  22213. 902.47 s [algebraic-graphs] OK: bind empty f == empty
  22214. 902.47 s [algebraic-graphs] OK: bind (vertex x) f == f x
  22215. 902.47 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  22216. 902.47 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  22217. 902.47 s [algebraic-graphs] OK: bind x (const empty) == empty
  22218. 902.47 s [algebraic-graphs] OK: bind x vertex == x
  22219. 902.47 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  22220. 902.47 s [algebraic-graphs]
  22221. 902.47 s [algebraic-graphs] ============ Graph.simplify ============
  22222. 902.47 s [algebraic-graphs] OK: simplify == id
  22223. 902.47 s [algebraic-graphs] OK: size (simplify x) <= size x
  22224. 902.47 s [algebraic-graphs]
  22225. 902.47 s [algebraic-graphs] ============ Graph.box ============
  22226. 902.47 s [algebraic-graphs] OK: box x y ~~ box y x
  22227. 902.47 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  22228. 902.47 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  22229. 902.47 s [algebraic-graphs] OK: box x empty ~~ empty
  22230. 902.47 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  22231. 902.47 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  22232. 902.47 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  22233. 902.47 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  22234. 902.47 s [algebraic-graphs]
  22235. 902.47 s [algebraic-graphs] ============ Graph.sparsify ============
  22236. 902.47 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  22237. 902.47 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  22238. 902.47 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  22239. 902.47 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  22240. 902.47 s [algebraic-graphs]
  22241. 902.47 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  22242. 902.47 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  22243. 902.47 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  22244. 902.47 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  22245. 902.47 s [algebraic-graphs]
  22246. 902.47 s [algebraic-graphs] ============ Graph.context ============
  22247. 902.47 s [algebraic-graphs] OK: context (const False) x == Nothing
  22248. 902.47 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  22249. 902.47 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  22250. 902.47 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  22251. 902.47 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  22252. 902.47 s [algebraic-graphs]
  22253. 902.47 s [algebraic-graphs] ============ Graph.buildg ============
  22254. 902.47 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  22255. 902.47 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  22256. 902.47 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
  22257. 902.47 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
  22258. 902.47 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  22259. 902.47 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  22260. 902.47 s [algebraic-graphs]
  22261. 902.47 s [algebraic-graphs] ============ Internal.List ============
  22262. 902.47 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  22263. 902.47 s [algebraic-graphs]
  22264. 902.47 s [algebraic-graphs] ============ Graph.Label ============
  22265. 902.47 s [algebraic-graphs]
  22266. 902.47 s [algebraic-graphs] ============ Any: instances ============
  22267. 902.47 s [algebraic-graphs] OK: Semiring
  22268. 902.47 s [algebraic-graphs] OK: StarSemiring
  22269. 902.47 s [algebraic-graphs] OK: Dioid
  22270. 902.47 s [algebraic-graphs]
  22271. 902.47 s [algebraic-graphs] ============ Distance Int: instances ============
  22272. 902.47 s [algebraic-graphs] OK: Semiring
  22273. 902.47 s [algebraic-graphs] OK: StarSemiring
  22274. 902.47 s [algebraic-graphs] OK: Dioid
  22275. 902.47 s [algebraic-graphs]
  22276. 902.47 s [algebraic-graphs] ============ Capacity Int: instances ============
  22277. 902.47 s [algebraic-graphs] OK: Semiring
  22278. 902.47 s [algebraic-graphs] OK: StarSemiring
  22279. 902.47 s [algebraic-graphs] OK: Dioid
  22280. 902.47 s [algebraic-graphs]
  22281. 902.47 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  22282. 902.47 s [algebraic-graphs] OK: LeftNearRing
  22283. 902.47 s [algebraic-graphs]
  22284. 902.47 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  22285. 902.47 s [algebraic-graphs] OK: Semiring
  22286. 902.47 s [algebraic-graphs] OK: Dioid
  22287. 902.47 s [algebraic-graphs]
  22288. 902.47 s [algebraic-graphs] ============ Count Int: instances ============
  22289. 902.47 s [algebraic-graphs] OK: Semiring
  22290. 902.47 s [algebraic-graphs] OK: StarSemiring
  22291. 902.47 s [algebraic-graphs]
  22292. 902.47 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  22293. 902.47 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  22294. 902.47 s [algebraic-graphs] OK: empty
  22295. 902.47 s [algebraic-graphs] OK: vertex
  22296. 902.47 s [algebraic-graphs] OK: edge
  22297. 902.47 s [algebraic-graphs] OK: overlay
  22298. 902.47 s [algebraic-graphs] OK: connect
  22299. 902.47 s [algebraic-graphs] OK: vertices
  22300. 902.47 s [algebraic-graphs] OK: edges
  22301. 902.47 s [algebraic-graphs] OK: overlays
  22302. 902.47 s [algebraic-graphs] OK: fromAdjacencyMaps
  22303. 902.47 s [algebraic-graphs] OK: removeVertex
  22304. 902.47 s [algebraic-graphs] OK: removeEdge
  22305. 902.47 s [algebraic-graphs] OK: replaceVertex
  22306. 902.47 s [algebraic-graphs] OK: replaceEdge
  22307. 902.47 s [algebraic-graphs] OK: transpose
  22308. 902.47 s [algebraic-graphs] OK: gmap
  22309. 902.47 s [algebraic-graphs] OK: emap
  22310. 902.47 s [algebraic-graphs] OK: induce
  22311. 902.47 s [algebraic-graphs] OK: closure
  22312. 902.47 s [algebraic-graphs] OK: reflexiveClosure
  22313. 902.47 s [algebraic-graphs] OK: symmetricClosure
  22314. 902.47 s [algebraic-graphs] OK: transitiveClosure
  22315. 902.47 s [algebraic-graphs]
  22316. 902.47 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  22317. 902.47 s [algebraic-graphs] OK: isEmpty empty == True
  22318. 902.47 s [algebraic-graphs] OK: hasVertex x empty == False
  22319. 902.47 s [algebraic-graphs] OK: vertexCount empty == 0
  22320. 902.47 s [algebraic-graphs] OK: edgeCount empty == 0
  22321. 902.47 s [algebraic-graphs]
  22322. 902.47 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  22323. 902.47 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22324. 902.47 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22325. 902.47 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22326. 902.47 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22327. 902.47 s [algebraic-graphs]
  22328. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  22329. 904.26 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22330. 904.26 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22331. 904.26 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22332. 904.26 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22333. 904.26 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22334. 904.26 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22335. 904.26 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22336. 904.26 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22337. 904.26 s [algebraic-graphs]
  22338. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  22339. 904.26 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22340. 904.26 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22341. 904.26 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22342. 904.26 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22343. 904.26 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22344. 904.26 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22345. 904.26 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22346. 904.26 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22347. 904.26 s [algebraic-graphs]
  22348. 904.26 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22349. 904.26 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22350. 904.26 s [algebraic-graphs]
  22351. 904.26 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22352. 904.26 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22353. 904.26 s [algebraic-graphs]
  22354. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  22355. 904.26 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22356. 904.26 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22357. 904.26 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22358. 904.26 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22359. 904.26 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22360. 904.26 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22361. 904.26 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22362. 904.26 s [algebraic-graphs]
  22363. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  22364. 904.26 s [algebraic-graphs] OK: vertices [] == empty
  22365. 904.26 s [algebraic-graphs] OK: vertices [x] == vertex x
  22366. 904.26 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22367. 904.26 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22368. 904.26 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22369. 904.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22370. 904.26 s [algebraic-graphs]
  22371. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  22372. 904.26 s [algebraic-graphs] OK: edges [] == empty
  22373. 904.26 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22374. 904.26 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22375. 904.26 s [algebraic-graphs]
  22376. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  22377. 904.26 s [algebraic-graphs] OK: overlays [] == empty
  22378. 904.26 s [algebraic-graphs] OK: overlays [x] == x
  22379. 904.26 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22380. 904.26 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22381. 904.26 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22382. 904.26 s [algebraic-graphs]
  22383. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  22384. 904.26 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  22385. 904.26 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  22386. 904.26 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  22387. 904.26 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  22388. 904.26 s [algebraic-graphs]
  22389. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  22390. 904.26 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22391. 904.26 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22392. 904.26 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22393. 904.26 s [algebraic-graphs]
  22394. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  22395. 904.26 s [algebraic-graphs] OK: isEmpty empty == True
  22396. 904.26 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22397. 904.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22398. 904.26 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22399. 904.26 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22400. 904.26 s [algebraic-graphs]
  22401. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  22402. 904.26 s [algebraic-graphs] OK: hasVertex x empty == False
  22403. 904.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22404. 904.26 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22405. 904.26 s [algebraic-graphs]
  22406. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  22407. 904.26 s [algebraic-graphs] OK: hasEdge x y empty == False
  22408. 904.26 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22409. 904.26 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22410. 904.26 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22411. 904.26 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22412. 904.26 s [algebraic-graphs]
  22413. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  22414. 904.26 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22415. 904.26 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22416. 904.26 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22417. 904.26 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22418. 904.26 s [algebraic-graphs]
  22419. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  22420. 904.26 s [algebraic-graphs] OK: vertexCount empty == 0
  22421. 904.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22422. 904.26 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22423. 904.26 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22424. 904.26 s [algebraic-graphs]
  22425. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  22426. 904.26 s [algebraic-graphs] OK: edgeCount empty == 0
  22427. 904.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22428. 904.26 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22429. 904.26 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22430. 904.26 s [algebraic-graphs]
  22431. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  22432. 904.26 s [algebraic-graphs] OK: vertexList empty == []
  22433. 904.26 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22434. 904.26 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22435. 904.26 s [algebraic-graphs]
  22436. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  22437. 904.26 s [algebraic-graphs] OK: edgeList empty == []
  22438. 904.26 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22439. 904.26 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22440. 904.26 s [algebraic-graphs]
  22441. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  22442. 904.26 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22443. 904.26 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22444. 904.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22445. 904.26 s [algebraic-graphs]
  22446. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  22447. 904.26 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22448. 904.26 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22449. 904.26 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22450. 904.26 s [algebraic-graphs]
  22451. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  22452. 904.26 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22453. 904.26 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22454. 904.26 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22455. 904.26 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22456. 904.26 s [algebraic-graphs]
  22457. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  22458. 904.26 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22459. 904.26 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22460. 904.26 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22461. 904.26 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22462. 904.26 s [algebraic-graphs]
  22463. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  22464. 904.26 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  22465. 904.26 s [algebraic-graphs]
  22466. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  22467. 904.26 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22468. 904.26 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22469. 904.26 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22470. 904.26 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22471. 904.26 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22472. 904.26 s [algebraic-graphs]
  22473. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  22474. 904.26 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22475. 904.26 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22476. 904.26 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22477. 904.26 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22478. 904.26 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22479. 904.26 s [algebraic-graphs]
  22480. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  22481. 904.26 s [algebraic-graphs] OK: replaceVertex x x == id
  22482. 904.26 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22483. 904.26 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  22484. 904.26 s [algebraic-graphs]
  22485. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  22486. 904.26 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22487. 904.26 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22488. 904.26 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22489. 904.26 s [algebraic-graphs]
  22490. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  22491. 904.26 s [algebraic-graphs] OK: transpose empty == empty
  22492. 904.26 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22493. 904.26 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22494. 904.26 s [algebraic-graphs] OK: transpose . transpose == id
  22495. 904.26 s [algebraic-graphs]
  22496. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  22497. 904.26 s [algebraic-graphs] OK: gmap f empty == empty
  22498. 904.26 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  22499. 904.26 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  22500. 904.26 s [algebraic-graphs] OK: gmap id == id
  22501. 904.26 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  22502. 904.26 s [algebraic-graphs]
  22503. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  22504. 904.26 s [algebraic-graphs] OK: emap h empty == empty
  22505. 904.26 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22506. 904.26 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22507. 904.26 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22508. 904.26 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22509. 904.26 s [algebraic-graphs] OK: emap id == id
  22510. 904.26 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22511. 904.26 s [algebraic-graphs]
  22512. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  22513. 904.26 s [algebraic-graphs] OK: induce (const True ) x == x
  22514. 904.26 s [algebraic-graphs] OK: induce (const False) x == empty
  22515. 904.26 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22516. 904.26 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22517. 904.26 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22518. 904.26 s [algebraic-graphs]
  22519. 904.26 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  22520. 905.38 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22521. 905.38 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22522. 905.38 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22523. 905.38 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22524. 905.38 s [algebraic-graphs]
  22525. 905.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  22526. 905.38 s [algebraic-graphs] OK: closure empty == empty
  22527. 905.38 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22528. 905.38 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22529. 905.38 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22530. 905.38 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22531. 905.38 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22532. 905.38 s [algebraic-graphs] OK: closure . closure == closure
  22533. 905.38 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22534. 905.38 s [algebraic-graphs]
  22535. 905.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  22536. 905.38 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22537. 905.38 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22538. 905.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22539. 905.38 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22540. 905.38 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22541. 905.38 s [algebraic-graphs]
  22542. 905.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  22543. 905.38 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22544. 905.38 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22545. 905.38 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22546. 905.38 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22547. 905.38 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22548. 905.38 s [algebraic-graphs]
  22549. 905.38 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  22550. 905.38 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22551. 905.38 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22552. 905.38 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22553. 905.38 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22554. 905.38 s [algebraic-graphs]
  22555. 905.38 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  22556. 905.38 s [algebraic-graphs] OK: isEmpty empty == True
  22557. 905.38 s [algebraic-graphs] OK: hasVertex x empty == False
  22558. 905.38 s [algebraic-graphs] OK: vertexCount empty == 0
  22559. 905.38 s [algebraic-graphs] OK: edgeCount empty == 0
  22560. 905.38 s [algebraic-graphs]
  22561. 905.38 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  22562. 905.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22563. 905.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22564. 905.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22565. 905.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22566. 905.38 s [algebraic-graphs]
  22567. 905.38 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  22568. 905.38 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  22569. 905.38 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  22570. 905.38 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  22571. 905.38 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22572. 905.38 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  22573. 905.38 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  22574. 905.38 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  22575. 905.38 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  22576. 905.38 s [algebraic-graphs]
  22577. 905.38 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  22578. 905.38 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  22579. 905.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22580. 905.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22581. 905.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22582. 905.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22583. 905.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22584. 905.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22585. 905.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22586. 905.38 s [algebraic-graphs]
  22587. 905.38 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  22588. 905.38 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  22589. 905.38 s [algebraic-graphs]
  22590. 905.38 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  22591. 905.38 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  22592. 905.38 s [algebraic-graphs]
  22593. 905.38 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  22594. 905.38 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  22595. 905.38 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  22596. 905.38 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  22597. 905.38 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  22598. 905.38 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22599. 905.38 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  22600. 905.38 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  22601. 905.38 s [algebraic-graphs]
  22602. 905.38 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  22603. 905.38 s [algebraic-graphs] OK: vertices [] == empty
  22604. 905.38 s [algebraic-graphs] OK: vertices [x] == vertex x
  22605. 905.38 s [algebraic-graphs] OK: vertices == overlays . map vertex
  22606. 905.38 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  22607. 905.38 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  22608. 905.38 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22609. 905.38 s [algebraic-graphs]
  22610. 905.38 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  22611. 905.38 s [algebraic-graphs] OK: edges [] == empty
  22612. 905.38 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  22613. 905.38 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  22614. 905.38 s [algebraic-graphs]
  22615. 905.38 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  22616. 905.38 s [algebraic-graphs] OK: overlays [] == empty
  22617. 905.38 s [algebraic-graphs] OK: overlays [x] == x
  22618. 905.38 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  22619. 905.38 s [algebraic-graphs] OK: overlays == foldr overlay empty
  22620. 905.38 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  22621. 905.38 s [algebraic-graphs]
  22622. 905.38 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  22623. 905.38 s [algebraic-graphs] OK: foldg empty vertex connect == id
  22624. 905.38 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  22625. 905.38 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  22626. 905.38 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  22627. 905.38 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  22628. 905.38 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  22629. 905.38 s [algebraic-graphs]
  22630. 905.38 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  22631. 905.38 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  22632. 905.38 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  22633. 905.38 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  22634. 905.38 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  22635. 905.38 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  22636. 905.38 s [algebraic-graphs]
  22637. 905.38 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  22638. 905.38 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  22639. 905.38 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  22640. 905.38 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22641. 905.38 s [algebraic-graphs]
  22642. 905.38 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  22643. 905.38 s [algebraic-graphs] OK: isEmpty empty == True
  22644. 905.38 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  22645. 905.38 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  22646. 905.38 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  22647. 905.38 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  22648. 905.38 s [algebraic-graphs]
  22649. 905.38 s [algebraic-graphs] ============ Labelled.Graph.size ============
  22650. 905.38 s [algebraic-graphs] OK: size empty == 1
  22651. 905.38 s [algebraic-graphs] OK: size (vertex x) == 1
  22652. 905.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  22653. 905.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  22654. 905.38 s [algebraic-graphs] OK: size x >= 1
  22655. 905.38 s [algebraic-graphs] OK: size x >= vertexCount x
  22656. 905.38 s [algebraic-graphs]
  22657. 905.38 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  22658. 905.38 s [algebraic-graphs] OK: hasVertex x empty == False
  22659. 905.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22660. 905.38 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  22661. 905.38 s [algebraic-graphs]
  22662. 905.38 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  22663. 905.38 s [algebraic-graphs] OK: hasEdge x y empty == False
  22664. 905.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22665. 905.38 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  22666. 905.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22667. 905.38 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  22668. 905.38 s [algebraic-graphs]
  22669. 905.38 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  22670. 905.38 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  22671. 905.38 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  22672. 905.38 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  22673. 905.38 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  22674. 905.38 s [algebraic-graphs]
  22675. 905.38 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  22676. 905.38 s [algebraic-graphs] OK: vertexCount empty == 0
  22677. 905.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22678. 905.38 s [algebraic-graphs] OK: vertexCount == length . vertexList
  22679. 905.38 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  22680. 905.38 s [algebraic-graphs]
  22681. 905.38 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  22682. 905.38 s [algebraic-graphs] OK: edgeCount empty == 0
  22683. 905.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22684. 905.38 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  22685. 905.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22686. 905.38 s [algebraic-graphs]
  22687. 905.38 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  22688. 905.38 s [algebraic-graphs] OK: vertexList empty == []
  22689. 905.38 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  22690. 905.38 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  22691. 905.38 s [algebraic-graphs]
  22692. 905.38 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  22693. 905.38 s [algebraic-graphs] OK: edgeList empty == []
  22694. 905.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22695. 905.38 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  22696. 905.38 s [algebraic-graphs]
  22697. 905.38 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  22698. 905.38 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  22699. 905.39 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22700. 905.39 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  22701. 905.39 s [algebraic-graphs]
  22702. 905.39 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  22703. 905.39 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  22704. 905.39 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22705. 905.39 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  22706. 905.39 s [algebraic-graphs]
  22707. 905.39 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  22708. 905.39 s [algebraic-graphs] OK: preSet x empty == Set.empty
  22709. 905.39 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22710. 907.94 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  22711. 908.09 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  22712. 908.09 s [algebraic-graphs]
  22713. 908.09 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  22714. 908.09 s [algebraic-graphs] OK: postSet x empty == Set.empty
  22715. 908.09 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22716. 908.09 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  22717. 908.09 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  22718. 908.09 s [algebraic-graphs]
  22719. 908.09 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  22720. 908.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  22721. 908.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  22722. 908.09 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  22723. 908.09 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  22724. 908.09 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  22725. 908.09 s [algebraic-graphs]
  22726. 908.09 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  22727. 908.09 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  22728. 908.09 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  22729. 908.09 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  22730. 908.09 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  22731. 908.09 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  22732. 908.09 s [algebraic-graphs]
  22733. 908.09 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  22734. 908.09 s [algebraic-graphs] OK: replaceVertex x x == id
  22735. 908.09 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  22736. 908.09 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  22737. 908.09 s [algebraic-graphs]
  22738. 908.09 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  22739. 908.09 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  22740. 908.09 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  22741. 908.09 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  22742. 908.09 s [algebraic-graphs]
  22743. 908.09 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  22744. 908.09 s [algebraic-graphs] OK: transpose empty == empty
  22745. 908.09 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  22746. 908.09 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  22747. 908.09 s [algebraic-graphs] OK: transpose . transpose == id
  22748. 908.09 s [algebraic-graphs]
  22749. 908.09 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  22750. 908.09 s [algebraic-graphs] OK: fmap f empty == empty
  22751. 908.09 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  22752. 908.09 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  22753. 908.09 s [algebraic-graphs] OK: fmap id == id
  22754. 908.09 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  22755. 908.09 s [algebraic-graphs]
  22756. 908.09 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  22757. 908.09 s [algebraic-graphs] OK: emap h empty == empty
  22758. 908.09 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  22759. 908.09 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  22760. 908.09 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  22761. 908.09 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  22762. 908.09 s [algebraic-graphs] OK: emap id == id
  22763. 908.09 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  22764. 908.09 s [algebraic-graphs]
  22765. 908.09 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  22766. 908.09 s [algebraic-graphs] OK: induce (const True ) x == x
  22767. 908.09 s [algebraic-graphs] OK: induce (const False) x == empty
  22768. 908.09 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  22769. 908.09 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  22770. 908.09 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  22771. 908.09 s [algebraic-graphs]
  22772. 908.09 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  22773. 908.09 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  22774. 908.09 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  22775. 908.09 s [algebraic-graphs] OK: induceJust . gmap Just == id
  22776. 908.09 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  22777. 908.09 s [algebraic-graphs]
  22778. 908.09 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  22779. 908.09 s [algebraic-graphs] OK: closure empty == empty
  22780. 908.09 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  22781. 908.09 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  22782. 908.09 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22783. 908.09 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  22784. 908.09 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  22785. 908.09 s [algebraic-graphs] OK: closure . closure == closure
  22786. 908.09 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  22787. 908.09 s [algebraic-graphs]
  22788. 908.09 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  22789. 908.09 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  22790. 908.09 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  22791. 908.09 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  22792. 908.09 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  22793. 908.09 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  22794. 908.09 s [algebraic-graphs]
  22795. 908.09 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  22796. 908.09 s [algebraic-graphs] OK: symmetricClosure empty == empty
  22797. 908.09 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  22798. 908.09 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  22799. 908.09 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  22800. 908.09 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  22801. 908.09 s [algebraic-graphs]
  22802. 908.09 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  22803. 908.09 s [algebraic-graphs] OK: transitiveClosure empty == empty
  22804. 908.09 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  22805. 908.09 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  22806. 908.09 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  22807. 908.09 s [algebraic-graphs]
  22808. 908.09 s [algebraic-graphs] ============ Labelled.Graph.context ============
  22809. 908.09 s [algebraic-graphs] OK: context (const False) x == Nothing
  22810. 908.09 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  22811. 908.09 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  22812. 908.09 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  22813. 908.09 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  22814. 908.09 s [algebraic-graphs]
  22815. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  22816. 908.09 s [algebraic-graphs] OK: Axioms of non-empty graphs
  22817. 908.09 s [algebraic-graphs] OK: Theorems of non-empty graphs
  22818. 908.09 s [algebraic-graphs]
  22819. 908.09 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  22820. 908.09 s [algebraic-graphs] OK: vertex 1 < vertex 2
  22821. 908.09 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  22822. 908.09 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  22823. 908.09 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  22824. 908.09 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  22825. 908.09 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  22826. 908.09 s [algebraic-graphs] OK: x <= x + y
  22827. 908.09 s [algebraic-graphs] OK: x + y <= x * y
  22828. 908.09 s [algebraic-graphs]
  22829. 908.09 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  22830. 908.09 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  22831. 908.09 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  22832. 908.09 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  22833. 908.09 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  22834. 908.09 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  22835. 908.09 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  22836. 908.09 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  22837. 908.09 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  22838. 908.09 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  22839. 908.09 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  22840. 908.09 s [algebraic-graphs]
  22841. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  22842. 908.09 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  22843. 908.09 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  22844. 908.09 s [algebraic-graphs]
  22845. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  22846. 908.09 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  22847. 908.09 s [algebraic-graphs]
  22848. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  22849. 908.09 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22850. 908.09 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22851. 908.09 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22852. 908.09 s [algebraic-graphs]
  22853. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  22854. 908.09 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  22855. 908.09 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22856. 908.09 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22857. 908.09 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  22858. 908.09 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  22859. 908.09 s [algebraic-graphs]
  22860. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  22861. 908.09 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  22862. 908.09 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  22863. 908.09 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  22864. 908.09 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  22865. 908.09 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  22866. 908.09 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  22867. 908.09 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  22868. 908.09 s [algebraic-graphs]
  22869. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  22870. 908.09 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  22871. 908.09 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  22872. 908.09 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  22873. 908.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  22874. 908.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  22875. 908.09 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  22876. 908.09 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  22877. 908.09 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  22878. 908.09 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  22879. 908.09 s [algebraic-graphs]
  22880. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  22881. 908.09 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  22882. 908.09 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  22883. 908.09 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  22884. 908.09 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22885. 908.09 s [algebraic-graphs]
  22886. 908.09 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  22887. 908.09 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  22888. 908.09 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  22889. 908.09 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  22890. 908.09 s [algebraic-graphs]
  22891. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  22892. 911.02 s [algebraic-graphs] OK: overlays1 [x] == x
  22893. 911.02 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  22894. 911.02 s [algebraic-graphs]
  22895. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  22896. 911.02 s [algebraic-graphs] OK: connects1 [x] == x
  22897. 911.02 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  22898. 911.02 s [algebraic-graphs]
  22899. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  22900. 911.02 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  22901. 911.02 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  22902. 911.02 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  22903. 911.02 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  22904. 911.02 s [algebraic-graphs]
  22905. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  22906. 911.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  22907. 911.02 s [algebraic-graphs]
  22908. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  22909. 911.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  22910. 911.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  22911. 911.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  22912. 911.02 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  22913. 911.02 s [algebraic-graphs]
  22914. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  22915. 911.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  22916. 911.02 s [algebraic-graphs] OK: vertexCount x >= 1
  22917. 911.02 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  22918. 911.02 s [algebraic-graphs]
  22919. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  22920. 911.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  22921. 911.02 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  22922. 911.02 s [algebraic-graphs] OK: edgeCount == length . edgeList
  22923. 911.02 s [algebraic-graphs]
  22924. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  22925. 911.02 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  22926. 911.02 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  22927. 911.02 s [algebraic-graphs]
  22928. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  22929. 911.02 s [algebraic-graphs] OK: edgeList (vertex x) == []
  22930. 911.02 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  22931. 911.02 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  22932. 911.02 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  22933. 911.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  22934. 911.02 s [algebraic-graphs]
  22935. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  22936. 911.02 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  22937. 911.02 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  22938. 911.02 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  22939. 911.02 s [algebraic-graphs]
  22940. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  22941. 911.02 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  22942. 911.02 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  22943. 911.02 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  22944. 911.02 s [algebraic-graphs]
  22945. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  22946. 911.02 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  22947. 911.02 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  22948. 911.02 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  22949. 911.02 s [algebraic-graphs]
  22950. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  22951. 911.02 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  22952. 911.02 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  22953. 911.02 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  22954. 911.02 s [algebraic-graphs]
  22955. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  22956. 911.02 s [algebraic-graphs] OK: path1 [x] == vertex x
  22957. 911.02 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  22958. 911.02 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  22959. 911.02 s [algebraic-graphs]
  22960. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  22961. 911.02 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  22962. 911.02 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  22963. 911.02 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  22964. 911.02 s [algebraic-graphs]
  22965. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  22966. 911.02 s [algebraic-graphs] OK: clique1 [x] == vertex x
  22967. 911.02 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  22968. 911.02 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  22969. 911.02 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  22970. 911.02 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  22971. 911.02 s [algebraic-graphs]
  22972. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  22973. 911.02 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  22974. 911.02 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  22975. 911.02 s [algebraic-graphs]
  22976. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  22977. 911.02 s [algebraic-graphs] OK: star x [] == vertex x
  22978. 911.02 s [algebraic-graphs] OK: star x [y] == edge x y
  22979. 911.02 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  22980. 911.02 s [algebraic-graphs]
  22981. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  22982. 911.02 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  22983. 911.02 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  22984. 911.02 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  22985. 911.02 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  22986. 911.02 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  22987. 911.02 s [algebraic-graphs]
  22988. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  22989. 911.02 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  22990. 911.02 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  22991. 911.02 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  22992. 911.02 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  22993. 911.02 s [algebraic-graphs]
  22994. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  22995. 911.02 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  22996. 911.02 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  22997. 911.02 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  22998. 911.02 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  22999. 911.02 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23000. 911.02 s [algebraic-graphs]
  23001. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  23002. 911.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23003. 911.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23004. 911.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23005. 911.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23006. 911.02 s [algebraic-graphs]
  23007. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  23008. 911.02 s [algebraic-graphs] OK: replaceVertex x x == id
  23009. 911.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23010. 911.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23011. 911.02 s [algebraic-graphs]
  23012. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  23013. 911.02 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23014. 911.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23015. 911.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23016. 911.02 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23017. 911.02 s [algebraic-graphs]
  23018. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  23019. 911.02 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23020. 911.02 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23021. 911.02 s [algebraic-graphs] OK: transpose . transpose == id
  23022. 911.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23023. 911.02 s [algebraic-graphs]
  23024. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  23025. 911.02 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23026. 911.02 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23027. 911.02 s [algebraic-graphs] OK: gmap id == id
  23028. 911.02 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23029. 911.02 s [algebraic-graphs]
  23030. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  23031. 911.02 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23032. 911.02 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23033. 911.02 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23034. 911.02 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23035. 911.02 s [algebraic-graphs]
  23036. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  23037. 911.02 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23038. 911.02 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23039. 911.02 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  23040. 911.02 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  23041. 911.02 s [algebraic-graphs]
  23042. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  23043. 911.02 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23044. 911.02 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23045. 911.02 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23046. 911.02 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  23047. 911.02 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23048. 911.02 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23049. 911.02 s [algebraic-graphs] OK: closure . closure == closure
  23050. 911.02 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23051. 911.02 s [algebraic-graphs]
  23052. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  23053. 911.02 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23054. 911.02 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23055. 911.02 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  23056. 911.02 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23057. 911.02 s [algebraic-graphs]
  23058. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  23059. 911.02 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23060. 911.02 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  23061. 911.02 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23062. 911.02 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23063. 911.02 s [algebraic-graphs]
  23064. 911.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  23065. 911.02 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23066. 911.02 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23067. 911.02 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  23068. 911.02 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23069. 911.02 s [algebraic-graphs]
  23070. 911.02 s [algebraic-graphs] ============ NonEmpty.Graph.============
  23071. 911.02 s [algebraic-graphs] OK: Axioms of non-empty graphs
  23072. 911.02 s [algebraic-graphs] OK: Theorems of non-empty graphs
  23073. 911.02 s [algebraic-graphs]
  23074. 911.02 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  23075. 911.02 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23076. 911.02 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23077. 911.02 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23078. 911.02 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23079. 911.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23080. 911.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23081. 911.02 s [algebraic-graphs] OK: x <= x + y
  23082. 911.02 s [algebraic-graphs] OK: x + y <= x * y
  23083. 911.02 s [algebraic-graphs]
  23084. 911.02 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  23085. 911.02 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  23086. 911.02 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  23087. 911.02 s [algebraic-graphs] OK: fmap id == id
  23088. 911.02 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  23089. 911.02 s [algebraic-graphs]
  23090. 911.02 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  23091. 911.02 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  23092. 912.35 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  23093. 912.35 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  23094. 912.35 s [algebraic-graphs] OK: (x >>= vertex) == x
  23095. 912.35 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  23096. 912.35 s [algebraic-graphs]
  23097. 912.35 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  23098. 912.35 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  23099. 912.35 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  23100. 912.35 s [algebraic-graphs]
  23101. 912.35 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  23102. 912.35 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23103. 912.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23104. 912.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23105. 912.35 s [algebraic-graphs] OK: size (vertex x) == 1
  23106. 912.36 s [algebraic-graphs]
  23107. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  23108. 912.36 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23109. 912.36 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23110. 912.36 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23111. 912.36 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23112. 912.36 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23113. 912.36 s [algebraic-graphs]
  23114. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  23115. 912.36 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23116. 912.36 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23117. 912.36 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23118. 912.36 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23119. 912.36 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23120. 912.36 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23121. 912.36 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23122. 912.36 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23123. 912.36 s [algebraic-graphs]
  23124. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  23125. 912.36 s [algebraic-graphs] OK: overlay1 empty x == x
  23126. 912.36 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  23127. 912.36 s [algebraic-graphs]
  23128. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  23129. 912.36 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23130. 912.36 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23131. 912.36 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23132. 912.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23133. 912.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23134. 912.36 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23135. 912.36 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23136. 912.36 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23137. 912.36 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23138. 912.36 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23139. 912.36 s [algebraic-graphs]
  23140. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  23141. 912.36 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  23142. 912.36 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  23143. 912.36 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  23144. 912.36 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23145. 912.36 s [algebraic-graphs]
  23146. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  23147. 912.36 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  23148. 912.36 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  23149. 912.36 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  23150. 912.36 s [algebraic-graphs]
  23151. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  23152. 912.36 s [algebraic-graphs] OK: overlays1 [x] == x
  23153. 912.36 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  23154. 912.36 s [algebraic-graphs]
  23155. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  23156. 912.36 s [algebraic-graphs] OK: connects1 [x] == x
  23157. 912.36 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  23158. 912.36 s [algebraic-graphs]
  23159. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  23160. 912.36 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  23161. 912.36 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  23162. 912.36 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  23163. 912.36 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  23164. 912.36 s [algebraic-graphs]
  23165. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  23166. 912.36 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23167. 912.36 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23168. 912.36 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  23169. 912.36 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23170. 912.36 s [algebraic-graphs]
  23171. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  23172. 912.36 s [algebraic-graphs] OK: x === x == True
  23173. 912.36 s [algebraic-graphs] OK: x + y === x + y == True
  23174. 912.36 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  23175. 912.36 s [algebraic-graphs] OK: x + y === x * y == False
  23176. 912.36 s [algebraic-graphs]
  23177. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  23178. 912.36 s [algebraic-graphs] OK: size (vertex x) == 1
  23179. 912.36 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  23180. 912.36 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  23181. 912.36 s [algebraic-graphs] OK: size x >= 1
  23182. 912.36 s [algebraic-graphs] OK: size x >= vertexCount x
  23183. 912.36 s [algebraic-graphs]
  23184. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  23185. 912.36 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23186. 912.36 s [algebraic-graphs]
  23187. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  23188. 912.36 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23189. 912.36 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23190. 912.36 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23191. 912.36 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23192. 912.36 s [algebraic-graphs]
  23193. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  23194. 912.36 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23195. 912.36 s [algebraic-graphs] OK: vertexCount x >= 1
  23196. 912.36 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  23197. 912.36 s [algebraic-graphs]
  23198. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  23199. 912.36 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23200. 912.36 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23201. 912.36 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23202. 912.36 s [algebraic-graphs]
  23203. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  23204. 912.36 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  23205. 912.36 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  23206. 912.36 s [algebraic-graphs]
  23207. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  23208. 912.36 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23209. 912.36 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23210. 912.36 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23211. 912.36 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  23212. 912.36 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23213. 912.36 s [algebraic-graphs]
  23214. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  23215. 912.36 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23216. 912.36 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  23217. 912.36 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  23218. 912.36 s [algebraic-graphs]
  23219. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  23220. 912.36 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23221. 912.36 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23222. 912.36 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  23223. 912.36 s [algebraic-graphs]
  23224. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  23225. 912.36 s [algebraic-graphs] OK: path1 [x] == vertex x
  23226. 912.36 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  23227. 912.36 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  23228. 912.36 s [algebraic-graphs]
  23229. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  23230. 912.36 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  23231. 912.36 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  23232. 912.36 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  23233. 912.36 s [algebraic-graphs]
  23234. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  23235. 912.36 s [algebraic-graphs] OK: clique1 [x] == vertex x
  23236. 912.36 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  23237. 912.36 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  23238. 912.36 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  23239. 912.36 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  23240. 912.36 s [algebraic-graphs]
  23241. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  23242. 912.36 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23243. 912.36 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  23244. 912.36 s [algebraic-graphs]
  23245. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  23246. 912.36 s [algebraic-graphs] OK: star x [] == vertex x
  23247. 912.36 s [algebraic-graphs] OK: star x [y] == edge x y
  23248. 912.36 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  23249. 912.36 s [algebraic-graphs]
  23250. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  23251. 912.36 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  23252. 912.36 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  23253. 912.36 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  23254. 912.36 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  23255. 912.36 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  23256. 912.36 s [algebraic-graphs]
  23257. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  23258. 912.36 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23259. 912.36 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  23260. 912.36 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23261. 912.36 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  23262. 912.36 s [algebraic-graphs]
  23263. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  23264. 912.36 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  23265. 912.36 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  23266. 912.36 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  23267. 912.36 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  23268. 912.36 s [algebraic-graphs]
  23269. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  23270. 912.36 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  23271. 912.36 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  23272. 912.36 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  23273. 912.36 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  23274. 912.36 s [algebraic-graphs]
  23275. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  23276. 912.36 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  23277. 912.36 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  23278. 912.36 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  23279. 912.36 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  23280. 912.36 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  23281. 912.36 s [algebraic-graphs]
  23282. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  23283. 912.36 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  23284. 912.36 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23285. 912.36 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23286. 912.36 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23287. 912.36 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  23288. 912.36 s [algebraic-graphs]
  23289. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  23290. 912.36 s [algebraic-graphs] OK: replaceVertex x x == id
  23291. 912.36 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23292. 912.36 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23293. 912.36 s [algebraic-graphs]
  23294. 912.36 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  23295. 912.36 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23296. 918.22 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23297. 918.22 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23298. 918.25 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23299. 918.25 s [algebraic-graphs]
  23300. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  23301. 918.25 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  23302. 918.25 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  23303. 918.25 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  23304. 918.25 s [algebraic-graphs]
  23305. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  23306. 918.25 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23307. 918.25 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23308. 918.25 s [algebraic-graphs] OK: transpose . transpose == id
  23309. 918.25 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23310. 918.25 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23311. 918.25 s [algebraic-graphs]
  23312. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  23313. 918.25 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  23314. 918.25 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  23315. 918.25 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  23316. 918.25 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  23317. 918.25 s [algebraic-graphs]
  23318. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  23319. 918.25 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  23320. 918.25 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  23321. 918.25 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  23322. 918.25 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  23323. 918.25 s [algebraic-graphs]
  23324. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  23325. 918.25 s [algebraic-graphs] OK: simplify == id
  23326. 918.25 s [algebraic-graphs] OK: size (simplify x) <= size x
  23327. 918.25 s [algebraic-graphs] OK: simplify 1 === 1
  23328. 918.25 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  23329. 918.25 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  23330. 918.25 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  23331. 918.25 s [algebraic-graphs]
  23332. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  23333. 918.25 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  23334. 918.25 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  23335. 918.25 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  23336. 918.25 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  23337. 918.25 s [algebraic-graphs]
  23338. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  23339. 918.25 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  23340. 918.25 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  23341. 918.25 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  23342. 918.25 s [algebraic-graphs]
  23343. 918.25 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  23344. 918.25 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  23345. 918.25 s [algebraic-graphs] OK: box x y ~~ box y x
  23346. 918.25 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  23347. 918.25 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  23348. 918.25 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  23349. 918.25 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  23350. 918.25 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  23351. 918.25 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  23352. 918.25 s [algebraic-graphs]
  23353. 918.25 s [algebraic-graphs] ============ Relation ============
  23354. 918.25 s [algebraic-graphs] OK: Axioms of graphs
  23355. 918.25 s [algebraic-graphs]
  23356. 918.25 s [algebraic-graphs] ============ Relation.consistent ============
  23357. 918.25 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23358. 918.25 s [algebraic-graphs]
  23359. 918.25 s [algebraic-graphs] OK: consistent empty == True
  23360. 918.25 s [algebraic-graphs] OK: consistent (vertex x) == True
  23361. 918.25 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23362. 918.25 s [algebraic-graphs] OK: consistent (connect x y) == True
  23363. 918.25 s [algebraic-graphs] OK: consistent (edge x y) == True
  23364. 918.25 s [algebraic-graphs] OK: consistent (edges xs) == True
  23365. 918.25 s [algebraic-graphs] OK: consistent (stars xs) == True
  23366. 918.25 s [algebraic-graphs]
  23367. 918.25 s [algebraic-graphs] ============ Relation.Show ============
  23368. 918.25 s [algebraic-graphs] OK: show (empty ) == "empty"
  23369. 918.25 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23370. 918.25 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23371. 918.25 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23372. 918.25 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23373. 918.25 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23374. 918.25 s [algebraic-graphs]
  23375. 918.25 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23376. 918.25 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23377. 918.26 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23378. 918.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23379. 918.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23380. 918.26 s [algebraic-graphs]
  23381. 918.26 s [algebraic-graphs] ============ Relation.Ord ============
  23382. 918.26 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23383. 918.26 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23384. 918.26 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23385. 918.26 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23386. 918.26 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23387. 918.26 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  23388. 918.26 s [algebraic-graphs] OK: x <= x + y
  23389. 918.26 s [algebraic-graphs] OK: x + y <= x * y
  23390. 918.26 s [algebraic-graphs]
  23391. 918.26 s [algebraic-graphs] ============ Relation.empty ============
  23392. 918.26 s [algebraic-graphs] OK: isEmpty empty == True
  23393. 918.26 s [algebraic-graphs] OK: hasVertex x empty == False
  23394. 918.26 s [algebraic-graphs] OK: vertexCount empty == 0
  23395. 918.26 s [algebraic-graphs] OK: edgeCount empty == 0
  23396. 918.26 s [algebraic-graphs]
  23397. 918.26 s [algebraic-graphs] ============ Relation.vertex ============
  23398. 918.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23399. 918.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23400. 918.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23401. 918.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23402. 918.26 s [algebraic-graphs]
  23403. 918.26 s [algebraic-graphs] ============ Relation.edge ============
  23404. 918.26 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23405. 918.26 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23406. 918.26 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23407. 918.26 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23408. 918.26 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23409. 918.26 s [algebraic-graphs]
  23410. 918.26 s [algebraic-graphs] ============ Relation.overlay ============
  23411. 918.26 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23412. 918.26 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23413. 918.26 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23414. 918.26 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23415. 918.26 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23416. 918.26 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23417. 918.26 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23418. 918.26 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23419. 918.26 s [algebraic-graphs]
  23420. 918.26 s [algebraic-graphs] ============ Relation.connect ============
  23421. 918.26 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23422. 918.26 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23423. 918.26 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23424. 918.26 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23425. 918.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23426. 918.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23427. 918.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  23428. 918.26 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23429. 918.26 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23430. 918.26 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23431. 918.26 s [algebraic-graphs]
  23432. 918.26 s [algebraic-graphs] ============ Relation.vertices ============
  23433. 918.26 s [algebraic-graphs] OK: vertices [] == empty
  23434. 918.26 s [algebraic-graphs] OK: vertices [x] == vertex x
  23435. 918.26 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23436. 918.26 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23437. 918.26 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23438. 918.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23439. 918.26 s [algebraic-graphs]
  23440. 918.26 s [algebraic-graphs] ============ Relation.edges ============
  23441. 918.26 s [algebraic-graphs] OK: edges [] == empty
  23442. 918.26 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23443. 918.26 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  23444. 918.26 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  23445. 918.26 s [algebraic-graphs]
  23446. 918.26 s [algebraic-graphs] ============ Relation.overlays ============
  23447. 918.26 s [algebraic-graphs] OK: overlays [] == empty
  23448. 918.26 s [algebraic-graphs] OK: overlays [x] == x
  23449. 918.26 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23450. 918.26 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23451. 918.26 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23452. 918.26 s [algebraic-graphs]
  23453. 918.26 s [algebraic-graphs] ============ Relation.connects ============
  23454. 918.26 s [algebraic-graphs] OK: connects [] == empty
  23455. 918.26 s [algebraic-graphs] OK: connects [x] == x
  23456. 918.26 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23457. 918.26 s [algebraic-graphs] OK: connects == foldr connect empty
  23458. 918.26 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23459. 918.26 s [algebraic-graphs]
  23460. 918.26 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  23461. 918.26 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23462. 918.26 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23463. 918.26 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23464. 918.26 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23465. 918.26 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23466. 918.26 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23467. 918.26 s [algebraic-graphs]
  23468. 918.26 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  23469. 918.26 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23470. 918.26 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23471. 918.26 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23472. 918.26 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23473. 918.26 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23474. 918.26 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23475. 918.26 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23476. 918.26 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23477. 918.26 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23478. 918.26 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23479. 918.26 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23480. 918.26 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23481. 918.26 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  23482. 918.26 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  23483. 918.26 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  23484. 918.26 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  23485. 918.26 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  23486. 921.28 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23487. 921.28 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23488. 921.28 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23489. 921.28 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23490. 921.28 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23491. 921.28 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23492. 921.28 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23493. 921.28 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23494. 921.28 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23495. 921.28 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23496. 921.28 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23497. 921.28 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23498. 921.28 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23499. 921.28 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23500. 921.28 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23501. 921.28 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23502. 921.28 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23503. 921.28 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23504. 921.28 s [algebraic-graphs]
  23505. 921.28 s [algebraic-graphs] ============ Relation.foldg ============
  23506. 921.28 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  23507. 921.28 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  23508. 921.28 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  23509. 921.28 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  23510. 921.28 s [algebraic-graphs]
  23511. 921.28 s [algebraic-graphs] ============ Relation.isEmpty ============
  23512. 921.28 s [algebraic-graphs] OK: isEmpty empty == True
  23513. 921.28 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23514. 921.28 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23515. 921.28 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23516. 921.28 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23517. 921.28 s [algebraic-graphs]
  23518. 921.28 s [algebraic-graphs] ============ Relation.hasVertex ============
  23519. 921.28 s [algebraic-graphs] OK: hasVertex x empty == False
  23520. 921.28 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23521. 921.28 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23522. 921.28 s [algebraic-graphs]
  23523. 921.28 s [algebraic-graphs] ============ Relation.hasEdge ============
  23524. 921.28 s [algebraic-graphs] OK: hasEdge x y empty == False
  23525. 921.28 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23526. 921.28 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23527. 921.28 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23528. 921.28 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  23529. 921.28 s [algebraic-graphs]
  23530. 921.28 s [algebraic-graphs] ============ Relation.vertexCount ============
  23531. 921.28 s [algebraic-graphs] OK: vertexCount empty == 0
  23532. 921.28 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23533. 921.28 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23534. 921.28 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23535. 921.28 s [algebraic-graphs]
  23536. 921.28 s [algebraic-graphs] ============ Relation.edgeCount ============
  23537. 921.28 s [algebraic-graphs] OK: edgeCount empty == 0
  23538. 921.28 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23539. 921.28 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23540. 921.28 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23541. 921.28 s [algebraic-graphs]
  23542. 921.28 s [algebraic-graphs] ============ Relation.vertexList ============
  23543. 921.28 s [algebraic-graphs] OK: vertexList empty == []
  23544. 921.28 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23545. 921.28 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23546. 921.28 s [algebraic-graphs]
  23547. 921.28 s [algebraic-graphs] ============ Relation.vertexSet ============
  23548. 921.28 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23549. 921.28 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23550. 921.28 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23551. 921.28 s [algebraic-graphs]
  23552. 921.28 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  23553. 921.28 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23554. 921.28 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23555. 921.28 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23556. 921.28 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23557. 921.28 s [algebraic-graphs]
  23558. 921.28 s [algebraic-graphs] ============ Relation.edgeList ============
  23559. 921.28 s [algebraic-graphs] OK: edgeList empty == []
  23560. 921.28 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23561. 921.28 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  23562. 921.28 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  23563. 921.28 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  23564. 921.28 s [algebraic-graphs]
  23565. 921.28 s [algebraic-graphs] ============ Relation.edgeSet ============
  23566. 921.28 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23567. 921.28 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23568. 921.28 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  23569. 921.28 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  23570. 921.28 s [algebraic-graphs]
  23571. 921.28 s [algebraic-graphs] ============ Relation.adjacencyList ============
  23572. 921.28 s [algebraic-graphs] OK: adjacencyList empty == []
  23573. 921.28 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23574. 921.28 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  23575. 921.28 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  23576. 921.28 s [algebraic-graphs]
  23577. 921.28 s [algebraic-graphs] ============ Relation.preSet ============
  23578. 921.28 s [algebraic-graphs] OK: preSet x empty == Set.empty
  23579. 921.28 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  23580. 921.28 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  23581. 921.28 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  23582. 921.28 s [algebraic-graphs]
  23583. 921.28 s [algebraic-graphs] ============ Relation.preIntSet ============
  23584. 921.28 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  23585. 921.28 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  23586. 921.28 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  23587. 921.28 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  23588. 921.28 s [algebraic-graphs]
  23589. 921.28 s [algebraic-graphs] ============ Relation.postSet ============
  23590. 921.28 s [algebraic-graphs] OK: postSet x empty == Set.empty
  23591. 921.28 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  23592. 921.28 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  23593. 921.28 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  23594. 921.28 s [algebraic-graphs]
  23595. 921.28 s [algebraic-graphs] ============ Relation.postIntSet ============
  23596. 921.28 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  23597. 921.28 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  23598. 921.28 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  23599. 921.28 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  23600. 921.28 s [algebraic-graphs]
  23601. 921.28 s [algebraic-graphs] ============ Relation.path ============
  23602. 921.28 s [algebraic-graphs] OK: path [] == empty
  23603. 921.28 s [algebraic-graphs] OK: path [x] == vertex x
  23604. 921.28 s [algebraic-graphs] OK: path [x,y] == edge x y
  23605. 921.28 s [algebraic-graphs]
  23606. 921.28 s [algebraic-graphs] ============ Relation.circuit ============
  23607. 921.28 s [algebraic-graphs] OK: circuit [] == empty
  23608. 921.28 s [algebraic-graphs] OK: circuit [x] == edge x x
  23609. 921.28 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  23610. 921.28 s [algebraic-graphs]
  23611. 921.28 s [algebraic-graphs] ============ Relation.clique ============
  23612. 921.28 s [algebraic-graphs] OK: clique [] == empty
  23613. 921.28 s [algebraic-graphs] OK: clique [x] == vertex x
  23614. 921.28 s [algebraic-graphs] OK: clique [x,y] == edge x y
  23615. 921.28 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  23616. 921.28 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  23617. 921.28 s [algebraic-graphs]
  23618. 921.28 s [algebraic-graphs] ============ Relation.biclique ============
  23619. 921.28 s [algebraic-graphs] OK: biclique [] [] == empty
  23620. 921.28 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  23621. 921.28 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  23622. 921.28 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  23623. 921.28 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  23624. 921.28 s [algebraic-graphs]
  23625. 921.28 s [algebraic-graphs] ============ Relation.star ============
  23626. 921.28 s [algebraic-graphs] OK: star x [] == vertex x
  23627. 921.28 s [algebraic-graphs] OK: star x [y] == edge x y
  23628. 921.28 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  23629. 921.28 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  23630. 921.28 s [algebraic-graphs]
  23631. 921.28 s [algebraic-graphs] ============ Relation.stars ============
  23632. 921.28 s [algebraic-graphs] OK: stars [] == empty
  23633. 921.28 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  23634. 921.28 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  23635. 921.28 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  23636. 921.28 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  23637. 921.28 s [algebraic-graphs] OK: stars . adjacencyList == id
  23638. 921.28 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  23639. 921.28 s [algebraic-graphs]
  23640. 921.28 s [algebraic-graphs] ============ Relation.tree ============
  23641. 921.28 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  23642. 921.28 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  23643. 921.28 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  23644. 921.28 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  23645. 921.28 s [algebraic-graphs]
  23646. 921.28 s [algebraic-graphs] ============ Relation.forest ============
  23647. 921.28 s [algebraic-graphs] OK: forest [] == empty
  23648. 921.28 s [algebraic-graphs] OK: forest [x] == tree x
  23649. 921.28 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  23650. 921.28 s [algebraic-graphs] OK: forest == overlays . map tree
  23651. 921.28 s [algebraic-graphs]
  23652. 921.28 s [algebraic-graphs] ============ Relation.removeVertex ============
  23653. 921.28 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  23654. 921.28 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  23655. 921.28 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  23656. 921.28 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  23657. 921.28 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  23658. 921.28 s [algebraic-graphs]
  23659. 921.28 s [algebraic-graphs] ============ Relation.removeEdge ============
  23660. 921.28 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  23661. 921.28 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  23662. 921.28 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  23663. 921.28 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  23664. 921.28 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  23665. 921.28 s [algebraic-graphs]
  23666. 921.28 s [algebraic-graphs] ============ Relation.replaceVertex ============
  23667. 921.28 s [algebraic-graphs] OK: replaceVertex x x == id
  23668. 921.28 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  23669. 921.28 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  23670. 921.28 s [algebraic-graphs]
  23671. 921.28 s [algebraic-graphs] ============ Relation.mergeVertices ============
  23672. 921.28 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  23673. 941.52 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  23674. 941.52 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  23675. 941.55 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  23676. 941.55 s [algebraic-graphs]
  23677. 941.55 s [algebraic-graphs] ============ Relation.transpose ============
  23678. 941.55 s [algebraic-graphs] OK: transpose empty == empty
  23679. 941.55 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  23680. 941.55 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  23681. 941.55 s [algebraic-graphs] OK: transpose . transpose == id
  23682. 941.55 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  23683. 941.55 s [algebraic-graphs]
  23684. 941.55 s [algebraic-graphs] ============ Relation.gmap ============
  23685. 941.55 s [algebraic-graphs] OK: gmap f empty == empty
  23686. 941.55 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  23687. 941.55 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  23688. 941.55 s [algebraic-graphs] OK: gmap id == id
  23689. 941.55 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  23690. 941.55 s [algebraic-graphs]
  23691. 941.55 s [algebraic-graphs] ============ Relation.induce ============
  23692. 941.55 s [algebraic-graphs] OK: induce (const True ) x == x
  23693. 941.55 s [algebraic-graphs] OK: induce (const False) x == empty
  23694. 941.55 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  23695. 941.55 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  23696. 941.55 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  23697. 941.55 s [algebraic-graphs]
  23698. 941.55 s [algebraic-graphs] ============ Relation.compose ============
  23699. 941.55 s [algebraic-graphs] OK: compose empty x == empty
  23700. 941.55 s [algebraic-graphs] OK: compose x empty == empty
  23701. 941.55 s [algebraic-graphs] OK: compose (vertex x) y == empty
  23702. 941.55 s [algebraic-graphs] OK: compose x (vertex y) == empty
  23703. 941.55 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  23704. 941.55 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  23705. 941.55 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  23706. 941.55 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  23707. 941.55 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  23708. 941.55 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  23709. 941.55 s [algebraic-graphs]
  23710. 941.55 s [algebraic-graphs] ============ Relation.closure ============
  23711. 941.55 s [algebraic-graphs] OK: closure empty == empty
  23712. 941.55 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  23713. 941.55 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  23714. 941.55 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23715. 941.55 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  23716. 941.55 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  23717. 941.55 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  23718. 941.55 s [algebraic-graphs] OK: closure . closure == closure
  23719. 941.55 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  23720. 941.55 s [algebraic-graphs]
  23721. 941.55 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  23722. 941.55 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  23723. 941.55 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  23724. 941.55 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  23725. 941.55 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  23726. 941.55 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  23727. 941.55 s [algebraic-graphs]
  23728. 941.55 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  23729. 941.55 s [algebraic-graphs] OK: symmetricClosure empty == empty
  23730. 941.55 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  23731. 941.55 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  23732. 941.55 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  23733. 941.55 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  23734. 941.55 s [algebraic-graphs]
  23735. 941.55 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  23736. 941.55 s [algebraic-graphs] OK: transitiveClosure empty == empty
  23737. 941.55 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  23738. 941.55 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  23739. 941.55 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  23740. 941.55 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  23741. 941.55 s [algebraic-graphs]
  23742. 941.55 s [algebraic-graphs] ============ Relation.induceJust ============
  23743. 941.55 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  23744. 941.55 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  23745. 941.55 s [algebraic-graphs] OK: induceJust . gmap Just == id
  23746. 941.55 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  23747. 941.55 s [algebraic-graphs]
  23748. 941.55 s [algebraic-graphs] ============ ReflexiveRelation ============
  23749. 941.55 s [algebraic-graphs] OK: Axioms of reflexive graphs
  23750. 941.55 s [algebraic-graphs]
  23751. 941.55 s [algebraic-graphs] ============ TransitiveRelation ============
  23752. 941.55 s [algebraic-graphs] OK: Axioms of transitive graphs
  23753. 941.55 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  23754. 941.55 s [algebraic-graphs]
  23755. 941.55 s [algebraic-graphs] ============ PreorderRelation ============
  23756. 941.55 s [algebraic-graphs] OK: Axioms of preorder graphs
  23757. 941.55 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  23758. 941.55 s [algebraic-graphs]
  23759. 941.55 s [algebraic-graphs] ============ Symmetric.Relation ============
  23760. 941.55 s [algebraic-graphs] OK: Axioms of undirected graphs
  23761. 941.55 s [algebraic-graphs]
  23762. 941.55 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  23763. 941.55 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  23764. 941.55 s [algebraic-graphs]
  23765. 941.55 s [algebraic-graphs] OK: consistent empty == True
  23766. 941.55 s [algebraic-graphs] OK: consistent (vertex x) == True
  23767. 941.55 s [algebraic-graphs] OK: consistent (overlay x y) == True
  23768. 941.55 s [algebraic-graphs] OK: consistent (connect x y) == True
  23769. 941.55 s [algebraic-graphs] OK: consistent (edge x y) == True
  23770. 941.55 s [algebraic-graphs] OK: consistent (edges xs) == True
  23771. 941.55 s [algebraic-graphs] OK: consistent (stars xs) == True
  23772. 941.55 s [algebraic-graphs]
  23773. 941.55 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  23774. 941.55 s [algebraic-graphs] OK: show (empty ) == "empty"
  23775. 941.55 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  23776. 941.55 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  23777. 941.55 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  23778. 941.55 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  23779. 941.55 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  23780. 941.55 s [algebraic-graphs]
  23781. 941.55 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  23782. 941.55 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  23783. 941.55 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  23784. 941.55 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  23785. 941.55 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  23786. 941.55 s [algebraic-graphs]
  23787. 941.55 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  23788. 941.55 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  23789. 941.55 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  23790. 941.56 s [algebraic-graphs]
  23791. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  23792. 941.56 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  23793. 941.56 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  23794. 941.56 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  23795. 941.56 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  23796. 941.56 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  23797. 941.56 s [algebraic-graphs]
  23798. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  23799. 941.56 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  23800. 941.56 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  23801. 941.56 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  23802. 941.56 s [algebraic-graphs]
  23803. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  23804. 941.56 s [algebraic-graphs] OK: vertex 1 < vertex 2
  23805. 941.56 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  23806. 941.56 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  23807. 941.56 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  23808. 941.56 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  23809. 941.56 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  23810. 941.56 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  23811. 941.56 s [algebraic-graphs] OK: x <= x + y
  23812. 941.56 s [algebraic-graphs] OK: x + y <= x * y
  23813. 941.56 s [algebraic-graphs]
  23814. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  23815. 941.56 s [algebraic-graphs] OK: isEmpty empty == True
  23816. 941.56 s [algebraic-graphs] OK: hasVertex x empty == False
  23817. 941.56 s [algebraic-graphs] OK: vertexCount empty == 0
  23818. 941.56 s [algebraic-graphs] OK: edgeCount empty == 0
  23819. 941.56 s [algebraic-graphs]
  23820. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  23821. 941.56 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23822. 941.56 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23823. 941.56 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23824. 941.56 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23825. 941.56 s [algebraic-graphs]
  23826. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  23827. 941.56 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  23828. 941.56 s [algebraic-graphs] OK: edge x y == edge y x
  23829. 941.56 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  23830. 941.56 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23831. 941.56 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23832. 941.56 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  23833. 941.56 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  23834. 941.56 s [algebraic-graphs]
  23835. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  23836. 941.56 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  23837. 941.56 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  23838. 941.56 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  23839. 941.56 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  23840. 941.56 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  23841. 941.56 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  23842. 941.56 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  23843. 941.56 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  23844. 941.56 s [algebraic-graphs]
  23845. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  23846. 941.56 s [algebraic-graphs] OK: connect x y == connect y x
  23847. 941.56 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  23848. 941.56 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  23849. 941.56 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  23850. 941.56 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  23851. 941.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  23852. 941.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  23853. 941.56 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  23854. 941.56 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  23855. 941.56 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  23856. 941.56 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  23857. 941.56 s [algebraic-graphs]
  23858. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  23859. 941.56 s [algebraic-graphs] OK: vertices [] == empty
  23860. 941.56 s [algebraic-graphs] OK: vertices [x] == vertex x
  23861. 941.56 s [algebraic-graphs] OK: vertices == overlays . map vertex
  23862. 941.56 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  23863. 941.56 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  23864. 941.56 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23865. 941.56 s [algebraic-graphs]
  23866. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  23867. 941.56 s [algebraic-graphs] OK: edges [] == empty
  23868. 941.56 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  23869. 941.56 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  23870. 941.56 s [algebraic-graphs]
  23871. 941.56 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  23872. 941.56 s [algebraic-graphs] OK: overlays [] == empty
  23873. 951.86 s [algebraic-graphs] OK: overlays [x] == x
  23874. 951.90 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  23875. 951.90 s [algebraic-graphs] OK: overlays == foldr overlay empty
  23876. 951.90 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  23877. 951.90 s [algebraic-graphs]
  23878. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  23879. 951.90 s [algebraic-graphs] OK: connects [] == empty
  23880. 951.90 s [algebraic-graphs] OK: connects [x] == x
  23881. 951.90 s [algebraic-graphs] OK: connects [x,y] == connect x y
  23882. 951.90 s [algebraic-graphs] OK: connects == foldr connect empty
  23883. 951.90 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  23884. 951.90 s [algebraic-graphs] OK: connects == connects . reverse
  23885. 951.90 s [algebraic-graphs]
  23886. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  23887. 951.90 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  23888. 951.90 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  23889. 951.90 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  23890. 951.90 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  23891. 951.90 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  23892. 951.90 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  23893. 951.90 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  23894. 951.90 s [algebraic-graphs]
  23895. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  23896. 951.90 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  23897. 951.90 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  23898. 951.90 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  23899. 951.90 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  23900. 951.90 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  23901. 951.90 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  23902. 951.90 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  23903. 951.90 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  23904. 951.90 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  23905. 951.90 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  23906. 951.90 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  23907. 951.90 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  23908. 951.90 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  23909. 951.90 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  23910. 951.90 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  23911. 951.90 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  23912. 951.90 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  23913. 951.90 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  23914. 951.90 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  23915. 951.90 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  23916. 951.90 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  23917. 951.90 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  23918. 951.90 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  23919. 951.90 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23920. 951.90 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  23921. 951.90 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  23922. 951.90 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  23923. 951.90 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  23924. 951.90 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  23925. 951.90 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  23926. 951.90 s [algebraic-graphs]
  23927. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  23928. 951.90 s [algebraic-graphs] OK: isEmpty empty == True
  23929. 951.90 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  23930. 951.90 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  23931. 951.90 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  23932. 951.90 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  23933. 951.90 s [algebraic-graphs]
  23934. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  23935. 951.90 s [algebraic-graphs] OK: hasVertex x empty == False
  23936. 951.90 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  23937. 951.90 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  23938. 951.90 s [algebraic-graphs]
  23939. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  23940. 951.90 s [algebraic-graphs] OK: hasEdge x y empty == False
  23941. 951.90 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  23942. 951.90 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  23943. 951.90 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  23944. 951.90 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  23945. 951.90 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  23946. 951.90 s [algebraic-graphs]
  23947. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  23948. 951.90 s [algebraic-graphs] OK: vertexCount empty == 0
  23949. 951.90 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  23950. 951.90 s [algebraic-graphs] OK: vertexCount == length . vertexList
  23951. 951.90 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  23952. 951.90 s [algebraic-graphs]
  23953. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  23954. 951.90 s [algebraic-graphs] OK: edgeCount empty == 0
  23955. 951.90 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  23956. 951.90 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  23957. 951.90 s [algebraic-graphs] OK: edgeCount == length . edgeList
  23958. 951.90 s [algebraic-graphs]
  23959. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  23960. 951.90 s [algebraic-graphs] OK: vertexList empty == []
  23961. 951.90 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  23962. 951.90 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  23963. 951.90 s [algebraic-graphs]
  23964. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  23965. 951.90 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  23966. 951.90 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  23967. 951.90 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  23968. 951.90 s [algebraic-graphs]
  23969. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  23970. 951.90 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  23971. 951.90 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  23972. 951.90 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  23973. 951.90 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  23974. 951.90 s [algebraic-graphs]
  23975. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  23976. 951.90 s [algebraic-graphs] OK: edgeList empty == []
  23977. 951.90 s [algebraic-graphs] OK: edgeList (vertex x) == []
  23978. 951.90 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  23979. 951.90 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  23980. 951.90 s [algebraic-graphs]
  23981. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  23982. 951.90 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  23983. 951.90 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  23984. 951.90 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  23985. 951.90 s [algebraic-graphs]
  23986. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  23987. 951.90 s [algebraic-graphs] OK: adjacencyList empty == []
  23988. 951.90 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  23989. 951.90 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  23990. 951.90 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  23991. 951.90 s [algebraic-graphs]
  23992. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  23993. 951.90 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  23994. 951.90 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  23995. 951.90 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  23996. 951.90 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  23997. 951.90 s [algebraic-graphs]
  23998. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  23999. 951.90 s [algebraic-graphs] OK: path [] == empty
  24000. 951.90 s [algebraic-graphs] OK: path [x] == vertex x
  24001. 951.90 s [algebraic-graphs] OK: path [x,y] == edge x y
  24002. 951.90 s [algebraic-graphs] OK: path == path . reverse
  24003. 951.90 s [algebraic-graphs]
  24004. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  24005. 951.90 s [algebraic-graphs] OK: circuit [] == empty
  24006. 951.90 s [algebraic-graphs] OK: circuit [x] == edge x x
  24007. 951.90 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24008. 951.90 s [algebraic-graphs] OK: circuit == circuit . reverse
  24009. 951.90 s [algebraic-graphs]
  24010. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  24011. 951.90 s [algebraic-graphs] OK: clique [] == empty
  24012. 951.90 s [algebraic-graphs] OK: clique [x] == vertex x
  24013. 951.90 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24014. 951.90 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24015. 951.90 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24016. 951.90 s [algebraic-graphs] OK: clique == clique . reverse
  24017. 951.90 s [algebraic-graphs]
  24018. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  24019. 951.90 s [algebraic-graphs] OK: biclique [] [] == empty
  24020. 951.90 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24021. 951.90 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24022. 951.90 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24023. 951.90 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24024. 951.90 s [algebraic-graphs]
  24025. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  24026. 951.90 s [algebraic-graphs] OK: star x [] == vertex x
  24027. 951.90 s [algebraic-graphs] OK: star x [y] == edge x y
  24028. 951.90 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24029. 951.90 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24030. 951.90 s [algebraic-graphs]
  24031. 951.90 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  24032. 951.90 s [algebraic-graphs] OK: stars [] == empty
  24033. 951.90 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24034. 951.90 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24035. 951.90 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24036. 951.90 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24037. 951.90 s [algebraic-graphs] OK: stars . adjacencyList == id
  24038. 951.91 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24039. 951.91 s [algebraic-graphs]
  24040. 951.91 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  24041. 951.91 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24042. 951.91 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24043. 951.91 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24044. 951.91 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  24045. 951.91 s [algebraic-graphs]
  24046. 951.91 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  24047. 951.91 s [algebraic-graphs] OK: forest [] == empty
  24048. 958.47 s [algebraic-graphs] OK: forest [x] == tree x
  24049. 958.47 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24050. 958.51 s [algebraic-graphs] OK: forest == overlays . map tree
  24051. 958.51 s [algebraic-graphs]
  24052. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  24053. 958.51 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24054. 958.51 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24055. 958.51 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24056. 958.51 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24057. 958.51 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24058. 958.51 s [algebraic-graphs]
  24059. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  24060. 958.51 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24061. 958.51 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24062. 958.51 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24063. 958.51 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24064. 958.51 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24065. 958.51 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24066. 958.51 s [algebraic-graphs]
  24067. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  24068. 958.51 s [algebraic-graphs] OK: replaceVertex x x == id
  24069. 958.51 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24070. 958.51 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24071. 958.51 s [algebraic-graphs]
  24072. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  24073. 958.51 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24074. 958.51 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24075. 958.51 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24076. 958.51 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24077. 958.51 s [algebraic-graphs]
  24078. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  24079. 958.51 s [algebraic-graphs] OK: gmap f empty == empty
  24080. 958.51 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24081. 958.51 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24082. 958.51 s [algebraic-graphs] OK: gmap id == id
  24083. 958.51 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24084. 958.51 s [algebraic-graphs]
  24085. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  24086. 958.51 s [algebraic-graphs] OK: induce (const True ) x == x
  24087. 958.51 s [algebraic-graphs] OK: induce (const False) x == empty
  24088. 958.51 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24089. 958.51 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24090. 958.51 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24091. 958.51 s [algebraic-graphs]
  24092. 958.51 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  24093. 958.51 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24094. 958.51 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24095. 958.51 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24096. 958.51 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24097. 958.51 s [algebraic-graphs]
  24098. 958.51 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  24099. 958.51 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  24100. 958.51 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  24101. 958.51 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  24102. 958.51 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  24103. 958.51 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  24104. 958.51 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  24105. 958.51 s [algebraic-graphs]
  24106. 958.51 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  24107. 958.51 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  24108. 958.51 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  24109. 958.51 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  24110. 958.51 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  24111. 958.51 s [algebraic-graphs]
  24112. 958.51 s [algebraic-graphs] ============ Typed ============
  24113. 958.51 s [algebraic-graphs]
  24114. 958.51 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  24115. 958.51 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24116. 958.51 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24117. 958.51 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  24118. 958.51 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24119. 958.51 s [algebraic-graphs]
  24120. 958.51 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  24121. 958.51 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  24122. 958.51 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  24123. 958.51 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  24124. 958.51 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  24125. 958.51 s [algebraic-graphs]
  24126. 958.51 s [algebraic-graphs] ============ Typed.dfsForest ============
  24127. 958.51 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  24128. 958.51 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  24129. 958.51 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  24130. 958.51 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  24131. 958.51 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  24132. 958.51 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  24133. 958.51 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  24134. 958.51 s [algebraic-graphs]
  24135. 958.51 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  24136. 958.51 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  24137. 958.51 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  24138. 958.51 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  24139. 958.51 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  24140. 958.51 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  24141. 958.52 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  24142. 958.52 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  24143. 958.52 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  24144. 958.52 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  24145. 958.52 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  24146. 958.52 s [algebraic-graphs]
  24147. 958.52 s [algebraic-graphs] ============ Typed.dfs ============
  24148. 958.52 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  24149. 958.52 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  24150. 958.52 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  24151. 958.52 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  24152. 958.52 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  24153. 958.52 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  24154. 958.52 s [algebraic-graphs] OK: dfs % x $ [] == []
  24155. 958.52 s [algebraic-graphs]
  24156. 958.52 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  24157. 958.52 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  24158. 958.52 s [algebraic-graphs]
  24159. 958.52 s [algebraic-graphs] ============ Typed.topSort ============
  24160. 958.52 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  24161. 958.52 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  24162. 958.52 s [algebraic-graphs]
  24163. 958.52 s [algebraic-graphs] ============ Graph.Undirected ============
  24164. 958.52 s [algebraic-graphs] OK: Axioms of undirected graphs
  24165. 958.52 s [algebraic-graphs]
  24166. 958.52 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  24167. 958.52 s [algebraic-graphs] OK: show (empty ) == "empty"
  24168. 958.52 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  24169. 958.52 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  24170. 958.52 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  24171. 958.52 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  24172. 958.52 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  24173. 958.52 s [algebraic-graphs]
  24174. 958.52 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  24175. 958.52 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  24176. 958.52 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  24177. 958.52 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  24178. 958.52 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  24179. 958.52 s [algebraic-graphs]
  24180. 958.52 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  24181. 958.52 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  24182. 958.52 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  24183. 958.52 s [algebraic-graphs]
  24184. 958.52 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  24185. 958.52 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  24186. 958.52 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24187. 958.52 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  24188. 958.52 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  24189. 958.52 s [algebraic-graphs]
  24190. 958.52 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  24191. 958.52 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  24192. 958.52 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  24193. 958.52 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  24194. 958.52 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  24195. 958.52 s [algebraic-graphs]
  24196. 958.52 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  24197. 958.52 s [algebraic-graphs] OK: complement empty == empty
  24198. 958.52 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  24199. 958.52 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  24200. 958.52 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  24201. 958.52 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  24202. 958.52 s [algebraic-graphs] OK: complement . complement == id
  24203. 958.52 s [algebraic-graphs]
  24204. 958.52 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  24205. 958.52 s [algebraic-graphs] OK: vertex 1 < vertex 2
  24206. 958.52 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  24207. 958.52 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  24208. 958.52 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  24209. 958.52 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  24210. 958.52 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  24211. 958.52 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  24212. 958.52 s [algebraic-graphs] OK: x <= x + y
  24213. 958.52 s [algebraic-graphs] OK: x + y <= x * y
  24214. 958.52 s [algebraic-graphs]
  24215. 958.52 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  24216. 958.52 s [algebraic-graphs] OK: isEmpty empty == True
  24217. 958.52 s [algebraic-graphs] OK: hasVertex x empty == False
  24218. 958.52 s [algebraic-graphs] OK: vertexCount empty == 0
  24219. 958.52 s [algebraic-graphs] OK: edgeCount empty == 0
  24220. 958.52 s [algebraic-graphs]
  24221. 958.52 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  24222. 958.52 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  24223. 958.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  24224. 958.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  24225. 958.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  24226. 958.52 s [algebraic-graphs]
  24227. 958.52 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  24228. 958.52 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  24229. 958.52 s [algebraic-graphs] OK: edge x y == edge y x
  24230. 968.24 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  24231. 968.24 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  24232. 968.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  24233. 968.44 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  24234. 968.44 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  24235. 968.44 s [algebraic-graphs]
  24236. 968.44 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  24237. 968.44 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  24238. 968.44 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  24239. 968.44 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  24240. 968.44 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  24241. 968.44 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  24242. 968.44 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  24243. 968.44 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  24244. 968.44 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  24245. 968.44 s [algebraic-graphs]
  24246. 968.44 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  24247. 968.44 s [algebraic-graphs] OK: connect x y == connect y x
  24248. 968.44 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  24249. 968.44 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  24250. 968.44 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  24251. 968.44 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  24252. 968.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  24253. 968.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  24254. 968.44 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  24255. 968.44 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  24256. 968.44 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  24257. 968.44 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  24258. 968.44 s [algebraic-graphs]
  24259. 968.44 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  24260. 968.44 s [algebraic-graphs] OK: vertices [] == empty
  24261. 968.44 s [algebraic-graphs] OK: vertices [x] == vertex x
  24262. 968.44 s [algebraic-graphs] OK: vertices == overlays . map vertex
  24263. 968.44 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  24264. 968.44 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  24265. 968.44 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  24266. 968.44 s [algebraic-graphs]
  24267. 968.44 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  24268. 968.44 s [algebraic-graphs] OK: edges [] == empty
  24269. 968.44 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  24270. 968.44 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  24271. 968.44 s [algebraic-graphs]
  24272. 968.44 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  24273. 968.44 s [algebraic-graphs] OK: overlays [] == empty
  24274. 968.44 s [algebraic-graphs] OK: overlays [x] == x
  24275. 968.44 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  24276. 968.44 s [algebraic-graphs] OK: overlays == foldr overlay empty
  24277. 968.44 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  24278. 968.44 s [algebraic-graphs]
  24279. 968.44 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  24280. 968.44 s [algebraic-graphs] OK: connects [] == empty
  24281. 968.44 s [algebraic-graphs] OK: connects [x] == x
  24282. 968.44 s [algebraic-graphs] OK: connects [x,y] == connect x y
  24283. 968.44 s [algebraic-graphs] OK: connects == foldr connect empty
  24284. 968.44 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  24285. 968.44 s [algebraic-graphs] OK: connects == connects . reverse
  24286. 968.44 s [algebraic-graphs]
  24287. 968.44 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  24288. 968.44 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  24289. 968.44 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  24290. 968.44 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  24291. 968.44 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  24292. 968.44 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  24293. 968.44 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  24294. 968.44 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  24295. 968.44 s [algebraic-graphs]
  24296. 968.44 s [algebraic-graphs] ============ Graph.Undirected.path ============
  24297. 968.44 s [algebraic-graphs] OK: path [] == empty
  24298. 968.44 s [algebraic-graphs] OK: path [x] == vertex x
  24299. 968.44 s [algebraic-graphs] OK: path [x,y] == edge x y
  24300. 968.44 s [algebraic-graphs] OK: path == path . reverse
  24301. 968.44 s [algebraic-graphs]
  24302. 968.44 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  24303. 968.44 s [algebraic-graphs] OK: circuit [] == empty
  24304. 968.44 s [algebraic-graphs] OK: circuit [x] == edge x x
  24305. 968.44 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  24306. 968.44 s [algebraic-graphs] OK: circuit == circuit . reverse
  24307. 968.44 s [algebraic-graphs]
  24308. 968.44 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  24309. 968.44 s [algebraic-graphs] OK: clique [] == empty
  24310. 968.44 s [algebraic-graphs] OK: clique [x] == vertex x
  24311. 968.44 s [algebraic-graphs] OK: clique [x,y] == edge x y
  24312. 968.44 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  24313. 968.44 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  24314. 968.44 s [algebraic-graphs] OK: clique == clique . reverse
  24315. 968.44 s [algebraic-graphs]
  24316. 968.44 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  24317. 968.44 s [algebraic-graphs] OK: biclique [] [] == empty
  24318. 968.44 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  24319. 968.44 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  24320. 968.44 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  24321. 968.44 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  24322. 968.44 s [algebraic-graphs]
  24323. 968.44 s [algebraic-graphs] ============ Graph.Undirected.star ============
  24324. 968.44 s [algebraic-graphs] OK: star x [] == vertex x
  24325. 968.44 s [algebraic-graphs] OK: star x [y] == edge x y
  24326. 968.44 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  24327. 968.44 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  24328. 968.44 s [algebraic-graphs]
  24329. 968.44 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  24330. 968.44 s [algebraic-graphs] OK: stars [] == empty
  24331. 968.44 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  24332. 968.44 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  24333. 968.44 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  24334. 968.44 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  24335. 968.44 s [algebraic-graphs] OK: stars . adjacencyList == id
  24336. 968.44 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  24337. 968.44 s [algebraic-graphs]
  24338. 968.44 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  24339. 968.44 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  24340. 968.44 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  24341. 968.44 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  24342. 968.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)]
  24343. 968.44 s [algebraic-graphs]
  24344. 968.44 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  24345. 968.44 s [algebraic-graphs] OK: forest [] == empty
  24346. 968.44 s [algebraic-graphs] OK: forest [x] == tree x
  24347. 968.44 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  24348. 968.44 s [algebraic-graphs] OK: forest == overlays . map tree
  24349. 968.44 s [algebraic-graphs]
  24350. 968.44 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  24351. 968.44 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  24352. 968.44 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  24353. 968.44 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  24354. 968.44 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  24355. 968.44 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  24356. 968.44 s [algebraic-graphs]
  24357. 968.44 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  24358. 968.44 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  24359. 968.44 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  24360. 968.44 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  24361. 968.44 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  24362. 968.44 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  24363. 968.44 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  24364. 968.44 s [algebraic-graphs]
  24365. 968.44 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  24366. 968.44 s [algebraic-graphs] OK: replaceVertex x x == id
  24367. 968.44 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  24368. 968.44 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  24369. 968.44 s [algebraic-graphs]
  24370. 968.44 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  24371. 968.44 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  24372. 968.44 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  24373. 968.44 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  24374. 968.44 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  24375. 968.44 s [algebraic-graphs]
  24376. 968.44 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  24377. 968.44 s [algebraic-graphs] OK: gmap f empty == empty
  24378. 968.44 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  24379. 968.44 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  24380. 968.44 s [algebraic-graphs] OK: gmap id == id
  24381. 968.44 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  24382. 968.44 s [algebraic-graphs]
  24383. 968.44 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  24384. 968.44 s [algebraic-graphs] OK: induce (const True ) x == x
  24385. 968.44 s [algebraic-graphs] OK: induce (const False) x == empty
  24386. 968.44 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  24387. 968.44 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  24388. 968.44 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  24389. 968.44 s [algebraic-graphs]
  24390. 968.44 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  24391. 968.44 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  24392. 968.44 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  24393. 968.44 s [algebraic-graphs] OK: induceJust . gmap Just == id
  24394. 968.44 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  24395. 968.44 s [algebraic-graphs] Test suite main: PASS
  24396. 968.44 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  24397. 968.44 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  24398. 968.44 s [algebraic-graphs] checkPhase completed in 1 minutes 48 seconds
  24399. 968.44 s [algebraic-graphs] Phase: haddockPhase
  24400. 968.44 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  24401. 968.44 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  24402. 968.47 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  24403. 968.80 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  24404. 969.00 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  24405. 969.07 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24406. 969.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24407. 969.07 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24408. 969.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24409. 969.08 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  24410. 969.08 s [algebraic-graphs] Missing documentation for:
  24411. 969.08 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  24412. 969.11 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  24413. 969.11 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24414. 969.12 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  24415. 969.40 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  24416. 969.58 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  24417. 969.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24418. 969.59 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  24419. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24420. 969.59 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  24421. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24422. 969.59 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  24423. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24424. 969.59 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24425. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24426. 969.59 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  24427. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24428. 969.59 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24429. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24430. 969.59 s [algebraic-graphs] Warning: 'box' is out of scope.
  24431. 969.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24432. 969.60 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  24433. 969.60 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24434. 969.60 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  24435. 969.71 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24436. 969.71 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24437. 969.73 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  24438. 970.26 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  24439. 970.26 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24440. 970.27 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  24441. 970.41 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  24442. 970.58 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  24443. 970.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24444. 970.58 s [algebraic-graphs] Warning: 'empty' is out of scope.
  24445. 970.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24446. 970.58 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24447. 970.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24448. 970.58 s [algebraic-graphs] Warning: 'edges' is out of scope.
  24449. 970.58 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24450. 970.59 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  24451. 970.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24452. 970.59 s [algebraic-graphs] Warning: 'stars' is out of scope.
  24453. 970.59 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24454. 970.59 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  24455. 970.68 s [algebraic-graphs] Warning: 'nub' is out of scope.
  24456. 970.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24457. 970.68 s [algebraic-graphs] Warning: 'sort' is out of scope.
  24458. 970.68 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24459. 970.68 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  24460. 970.68 s [algebraic-graphs] Missing documentation for:
  24461. 970.68 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  24462. 970.96 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  24463. 971.04 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  24464. 971.09 s [algebraic-graphs]
  24465. 971.15 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24466. 971.15 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24467. 971.15 s [algebraic-graphs] will become an error in a future GHC release.
  24468. 971.15 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24469. 971.15 s [algebraic-graphs] |
  24470. 971.15 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  24471. 971.15 s [algebraic-graphs] | ^
  24472. 971.15 s [algebraic-graphs]
  24473. 971.15 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24474. 971.15 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24475. 971.15 s [algebraic-graphs] will become an error in a future GHC release.
  24476. 971.15 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24477. 971.15 s [algebraic-graphs] |
  24478. 971.15 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24479. 971.15 s [algebraic-graphs] | ^
  24480. 971.15 s [algebraic-graphs]
  24481. 971.15 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24482. 971.15 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24483. 971.15 s [algebraic-graphs] will become an error in a future GHC release.
  24484. 971.15 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24485. 971.15 s [algebraic-graphs] |
  24486. 971.15 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  24487. 971.15 s [algebraic-graphs] | ^
  24488. 971.15 s [algebraic-graphs]
  24489. 971.15 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24490. 971.15 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24491. 971.15 s [algebraic-graphs] will become an error in a future GHC release.
  24492. 971.15 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24493. 971.15 s [algebraic-graphs] |
  24494. 971.15 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24495. 971.15 s [algebraic-graphs] | ^
  24496. 971.15 s [algebraic-graphs]
  24497. 971.16 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24498. 971.16 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24499. 971.16 s [algebraic-graphs] will become an error in a future GHC release.
  24500. 971.16 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24501. 971.16 s [algebraic-graphs] |
  24502. 971.16 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  24503. 971.16 s [algebraic-graphs] | ^
  24504. 971.16 s [algebraic-graphs]
  24505. 971.16 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24506. 971.16 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24507. 971.16 s [algebraic-graphs] will become an error in a future GHC release.
  24508. 971.16 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24509. 971.16 s [algebraic-graphs] |
  24510. 971.16 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24511. 971.16 s [algebraic-graphs] | ^
  24512. 971.16 s [algebraic-graphs]
  24513. 971.16 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24514. 971.16 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24515. 971.16 s [algebraic-graphs] will become an error in a future GHC release.
  24516. 971.16 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24517. 971.16 s [algebraic-graphs] |
  24518. 971.16 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  24519. 971.16 s [algebraic-graphs] | ^
  24520. 971.21 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  24521. 971.21 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24522. 971.22 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  24523. 971.31 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  24524. 971.41 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  24525. 971.41 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24526. 971.42 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  24527. 971.62 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  24528. 971.80 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  24529. 971.87 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  24530. 971.88 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  24531. 971.90 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  24532. 971.91 s [algebraic-graphs]
  24533. 971.91 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24534. 971.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24535. 971.91 s [algebraic-graphs] will become an error in a future GHC release.
  24536. 971.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24537. 971.91 s [algebraic-graphs] |
  24538. 971.91 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  24539. 971.91 s [algebraic-graphs] | ^
  24540. 971.92 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  24541. 971.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24542. 971.92 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  24543. 971.93 s [algebraic-graphs]
  24544. 971.93 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24545. 971.93 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24546. 971.93 s [algebraic-graphs] will become an error in a future GHC release.
  24547. 971.93 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24548. 971.93 s [algebraic-graphs] |
  24549. 971.93 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  24550. 971.93 s [algebraic-graphs] | ^
  24551. 971.93 s [algebraic-graphs]
  24552. 971.93 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  24553. 971.93 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  24554. 971.93 s [algebraic-graphs] will become an error in a future GHC release.
  24555. 971.93 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  24556. 971.93 s [algebraic-graphs] |
  24557. 971.93 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  24558. 971.93 s [algebraic-graphs] | ^
  24559. 971.97 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  24560. 972.11 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  24561. 972.14 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  24562. 972.14 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24563. 972.14 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  24564. 972.15 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  24565. 972.15 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24566. 972.16 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  24567. 972.17 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  24568. 972.17 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24569. 972.17 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  24570. 972.18 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  24571. 972.18 s [algebraic-graphs] Missing documentation for:
  24572. 972.18 s [algebraic-graphs] Module header
  24573. 972.18 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  24574. 972.18 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:41)
  24575. 972.18 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:22)
  24576. 972.18 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:26)
  24577. 972.18 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:34)
  24578. 972.18 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:38)
  24579. 972.18 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:30)
  24580. 972.19 s [algebraic-graphs] Warning: 'array' is out of scope.
  24581. 972.19 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  24582. 972.20 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  24583. 972.20 s [algebraic-graphs] Missing documentation for:
  24584. 972.20 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:191)
  24585. 976.95 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  24586. 976.95 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  24587. 977.04 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  24588. 977.04 s [algebraic-graphs] Phase: installPhase
  24589. 977.09 s [algebraic-graphs] Installing library in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24590. 977.91 s [algebraic-graphs] Phase: fixupPhase
  24591. 977.93 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24592. 977.94 s [algebraic-graphs] shrinking /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSalgebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE-ghc9.6.7.so
  24593. 977.95 s [algebraic-graphs] checking for references to /build/ in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7...
  24594. 977.99 s [algebraic-graphs] patching script interpreter paths in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24595. 978.00 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/lib
  24596. 978.29 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  24597. 978.31 s [algebraic-graphs] checking for references to /build/ in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc...
  24598. 978.35 s [algebraic-graphs] patching script interpreter paths in /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc
  24599. 978.59 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24600. 979.18 s [algebraic-graphs:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  24601. 979.18 s [algebraic-graphs:post-build]
  24602. 979.54 s [algebraic-graphs:post-build] Pushing /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc (10.39 MiB)
  24603. 979.65 s [algebraic-graphs:post-build] Pushing /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7 (24.32 MiB)
  24604. 981.46 s [algebraic-graphs:post-build]
  24605. 981.46 s [algebraic-graphs:post-build] All done.
  24606. 981.48 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7
  24607. 981.52 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24608. 981.76 s [algebraic-graphs:post-build] copying 2 paths...
  24609. 981.76 s [algebraic-graphs:post-build] copying path '/nix/store/fzswxhazq1h53lb7a661wgwcpps3n75x-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  24610. 983.08 s [algebraic-graphs:post-build] copying path '/nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  24611. 989.30 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24612. 989.55 s [algebraic-graphs:post-build] copying 1 paths...
  24613. 989.58 s [algebraic-graphs:post-build] copying path '/nix/store/5mjvdf48pmvcbc8jll342q9vilpiv5lj-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  24614. 989.78 s Progress: 14 of 19 built, 73 of 73 downloaded from cache
  24615. 989.84 s Building /nix/store/hjisvv3ql6846hgj9ik99qbrqh7z51zw-algebraic-graph-duoids-0.0.1.0.drv
  24616. 990.01 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  24617. 990.10 s [algebraic-graph-duoids] Build with /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7.
  24618. 990.33 s [algebraic-graph-duoids] Phase: unpackPhase
  24619. 990.33 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  24620. 990.34 s [algebraic-graph-duoids] source root is algebraic-graphs
  24621. 990.35 s [algebraic-graph-duoids] Phase: patchPhase
  24622. 990.38 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  24623. 990.39 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.8IDw0XcXjO/setup-package.conf.d -threaded
  24624. 990.44 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.8IDw0XcXjO/Main.o )
  24625. 990.51 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  24626. 991.82 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  24627. 991.83 s [algebraic-graph-duoids] Phase: configurePhase
  24628. 991.84 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.8IDw0XcXjO/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/lib
  24629. 991.85 s [algebraic-graph-duoids] Using Parsec parser
  24630. 991.85 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  24631. 992.17 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  24632. 992.51 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  24633. 992.51 s [algebraic-graph-duoids] algebraic-graphs-0.7
  24634. 992.51 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24635. 992.51 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24636. 992.51 s [algebraic-graph-duoids] <4.23: using base-4.18.3.0
  24637. 992.51 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  24638. 992.51 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24639. 992.51 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24640. 992.51 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  24641. 992.51 s [algebraic-graph-duoids] algebraic-graphs-0.7
  24642. 992.51 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24643. 992.51 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24644. 992.51 s [algebraic-graph-duoids] <4.23: using base-4.18.3.0
  24645. 992.51 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  24646. 992.51 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24647. 992.51 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  24648. 992.51 s [algebraic-graph-duoids] hedgehog-1.5
  24649. 992.51 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  24650. 992.51 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  24651. 992.51 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  24652. 992.51 s [algebraic-graph-duoids] <4.23: using base-4.18.3.0
  24653. 992.51 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  24654. 992.51 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  24655. 992.51 s [algebraic-graph-duoids] doctest-0.24.2
  24656. 992.51 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  24657. 992.51 s [algebraic-graph-duoids] Source component graph:
  24658. 992.51 s [algebraic-graph-duoids] component lib
  24659. 992.51 s [algebraic-graph-duoids] component test:doctests dependency lib
  24660. 992.51 s [algebraic-graph-duoids] component test:laws dependency lib
  24661. 992.51 s [algebraic-graph-duoids] Configured component graph:
  24662. 992.51 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24663. 992.51 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24664. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24665. 992.51 s [algebraic-graph-duoids] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  24666. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24667. 992.51 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-836q6BQ7de51JpogUxLpsp-doctests
  24668. 992.51 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24669. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24670. 992.51 s [algebraic-graph-duoids] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  24671. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24672. 992.51 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-3oelAbmlCIOKzguWsvhbMK-laws
  24673. 992.51 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24674. 992.51 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24675. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24676. 992.51 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  24677. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24678. 992.51 s [algebraic-graph-duoids] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  24679. 992.51 s [algebraic-graph-duoids] Linked component graph:
  24680. 992.51 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24681. 992.51 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24682. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24683. 992.51 s [algebraic-graph-duoids] include duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  24684. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24685. 992.51 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2:Algebra.Graph.Duoid.Orphans
  24686. 992.51 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-836q6BQ7de51JpogUxLpsp-doctests
  24687. 992.51 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24688. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24689. 992.51 s [algebraic-graph-duoids] include doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  24690. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24691. 992.51 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-3oelAbmlCIOKzguWsvhbMK-laws
  24692. 992.51 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24693. 992.51 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24694. 992.51 s [algebraic-graph-duoids] include base-4.18.3.0
  24695. 992.51 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  24696. 992.51 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24697. 992.51 s [algebraic-graph-duoids] include hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  24698. 992.51 s [algebraic-graph-duoids] Ready component graph:
  24699. 992.51 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24700. 992.51 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24701. 992.51 s [algebraic-graph-duoids] depends base-4.18.3.0
  24702. 992.51 s [algebraic-graph-duoids] depends duoids-0.0.1.0-105u05r7TW2MRcOyPjMls
  24703. 992.51 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24704. 992.51 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-836q6BQ7de51JpogUxLpsp-doctests
  24705. 992.51 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24706. 992.51 s [algebraic-graph-duoids] depends base-4.18.3.0
  24707. 992.51 s [algebraic-graph-duoids] depends doctest-0.24.2-7YxPr6lrdwiBMDK2pmizgF
  24708. 992.51 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24709. 992.51 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-3oelAbmlCIOKzguWsvhbMK-laws
  24710. 992.51 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24711. 992.51 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DAzqSe4OEaY2UL8NUkdChE
  24712. 992.51 s [algebraic-graph-duoids] depends base-4.18.3.0
  24713. 992.51 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-DcWZsdLJfX5DhetPN5Zjfn
  24714. 992.51 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-6wKNTt5WLLQByK2Br4PYfC
  24715. 992.51 s [algebraic-graph-duoids] depends hedgehog-1.5-DP7FfOYhHT521r6KmG2jIn
  24716. 992.51 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.6
  24717. 992.51 s [algebraic-graph-duoids] Using compiler: ghc-9.6.7
  24718. 992.51 s [algebraic-graph-duoids] Using install prefix:
  24719. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0
  24720. 992.51 s [algebraic-graph-duoids] Executables installed in:
  24721. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/bin
  24722. 992.51 s [algebraic-graph-duoids] Libraries installed in:
  24723. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24724. 992.51 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  24725. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7
  24726. 992.51 s [algebraic-graph-duoids] Private executables installed in:
  24727. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.6.7/algebraic-graph-duoids-0.0.1.0
  24728. 992.51 s [algebraic-graph-duoids] Data files installed in:
  24729. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.6.7/algebraic-graph-duoids-0.0.1.0
  24730. 992.51 s [algebraic-graph-duoids] Documentation installed in:
  24731. 992.51 s [algebraic-graph-duoids] /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  24732. 992.51 s [algebraic-graph-duoids] Configuration files installed in:
  24733. 992.51 s [algebraic-graph-duoids] /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/etc
  24734. 992.51 s [algebraic-graph-duoids] No alex found
  24735. 992.51 s [algebraic-graph-duoids] Using ar found on system at:
  24736. 992.51 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  24737. 992.51 s [algebraic-graph-duoids] No c2hs found
  24738. 992.51 s [algebraic-graph-duoids] No cpphs found
  24739. 992.51 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  24740. 992.51 s [algebraic-graph-duoids] /nix/store/m3h55v6hp7pfchbn3d61214yzlr937a9-doctest-0.24.2/bin/doctest
  24741. 992.51 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  24742. 992.51 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  24743. 992.51 s [algebraic-graph-duoids] Using ghc version 9.6.7 found on system at:
  24744. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc
  24745. 992.51 s [algebraic-graph-duoids] Using ghc-pkg version 9.6.7 found on system at:
  24746. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/ghc-pkg-9.6.7
  24747. 992.51 s [algebraic-graph-duoids] No ghcjs found
  24748. 992.51 s [algebraic-graph-duoids] No ghcjs-pkg found
  24749. 992.51 s [algebraic-graph-duoids] No greencard found
  24750. 992.51 s [algebraic-graph-duoids] Using haddock version 2.29.2 found on system at:
  24751. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/haddock-ghc-9.6.7
  24752. 992.51 s [algebraic-graph-duoids] No happy found
  24753. 992.51 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  24754. 992.51 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  24755. 992.51 s [algebraic-graph-duoids] No hmake found
  24756. 992.51 s [algebraic-graph-duoids] Using hpc version 0.68 found on system at:
  24757. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hpc-ghc-9.6.7
  24758. 992.51 s [algebraic-graph-duoids] Using hsc2hs version 0.68.9 found on system at:
  24759. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/hsc2hs-ghc-9.6.7
  24760. 992.51 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  24761. 992.51 s [algebraic-graph-duoids] /nix/store/7ffc07q75k5a6zk864jv9gpiphhwzjlh-hscolour-1.25/bin/HsColour
  24762. 992.51 s [algebraic-graph-duoids] No jhc found
  24763. 992.51 s [algebraic-graph-duoids] Using ld found on system at:
  24764. 992.51 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ld.gold
  24765. 992.51 s [algebraic-graph-duoids] No pkg-config found
  24766. 992.51 s [algebraic-graph-duoids] Using runghc version 9.6.7 found on system at:
  24767. 992.51 s [algebraic-graph-duoids] /nix/store/da9x1n5l146q0ai9wz8zfbx4zfwa9b02-ghc-9.6.7/bin/runghc-9.6.7
  24768. 992.51 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  24769. 992.51 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  24770. 992.51 s [algebraic-graph-duoids] Using tar found on system at:
  24771. 992.51 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  24772. 992.51 s [algebraic-graph-duoids] No uhc found
  24773. 992.77 s [algebraic-graph-duoids] Phase: buildPhase
  24774. 992.84 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24775. 992.84 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  24776. 992.97 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  24777. 993.35 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  24778. 994.32 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  24779. 994.77 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  24780. 998.34 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24781. 998.34 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24782. 998.44 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  24783. 998.89 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  24784. 999.48 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  24785. 1002.74 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24786. 1002.74 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24787. 1002.85 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  24788. 1003.70 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  24789. 1004.69 s [algebraic-graph-duoids] Phase: checkPhase
  24790. 1004.94 s [algebraic-graph-duoids] Running 2 test suites...
  24791. 1004.94 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  24792. 1005.48 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  24793. 1005.52 s [algebraic-graph-duoids] NameLib Nothing
  24794. 1005.52 s [algebraic-graph-duoids] ----------------------------------------
  24795. 1005.53 s [algebraic-graph-duoids] Test suite doctests: PASS
  24796. 1005.53 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  24797. 1005.53 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  24798. 1005.54 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  24799. 1005.55 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  24800. 1005.55 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  24801. 1005.55 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  24802. 1005.55 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  24803. 1005.55 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  24804. 1005.55 s [algebraic-graph-duoids] ✓ 5 succeeded.
  24805. 1005.56 s [algebraic-graph-duoids] Test suite laws: PASS
  24806. 1005.56 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  24807. 1005.56 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  24808. 1005.57 s [algebraic-graph-duoids] Phase: haddockPhase
  24809. 1005.72 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  24810. 1005.72 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  24811. 1006.13 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  24812. 1006.43 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  24813. 1013.35 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  24814. 1013.38 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  24815. 1013.40 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  24816. 1013.40 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  24817. 1013.42 s [algebraic-graph-duoids] Phase: installPhase
  24818. 1013.48 s [algebraic-graph-duoids] Installing library in /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/algebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2
  24819. 1013.73 s [algebraic-graph-duoids] Phase: fixupPhase
  24820. 1013.75 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0
  24821. 1013.76 s [algebraic-graph-duoids] shrinking /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.6.7/lib/x86_64-linux-ghc-9.6.7/libHSalgebraic-graph-duoids-0.0.1.0-CzPg39GZm1W22KIQqBc1b2-ghc9.6.7.so
  24822. 1013.76 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0...
  24823. 1013.78 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0
  24824. 1013.78 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/lib
  24825. 1013.82 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc
  24826. 1013.82 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc...
  24827. 1013.84 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc
  24828. 1013.96 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0 /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc
  24829. 1014.43 s [algebraic-graph-duoids:post-build] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  24830. 1014.43 s [algebraic-graph-duoids:post-build]
  24831. 1014.80 s [algebraic-graph-duoids:post-build] Pushing /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc (539.14 KiB)
  24832. 1017.49 s [algebraic-graph-duoids:post-build] Pushing /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0 (1.24 MiB)
  24833. 1018.47 s [algebraic-graph-duoids:post-build]
  24834. 1018.51 s [algebraic-graph-duoids:post-build] All done.
  24835. 1018.51 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0 /nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc
  24836. 1018.54 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24837. 1018.55 s [algebraic-graph-duoids:post-build] copying 2 paths...
  24838. 1018.55 s [algebraic-graph-duoids:post-build] copying path '/nix/store/gb5gpk7kdqxyxhq533351wf78zyw0gj2-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  24839. 1018.95 s [algebraic-graph-duoids:post-build] copying path '/nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  24840. 1019.50 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24841. 1019.76 s [algebraic-graph-duoids:post-build] copying 1 paths...
  24842. 1019.76 s [algebraic-graph-duoids:post-build] copying path '/nix/store/hjisvv3ql6846hgj9ik99qbrqh7z51zw-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  24843. 1020.00 s Progress: 15 of 19 built, 73 of 73 downloaded from cache
  24844. 1020.05 s Building /nix/store/9rr81xr88204gfb38cz7jk453s07av6n-ghc-9.6.7-with-packages.drv
  24845. 1020.10 s [ghc-9.6.7-with-packages] /nix/store/5yvghn5w8irf3zxipgn0sxz3qmq5az3p-duoidal-transformers-0.0.1.0/nix-support:
  24846. 1020.10 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24847. 1020.11 s [ghc-9.6.7-with-packages] /nix/store/jmxi0rvzsngp74i45imqn7rc1f61qyxd-duoids-0.0.1.0/nix-support:
  24848. 1020.11 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24849. 1020.11 s [ghc-9.6.7-with-packages] /nix/store/581q49za01qv2y8s8jvjs6f7sl8frlh0-duoids-hedgehog-0.0.1.0/nix-support:
  24850. 1020.11 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24851. 1020.11 s [ghc-9.6.7-with-packages] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support:
  24852. 1020.11 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24853. 1020.12 s [ghc-9.6.7-with-packages] /nix/store/jnbci5ady6nnlicbwxrr3qdv18gip9p1-algebraic-graphs-0.7/nix-support:
  24854. 1020.12 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24855. 1020.12 s [ghc-9.6.7-with-packages] /nix/store/ws4bxm02xf3qm4nhj7wqa0pmnyap2ly6-ghc-compat-plugin-0.1.0.1/nix-support:
  24856. 1020.12 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24857. 1020.12 s [ghc-9.6.7-with-packages] /nix/store/ws4bxm02xf3qm4nhj7wqa0pmnyap2ly6-ghc-compat-plugin-0.1.0.1/nix-support:
  24858. 1020.12 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24859. 1020.13 s [ghc-9.6.7-with-packages] /nix/store/dy7plzxvi4bj3cj8g64wf3k5vaj5c70a-hedgehog-1.5/nix-support:
  24860. 1020.13 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24861. 1020.13 s [ghc-9.6.7-with-packages] /nix/store/dy7plzxvi4bj3cj8g64wf3k5vaj5c70a-hedgehog-1.5/nix-support:
  24862. 1020.13 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24863. 1020.13 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  24864. 1020.13 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24865. 1020.13 s [ghc-9.6.7-with-packages] /nix/store/fcbs80997frlprcgnfz1pgqzwx17bdfj-ansi-terminal-1.1.3/nix-support:
  24866. 1020.13 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24867. 1020.14 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  24868. 1020.14 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24869. 1020.14 s [ghc-9.6.7-with-packages] /nix/store/jjabyw5gl9cvdkdwfmgvllmj76cd5xx2-async-2.2.5/nix-support:
  24870. 1020.14 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24871. 1020.14 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  24872. 1020.14 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24873. 1020.14 s [ghc-9.6.7-with-packages] /nix/store/1rnj3abisldb1ysvfg7jx4xq63kvnh9f-barbies-2.1.1.0/nix-support:
  24874. 1020.14 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24875. 1020.15 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  24876. 1020.15 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24877. 1020.15 s [ghc-9.6.7-with-packages] /nix/store/ygwfbz0mwnsj9r4vy9zhqnhn5baqlwz7-concurrent-output-1.10.21/nix-support:
  24878. 1020.15 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24879. 1020.15 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  24880. 1020.15 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24881. 1020.15 s [ghc-9.6.7-with-packages] /nix/store/76z6kzz2xf8gljhm76swxb542xp0lqkz-lifted-async-0.10.2.7/nix-support:
  24882. 1020.15 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24883. 1020.16 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  24884. 1020.16 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24885. 1020.16 s [ghc-9.6.7-with-packages] /nix/store/iasz4h3zl5q9kgrf288g9fak6g03s54x-mmorph-1.2.1/nix-support:
  24886. 1020.16 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24887. 1020.16 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  24888. 1020.16 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24889. 1020.16 s [ghc-9.6.7-with-packages] /nix/store/9h348vl6yhan64ibbcabyjx2fmxs7d3b-monad-control-1.0.3.1/nix-support:
  24890. 1020.16 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24891. 1020.16 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  24892. 1020.16 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24893. 1020.17 s [ghc-9.6.7-with-packages] /nix/store/wdxmylyqc8p4j414kk3ymndp5i2yqjm3-pretty-show-1.10/nix-support:
  24894. 1020.17 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24895. 1020.17 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  24896. 1020.17 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24897. 1020.17 s [ghc-9.6.7-with-packages] /nix/store/k1gharvwzs4drk9axklr4dcizqkqnia7-primitive-0.9.1.0/nix-support:
  24898. 1020.17 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24899. 1020.17 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  24900. 1020.17 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24901. 1020.17 s [ghc-9.6.7-with-packages] /nix/store/nnj36snlh7c273pijflsjp18z8z6bv71-random-1.2.1.3/nix-support:
  24902. 1020.17 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24903. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  24904. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24905. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/hgb60y6pgscn0xg3sa2j4llfykqikdcb-resourcet-1.3.0/nix-support:
  24906. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24907. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  24908. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24909. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/gni425lh8g2a5k2iy04gza6hxwivikyp-safe-exceptions-0.1.7.4/nix-support:
  24910. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24911. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  24912. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24913. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/iq5g0dfwam9zz3v08lgvcvvvgwhsbv0x-transformers-base-0.4.6/nix-support:
  24914. 1020.18 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24915. 1020.18 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  24916. 1020.19 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24917. 1020.19 s [ghc-9.6.7-with-packages] /nix/store/w5r1n1grfq99nsaqjfsi3qspcxikk9hl-wl-pprint-annotated-0.1.0.1/nix-support:
  24918. 1020.19 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24919. 1020.19 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  24920. 1020.19 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24921. 1020.19 s [ghc-9.6.7-with-packages] /nix/store/i1773scyxkqyblf6vpzp8rwlnivkfggx-ansi-terminal-types-1.1.3/nix-support:
  24922. 1020.19 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24923. 1020.20 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  24924. 1020.20 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24925. 1020.20 s [ghc-9.6.7-with-packages] /nix/store/6pimarw92xx2gdc004l52j33pgfnk5q3-hashable-1.5.0.0/nix-support:
  24926. 1020.20 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24927. 1020.20 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  24928. 1020.20 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24929. 1020.20 s [ghc-9.6.7-with-packages] /nix/store/r45rn7pmhwhm2a2arlc59m6q0ayf3x7k-distributive-0.6.2.1/nix-support:
  24930. 1020.20 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24931. 1020.21 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  24932. 1020.21 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24933. 1020.21 s [ghc-9.6.7-with-packages] /nix/store/g35hdx8r4gl48g5p5a7716hzmiacl823-constraints-0.14.2/nix-support:
  24934. 1020.21 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24935. 1020.21 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  24936. 1020.21 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24937. 1020.22 s [ghc-9.6.7-with-packages] /nix/store/0yc01qnfkqq6ncifsd27ap4dvplafl0w-lifted-base-0.2.3.12/nix-support:
  24938. 1020.22 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24939. 1020.22 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  24940. 1020.22 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24941. 1020.22 s [ghc-9.6.7-with-packages] /nix/store/x61ml6alhwgm163idq8ykgn021gn0lf6-transformers-compat-0.7.2/nix-support:
  24942. 1020.22 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24943. 1020.22 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  24944. 1020.22 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24945. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/zyhsf74vsbisnk8nxg7immascxvrgzrx-splitmix-0.1.3.1/nix-support:
  24946. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24947. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  24948. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24949. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/qq625vh42zngn5an1w1fipnj2h9yfxb6-unliftio-core-0.2.1.0/nix-support:
  24950. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24951. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  24952. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24953. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/hf7mjbw39mc2s31v9s0gvq0irxrj3ljz-base-orphans-0.9.3/nix-support:
  24954. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24955. 1020.23 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  24956. 1020.23 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24957. 1020.24 s [ghc-9.6.7-with-packages] /nix/store/8qkh2vgcsvil9pkzial83q66cc6csf0h-os-string-2.0.8/nix-support:
  24958. 1020.24 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24959. 1020.24 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  24960. 1020.24 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24961. 1020.24 s [ghc-9.6.7-with-packages] /nix/store/74c3l72p3ahsbcdqzxpmicwp8cyhqj1d-tagged-0.8.9/nix-support:
  24962. 1020.24 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24963. 1020.24 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  24964. 1020.24 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24965. 1020.24 s [ghc-9.6.7-with-packages] /nix/store/fam1g9nds2cbk2b6xp4jv742dm7kkjkp-boring-0.2.2/nix-support:
  24966. 1020.24 s [ghc-9.6.7-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/4ppjzklhmzkj9gl2nz7a6x1gb5x2sswf-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  24967. 1020.91 s [ghc-9.6.7-with-packages] Warning: include-dirs: /nix/store/c2qyn7kf4x0rdav69mfw05gyvn9p8lgr-ghc-9.6.7-with-packages/lib/ghc-9.6.7/lib/../lib/x86_64-linux-ghc-9.6.7/directory-1.3.8.5/include doesn't exist or isn't a directory
  24968. 1021.88 s [ghc-9.6.7-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/c2qyn7kf4x0rdav69mfw05gyvn9p8lgr-ghc-9.6.7-with-packages
  24969. 1022.36 s [ghc-9.6.7-with-packages:post-build] Pushing 1 paths (146 are already present) using zstd to cache sellout ⏳
  24970. 1022.36 s [ghc-9.6.7-with-packages:post-build]
  24971. 1022.73 s [ghc-9.6.7-with-packages:post-build] Pushing /nix/store/c2qyn7kf4x0rdav69mfw05gyvn9p8lgr-ghc-9.6.7-with-packages (4.26 MiB)
  24972. 1024.32 s [ghc-9.6.7-with-packages:post-build]
  24973. 1024.40 s [ghc-9.6.7-with-packages:post-build] All done.
  24974. 1024.40 s [ghc-9.6.7-with-packages:post-build] Uploading to the NixCI cache: /nix/store/c2qyn7kf4x0rdav69mfw05gyvn9p8lgr-ghc-9.6.7-with-packages
  24975. 1024.40 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24976. 1024.60 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  24977. 1024.60 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/c2qyn7kf4x0rdav69mfw05gyvn9p8lgr-ghc-9.6.7-with-packages' to 'https://cache.nix-ci.com'...
  24978. 1025.72 s [ghc-9.6.7-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24979. 1025.98 s [ghc-9.6.7-with-packages:post-build] copying 1 paths...
  24980. 1025.98 s [ghc-9.6.7-with-packages:post-build] copying path '/nix/store/9rr81xr88204gfb38cz7jk453s07av6n-ghc-9.6.7-with-packages.drv' to 'https://cache.nix-ci.com'...
  24981. 1026.22 s Progress: 16 of 18 built, 73 of 73 downloaded from cache
  24982. 1026.27 s Building /nix/store/5nbxbbl490m1g7bd0m36lkbhrnpn4l41-all-packages.drv
  24983. 1026.33 s [all-packages] created 3 symlinks in user environment
  24984. 1026.36 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/ls2yckzgikhzf5v1qcjxi3r07b0fzgl0-all-packages
  24985. 1026.89 s [all-packages:post-build] Pushing 1 paths (147 are already present) using zstd to cache sellout ⏳
  24986. 1026.89 s [all-packages:post-build]
  24987. 1027.25 s [all-packages:post-build] Pushing /nix/store/ls2yckzgikhzf5v1qcjxi3r07b0fzgl0-all-packages (872.00 B)
  24988. 1028.23 s [all-packages:post-build]
  24989. 1028.23 s [all-packages:post-build] All done.
  24990. 1028.25 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/ls2yckzgikhzf5v1qcjxi3r07b0fzgl0-all-packages
  24991. 1028.29 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24992. 1028.74 s [all-packages:post-build] copying 1 paths...
  24993. 1028.74 s [all-packages:post-build] copying path '/nix/store/ls2yckzgikhzf5v1qcjxi3r07b0fzgl0-all-packages' to 'https://cache.nix-ci.com'...
  24994. 1029.00 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  24995. 1029.24 s [all-packages:post-build] copying 1 paths...
  24996. 1029.24 s [all-packages:post-build] copying path '/nix/store/5nbxbbl490m1g7bd0m36lkbhrnpn4l41-all-packages.drv' to 'https://cache.nix-ci.com'...
  24997. 1029.47 s Progress: 17 of 18 built, 73 of 73 downloaded from cache
  24998. 1029.47 s Progress: 18 of 18 built, 73 of 73 downloaded from cache
  24999. 1029.47 s /nix/store/ls2yckzgikhzf5v1qcjxi3r07b0fzgl0-all-packages
  25000. 1029.52 s Build succeeded.
Tail Raw Logs