Tue Oct 21 07:52:25 UTC 2025 I: starting to build diamond-aligner/forky/arm64 on jenkins on '2025-10-21 07:52' Tue Oct 21 07:52:25 UTC 2025 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/arm64_5/124947/console.log Tue Oct 21 07:52:25 UTC 2025 I: Downloading source for forky/diamond-aligner=2.1.14-1 --2025-10-21 07:52:25-- http://deb.debian.org/debian/pool/main/d/diamond-aligner/diamond-aligner_2.1.14-1.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2237 (2.2K) [text/prs.lines.tag] Saving to: ‘diamond-aligner_2.1.14-1.dsc’ 0K .. 100% 259M=0s 2025-10-21 07:52:25 (259 MB/s) - ‘diamond-aligner_2.1.14-1.dsc’ saved [2237/2237] Tue Oct 21 07:52:25 UTC 2025 I: diamond-aligner_2.1.14-1.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA512 Format: 3.0 (quilt) Source: diamond-aligner Binary: diamond-aligner Architecture: any-amd64 arm64 ppc64el s390x ia64 ppc64 riscv64 sparc64 loong64 Version: 2.1.14-1 Maintainer: Debian Med Packaging Team Uploaders: Andreas Tille , Étienne Mollier , Homepage: https://github.com/bbuchfink/diamond Standards-Version: 4.7.2 Vcs-Browser: https://salsa.debian.org/med-team/diamond-aligner Vcs-Git: https://salsa.debian.org/med-team/diamond-aligner.git Testsuite: autopkgtest Build-Depends: debhelper-compat (= 13), cmake, zlib1g-dev Package-List: diamond-aligner deb science optional arch=any-amd64,arm64,ppc64el,s390x,ia64,ppc64,riscv64,sparc64,loong64 Checksums-Sha1: 90f78701e05f579d516e1d0b12fafd3c9fc64290 1752971 diamond-aligner_2.1.14.orig.tar.gz a51d0374c81ae6969fb2543ec546d6f45de250d3 137012 diamond-aligner_2.1.14-1.debian.tar.xz Checksums-Sha256: 46ad0ded90128d55efc10641d60fa40eeb423a9a0bffd9f5997a7b72e056b011 1752971 diamond-aligner_2.1.14.orig.tar.gz 22b439d0d1bb276c17d56fe419ab6d71f3cfcec7d71951465bc46b2d1889a8fe 137012 diamond-aligner_2.1.14-1.debian.tar.xz Files: 768080b6691f89c8f836ec2dfeeab199 1752971 diamond-aligner_2.1.14.orig.tar.gz f33b4b8712988ac90d6a5fe0c6a8110c 137012 diamond-aligner_2.1.14-1.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQJFBAEBCgAvFiEE8fAHMgoDVUHwpmPKV4oElNHGRtEFAmjyEckRHHRpbGxlQGRl Ymlhbi5vcmcACgkQV4oElNHGRtHB2Q/+JLhKMYU6UXp45SthVuBBGxy3dhrRQ+VO I5iv0hbcMnPjkoXEZqFXrVK22SMMOIwNZr3hpHySLlDlMlPdWR9P/a5HlRfsYe65 8pJA/BAiuEVO2zRQFZp+Bo0Sx7ury8/TOm3USxGg4Fo22XbOawd/yktA3DeoPGrV qk2tJMpZGN2n4gvHqLuX8uJQd1ueulyutsaTuiWfkUTjAGitdI13PWcXVEpMQjKd hU3NhFfmqLgr9DXo/Wzn3+/Er/BDn7rLbZjEoWJYh7zt/esJuVhDQXz4GB7Qgkfj 8cUBX/QVIVlmyBZoNMo6fvx1eufB37DdrcjapFFgaEJ7LvZ4H9+1ihSI8rYEbkg7 GZRvep3jlCQVv+Yh7wZIDkia4O8M+Xd/OWUhcKkX41+Es0aFBGt1U7wg1xJVDY3R djL0ED85uaZZ5Ra+FZRmLbG6oqcArX93ssRZ+hYcpPyUqzBYNbs7ap9I8YL1jsdJ C+wQhLENv6hQEKyfkHbu76UCxRIKDJDE2bTjxqHm3pMg66JYh7orfbEGqb+M55e5 D3DknyDVqwgs9lBG6bHLQri6iCS7yE6p24erDW7ysX1Kx6pY4TnmCOYozXJD3MJz VhIjO4kkzSnMxh87LiBg43DrMza6a+nznSSzRKKVLB0uWOQjaN9YyIm3mLNuZ2a+ UV4ZXkCyXUM= =bmum -----END PGP SIGNATURE----- Tue Oct 21 07:52:25 UTC 2025 I: Checking whether the package is not for us Tue Oct 21 07:52:25 UTC 2025 I: Starting 1st build on remote node codethink03-arm64.debian.net. Tue Oct 21 07:52:25 UTC 2025 I: Preparing to do remote build '1' on codethink03-arm64.debian.net. Tue Oct 21 08:03:18 UTC 2025 I: Deleting $TMPDIR on codethink03-arm64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Mon Nov 23 02:15:26 -12 2026 I: pbuilder-time-stamp: 1795443326 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/forky-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [diamond-aligner_2.1.14-1.dsc] I: copying [./diamond-aligner_2.1.14.orig.tar.gz] I: copying [./diamond-aligner_2.1.14-1.debian.tar.xz] I: Extracting source dpkg-source: warning: cannot verify inline signature for ./diamond-aligner_2.1.14-1.dsc: no acceptable signature found dpkg-source: info: extracting diamond-aligner in diamond-aligner-2.1.14 dpkg-source: info: unpacking diamond-aligner_2.1.14.orig.tar.gz dpkg-source: info: unpacking diamond-aligner_2.1.14-1.debian.tar.xz I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/1073135/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='arm64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DISTRIBUTION='forky' HOME='/root' HOST_ARCH='arm64' IFS=' ' INVOCATION_ID='c041ca6d7f744495b8d61e00525e2a01' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='1073135' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/pbuilderrc_cR2C --distribution forky --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/forky-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/b1 --logfile b1/build.log diamond-aligner_2.1.14-1.dsc' SUDO_GID='109' SUDO_HOME='/var/lib/jenkins' SUDO_UID='104' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://192.168.101.4:3128' I: uname -a Linux codethink03-arm64 6.12.48+deb13-cloud-arm64 #1 SMP Debian 6.12.48-1 (2025-09-20) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 10 2025 /bin -> usr/bin I: user script /srv/workspace/pbuilder/1073135/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: arm64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), cmake, zlib1g-dev dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 20000 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on cmake; however: Package cmake is not installed. pbuilder-satisfydepends-dummy depends on zlib1g-dev; however: Package zlib1g-dev is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} cmake{a} cmake-data{a} debhelper{a} dh-autoreconf{a} dh-strip-nondeterminism{a} dwz{a} file{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libarchive13t64{a} libbrotli1{a} libcom-err2{a} libcurl4t64{a} libdebhelper-perl{a} libelf1t64{a} libexpat1{a} libffi8{a} libfile-stripnondeterminism-perl{a} libgnutls30t64{a} libgssapi-krb5-2{a} libidn2-0{a} libjsoncpp26{a} libk5crypto3{a} libkeyutils1{a} libkrb5-3{a} libkrb5support0{a} libldap2{a} libmagic-mgc{a} libmagic1t64{a} libnghttp2-14{a} libnghttp3-9{a} libngtcp2-16{a} libngtcp2-crypto-ossl0{a} libp11-kit0{a} libpipeline1{a} libproc2-0{a} libpsl5t64{a} librhash1{a} librtmp1{a} libsasl2-2{a} libsasl2-modules-db{a} libssh2-1t64{a} libtasn1-6{a} libtool{a} libuchardet0{a} libunistring5{a} libuv1t64{a} libxml2-16{a} m4{a} man-db{a} po-debconf{a} procps{a} sensible-utils{a} zlib1g-dev{a} The following packages are RECOMMENDED but will NOT be installed: ca-certificates curl krb5-locales libarchive-cpio-perl libldap-common libltdl-dev libmail-sendmail-perl libsasl2-modules linux-sysctl-defaults lynx psmisc publicsuffix wget 0 packages upgraded, 62 newly installed, 0 to remove and 0 not upgraded. Need to get 30.1 MB of archives. After unpacking 114 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian forky/main arm64 libexpat1 arm64 2.7.3-1 [96.5 kB] Get: 2 http://deb.debian.org/debian forky/main arm64 libproc2-0 arm64 2:4.0.4-9 [62.8 kB] Get: 3 http://deb.debian.org/debian forky/main arm64 procps arm64 2:4.0.4-9 [871 kB] Get: 4 http://deb.debian.org/debian forky/main arm64 sensible-utils all 0.0.26 [27.0 kB] Get: 5 http://deb.debian.org/debian forky/main arm64 libmagic-mgc arm64 1:5.46-5 [338 kB] Get: 6 http://deb.debian.org/debian forky/main arm64 libmagic1t64 arm64 1:5.46-5 [103 kB] Get: 7 http://deb.debian.org/debian forky/main arm64 file arm64 1:5.46-5 [43.7 kB] Get: 8 http://deb.debian.org/debian forky/main arm64 gettext-base arm64 0.23.1-2+b1 [241 kB] Get: 9 http://deb.debian.org/debian forky/main arm64 libuchardet0 arm64 0.0.8-2 [69.0 kB] Get: 10 http://deb.debian.org/debian forky/main arm64 groff-base arm64 1.23.0-9 [1130 kB] Get: 11 http://deb.debian.org/debian forky/main arm64 bsdextrautils arm64 2.41.2-1 [94.3 kB] Get: 12 http://deb.debian.org/debian forky/main arm64 libpipeline1 arm64 1.5.8-1 [40.2 kB] Get: 13 http://deb.debian.org/debian forky/main arm64 man-db arm64 2.13.1-1 [1453 kB] Get: 14 http://deb.debian.org/debian forky/main arm64 m4 arm64 1.4.20-2 [315 kB] Get: 15 http://deb.debian.org/debian forky/main arm64 autoconf all 2.72-3.1 [494 kB] Get: 16 http://deb.debian.org/debian forky/main arm64 autotools-dev all 20240727.1 [60.2 kB] Get: 17 http://deb.debian.org/debian forky/main arm64 automake all 1:1.17-4 [862 kB] Get: 18 http://deb.debian.org/debian forky/main arm64 autopoint all 0.23.1-2 [770 kB] Get: 19 http://deb.debian.org/debian forky/main arm64 cmake-data all 4.1.1+really3.31.6-2 [2268 kB] Get: 20 http://deb.debian.org/debian forky/main arm64 libxml2-16 arm64 2.14.6+dfsg-0.1 [601 kB] Get: 21 http://deb.debian.org/debian forky/main arm64 libarchive13t64 arm64 3.7.4-4+b1 [323 kB] Get: 22 http://deb.debian.org/debian forky/main arm64 libnghttp3-9 arm64 1.12.0-1 [63.6 kB] Get: 23 http://deb.debian.org/debian forky/main arm64 libngtcp2-16 arm64 1.16.0-1 [123 kB] Get: 24 http://deb.debian.org/debian forky/main arm64 libbrotli1 arm64 1.1.0-2+b7 [308 kB] Get: 25 http://deb.debian.org/debian forky/main arm64 libkrb5support0 arm64 1.21.3-5 [32.4 kB] Get: 26 http://deb.debian.org/debian forky/main arm64 libcom-err2 arm64 1.47.2-3+b3 [24.9 kB] Get: 27 http://deb.debian.org/debian forky/main arm64 libk5crypto3 arm64 1.21.3-5 [81.2 kB] Get: 28 http://deb.debian.org/debian forky/main arm64 libkeyutils1 arm64 1.6.3-6 [9716 B] Get: 29 http://deb.debian.org/debian forky/main arm64 libkrb5-3 arm64 1.21.3-5 [308 kB] Get: 30 http://deb.debian.org/debian forky/main arm64 libgssapi-krb5-2 arm64 1.21.3-5 [127 kB] Get: 31 http://deb.debian.org/debian forky/main arm64 libunistring5 arm64 1.3-2 [453 kB] Get: 32 http://deb.debian.org/debian forky/main arm64 libidn2-0 arm64 2.3.8-4 [108 kB] Get: 33 http://deb.debian.org/debian forky/main arm64 libsasl2-modules-db arm64 2.1.28+dfsg1-10 [19.8 kB] Get: 34 http://deb.debian.org/debian forky/main arm64 libsasl2-2 arm64 2.1.28+dfsg1-10 [55.0 kB] Get: 35 http://deb.debian.org/debian forky/main arm64 libldap2 arm64 2.6.10+dfsg-1 [179 kB] Get: 36 http://deb.debian.org/debian forky/main arm64 libnghttp2-14 arm64 1.64.0-1.1+b1 [71.7 kB] Get: 37 http://deb.debian.org/debian forky/main arm64 libngtcp2-crypto-ossl0 arm64 1.16.0-1 [25.7 kB] Get: 38 http://deb.debian.org/debian forky/main arm64 libpsl5t64 arm64 0.21.2-1.1+b1 [57.1 kB] Get: 39 http://deb.debian.org/debian forky/main arm64 libffi8 arm64 3.5.2-2 [21.5 kB] Get: 40 http://deb.debian.org/debian forky/main arm64 libp11-kit0 arm64 0.25.9-2 [420 kB] Get: 41 http://deb.debian.org/debian forky/main arm64 libtasn1-6 arm64 4.20.0-2 [47.3 kB] Get: 42 http://deb.debian.org/debian forky/main arm64 libgnutls30t64 arm64 3.8.10-2 [1395 kB] Get: 43 http://deb.debian.org/debian forky/main arm64 librtmp1 arm64 2.4+20151223.gitfa8646d.1-3 [56.3 kB] Get: 44 http://deb.debian.org/debian forky/main arm64 libssh2-1t64 arm64 1.11.1-1 [235 kB] Get: 45 http://deb.debian.org/debian forky/main arm64 libcurl4t64 arm64 8.16.0-4 [368 kB] Get: 46 http://deb.debian.org/debian forky/main arm64 libjsoncpp26 arm64 1.9.6-4 [73.2 kB] Get: 47 http://deb.debian.org/debian forky/main arm64 librhash1 arm64 1.4.6-1 [131 kB] Get: 48 http://deb.debian.org/debian forky/main arm64 libuv1t64 arm64 1.51.0-2 [150 kB] Get: 49 http://deb.debian.org/debian forky/main arm64 cmake arm64 4.1.1+really3.31.6-2 [10.1 MB] Get: 50 http://deb.debian.org/debian forky/main arm64 libdebhelper-perl all 13.28 [92.4 kB] Get: 51 http://deb.debian.org/debian forky/main arm64 libtool all 2.5.4-5 [540 kB] Get: 52 http://deb.debian.org/debian forky/main arm64 dh-autoreconf all 21 [12.2 kB] Get: 53 http://deb.debian.org/debian forky/main arm64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 54 http://deb.debian.org/debian forky/main arm64 libfile-stripnondeterminism-perl all 1.15.0-1 [19.9 kB] Get: 55 http://deb.debian.org/debian forky/main arm64 dh-strip-nondeterminism all 1.15.0-1 [8812 B] Get: 56 http://deb.debian.org/debian forky/main arm64 libelf1t64 arm64 0.193-3 [189 kB] Get: 57 http://deb.debian.org/debian forky/main arm64 dwz arm64 0.16-2 [100 kB] Get: 58 http://deb.debian.org/debian forky/main arm64 gettext arm64 0.23.1-2+b1 [1612 kB] Get: 59 http://deb.debian.org/debian forky/main arm64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 60 http://deb.debian.org/debian forky/main arm64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 61 http://deb.debian.org/debian forky/main arm64 debhelper all 13.28 [941 kB] Get: 62 http://deb.debian.org/debian forky/main arm64 zlib1g-dev arm64 1:1.3.dfsg+really1.3.1-1+b1 [917 kB] Fetched 30.1 MB in 0s (190 MB/s) Preconfiguring packages ... Selecting previously unselected package libexpat1:arm64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 20000 files and directories currently installed.) Preparing to unpack .../00-libexpat1_2.7.3-1_arm64.deb ... Unpacking libexpat1:arm64 (2.7.3-1) ... Selecting previously unselected package libproc2-0:arm64. Preparing to unpack .../01-libproc2-0_2%3a4.0.4-9_arm64.deb ... Unpacking libproc2-0:arm64 (2:4.0.4-9) ... Selecting previously unselected package procps. Preparing to unpack .../02-procps_2%3a4.0.4-9_arm64.deb ... Unpacking procps (2:4.0.4-9) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../03-sensible-utils_0.0.26_all.deb ... Unpacking sensible-utils (0.0.26) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../04-libmagic-mgc_1%3a5.46-5_arm64.deb ... Unpacking libmagic-mgc (1:5.46-5) ... Selecting previously unselected package libmagic1t64:arm64. Preparing to unpack .../05-libmagic1t64_1%3a5.46-5_arm64.deb ... Unpacking libmagic1t64:arm64 (1:5.46-5) ... Selecting previously unselected package file. Preparing to unpack .../06-file_1%3a5.46-5_arm64.deb ... Unpacking file (1:5.46-5) ... Selecting previously unselected package gettext-base. Preparing to unpack .../07-gettext-base_0.23.1-2+b1_arm64.deb ... Unpacking gettext-base (0.23.1-2+b1) ... Selecting previously unselected package libuchardet0:arm64. Preparing to unpack .../08-libuchardet0_0.0.8-2_arm64.deb ... Unpacking libuchardet0:arm64 (0.0.8-2) ... Selecting previously unselected package groff-base. Preparing to unpack .../09-groff-base_1.23.0-9_arm64.deb ... Unpacking groff-base (1.23.0-9) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../10-bsdextrautils_2.41.2-1_arm64.deb ... Unpacking bsdextrautils (2.41.2-1) ... Selecting previously unselected package libpipeline1:arm64. Preparing to unpack .../11-libpipeline1_1.5.8-1_arm64.deb ... Unpacking libpipeline1:arm64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.13.1-1_arm64.deb ... Unpacking man-db (2.13.1-1) ... Selecting previously unselected package m4. Preparing to unpack .../13-m4_1.4.20-2_arm64.deb ... Unpacking m4 (1.4.20-2) ... Selecting previously unselected package autoconf. Preparing to unpack .../14-autoconf_2.72-3.1_all.deb ... Unpacking autoconf (2.72-3.1) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../15-autotools-dev_20240727.1_all.deb ... Unpacking autotools-dev (20240727.1) ... Selecting previously unselected package automake. Preparing to unpack .../16-automake_1%3a1.17-4_all.deb ... Unpacking automake (1:1.17-4) ... Selecting previously unselected package autopoint. Preparing to unpack .../17-autopoint_0.23.1-2_all.deb ... Unpacking autopoint (0.23.1-2) ... Selecting previously unselected package cmake-data. Preparing to unpack .../18-cmake-data_4.1.1+really3.31.6-2_all.deb ... Unpacking cmake-data (4.1.1+really3.31.6-2) ... Selecting previously unselected package libxml2-16:arm64. Preparing to unpack .../19-libxml2-16_2.14.6+dfsg-0.1_arm64.deb ... Unpacking libxml2-16:arm64 (2.14.6+dfsg-0.1) ... Selecting previously unselected package libarchive13t64:arm64. Preparing to unpack .../20-libarchive13t64_3.7.4-4+b1_arm64.deb ... Unpacking libarchive13t64:arm64 (3.7.4-4+b1) ... Selecting previously unselected package libnghttp3-9:arm64. Preparing to unpack .../21-libnghttp3-9_1.12.0-1_arm64.deb ... Unpacking libnghttp3-9:arm64 (1.12.0-1) ... Selecting previously unselected package libngtcp2-16:arm64. Preparing to unpack .../22-libngtcp2-16_1.16.0-1_arm64.deb ... Unpacking libngtcp2-16:arm64 (1.16.0-1) ... Selecting previously unselected package libbrotli1:arm64. Preparing to unpack .../23-libbrotli1_1.1.0-2+b7_arm64.deb ... Unpacking libbrotli1:arm64 (1.1.0-2+b7) ... Selecting previously unselected package libkrb5support0:arm64. Preparing to unpack .../24-libkrb5support0_1.21.3-5_arm64.deb ... Unpacking libkrb5support0:arm64 (1.21.3-5) ... Selecting previously unselected package libcom-err2:arm64. Preparing to unpack .../25-libcom-err2_1.47.2-3+b3_arm64.deb ... Unpacking libcom-err2:arm64 (1.47.2-3+b3) ... Selecting previously unselected package libk5crypto3:arm64. Preparing to unpack .../26-libk5crypto3_1.21.3-5_arm64.deb ... Unpacking libk5crypto3:arm64 (1.21.3-5) ... Selecting previously unselected package libkeyutils1:arm64. Preparing to unpack .../27-libkeyutils1_1.6.3-6_arm64.deb ... Unpacking libkeyutils1:arm64 (1.6.3-6) ... Selecting previously unselected package libkrb5-3:arm64. Preparing to unpack .../28-libkrb5-3_1.21.3-5_arm64.deb ... Unpacking libkrb5-3:arm64 (1.21.3-5) ... Selecting previously unselected package libgssapi-krb5-2:arm64. Preparing to unpack .../29-libgssapi-krb5-2_1.21.3-5_arm64.deb ... Unpacking libgssapi-krb5-2:arm64 (1.21.3-5) ... Selecting previously unselected package libunistring5:arm64. Preparing to unpack .../30-libunistring5_1.3-2_arm64.deb ... Unpacking libunistring5:arm64 (1.3-2) ... Selecting previously unselected package libidn2-0:arm64. Preparing to unpack .../31-libidn2-0_2.3.8-4_arm64.deb ... Unpacking libidn2-0:arm64 (2.3.8-4) ... Selecting previously unselected package libsasl2-modules-db:arm64. Preparing to unpack .../32-libsasl2-modules-db_2.1.28+dfsg1-10_arm64.deb ... Unpacking libsasl2-modules-db:arm64 (2.1.28+dfsg1-10) ... Selecting previously unselected package libsasl2-2:arm64. Preparing to unpack .../33-libsasl2-2_2.1.28+dfsg1-10_arm64.deb ... Unpacking libsasl2-2:arm64 (2.1.28+dfsg1-10) ... Selecting previously unselected package libldap2:arm64. Preparing to unpack .../34-libldap2_2.6.10+dfsg-1_arm64.deb ... Unpacking libldap2:arm64 (2.6.10+dfsg-1) ... Selecting previously unselected package libnghttp2-14:arm64. Preparing to unpack .../35-libnghttp2-14_1.64.0-1.1+b1_arm64.deb ... Unpacking libnghttp2-14:arm64 (1.64.0-1.1+b1) ... Selecting previously unselected package libngtcp2-crypto-ossl0:arm64. Preparing to unpack .../36-libngtcp2-crypto-ossl0_1.16.0-1_arm64.deb ... Unpacking libngtcp2-crypto-ossl0:arm64 (1.16.0-1) ... Selecting previously unselected package libpsl5t64:arm64. Preparing to unpack .../37-libpsl5t64_0.21.2-1.1+b1_arm64.deb ... Unpacking libpsl5t64:arm64 (0.21.2-1.1+b1) ... Selecting previously unselected package libffi8:arm64. Preparing to unpack .../38-libffi8_3.5.2-2_arm64.deb ... Unpacking libffi8:arm64 (3.5.2-2) ... Selecting previously unselected package libp11-kit0:arm64. Preparing to unpack .../39-libp11-kit0_0.25.9-2_arm64.deb ... Unpacking libp11-kit0:arm64 (0.25.9-2) ... Selecting previously unselected package libtasn1-6:arm64. Preparing to unpack .../40-libtasn1-6_4.20.0-2_arm64.deb ... Unpacking libtasn1-6:arm64 (4.20.0-2) ... Selecting previously unselected package libgnutls30t64:arm64. Preparing to unpack .../41-libgnutls30t64_3.8.10-2_arm64.deb ... Unpacking libgnutls30t64:arm64 (3.8.10-2) ... Selecting previously unselected package librtmp1:arm64. Preparing to unpack .../42-librtmp1_2.4+20151223.gitfa8646d.1-3_arm64.deb ... Unpacking librtmp1:arm64 (2.4+20151223.gitfa8646d.1-3) ... Selecting previously unselected package libssh2-1t64:arm64. Preparing to unpack .../43-libssh2-1t64_1.11.1-1_arm64.deb ... Unpacking libssh2-1t64:arm64 (1.11.1-1) ... Selecting previously unselected package libcurl4t64:arm64. Preparing to unpack .../44-libcurl4t64_8.16.0-4_arm64.deb ... Unpacking libcurl4t64:arm64 (8.16.0-4) ... Selecting previously unselected package libjsoncpp26:arm64. Preparing to unpack .../45-libjsoncpp26_1.9.6-4_arm64.deb ... Unpacking libjsoncpp26:arm64 (1.9.6-4) ... Selecting previously unselected package librhash1:arm64. Preparing to unpack .../46-librhash1_1.4.6-1_arm64.deb ... Unpacking librhash1:arm64 (1.4.6-1) ... Selecting previously unselected package libuv1t64:arm64. Preparing to unpack .../47-libuv1t64_1.51.0-2_arm64.deb ... Unpacking libuv1t64:arm64 (1.51.0-2) ... Selecting previously unselected package cmake. Preparing to unpack .../48-cmake_4.1.1+really3.31.6-2_arm64.deb ... Unpacking cmake (4.1.1+really3.31.6-2) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../49-libdebhelper-perl_13.28_all.deb ... Unpacking libdebhelper-perl (13.28) ... Selecting previously unselected package libtool. Preparing to unpack .../50-libtool_2.5.4-5_all.deb ... Unpacking libtool (2.5.4-5) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../51-dh-autoreconf_21_all.deb ... Unpacking dh-autoreconf (21) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../52-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../53-libfile-stripnondeterminism-perl_1.15.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.15.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../54-dh-strip-nondeterminism_1.15.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.15.0-1) ... Selecting previously unselected package libelf1t64:arm64. Preparing to unpack .../55-libelf1t64_0.193-3_arm64.deb ... Unpacking libelf1t64:arm64 (0.193-3) ... Selecting previously unselected package dwz. Preparing to unpack .../56-dwz_0.16-2_arm64.deb ... Unpacking dwz (0.16-2) ... Selecting previously unselected package gettext. Preparing to unpack .../57-gettext_0.23.1-2+b1_arm64.deb ... Unpacking gettext (0.23.1-2+b1) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../58-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../59-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../60-debhelper_13.28_all.deb ... Unpacking debhelper (13.28) ... Selecting previously unselected package zlib1g-dev:arm64. Preparing to unpack .../61-zlib1g-dev_1%3a1.3.dfsg+really1.3.1-1+b1_arm64.deb ... Unpacking zlib1g-dev:arm64 (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libexpat1:arm64 (2.7.3-1) ... Setting up libpipeline1:arm64 (1.5.8-1) ... Setting up libkeyutils1:arm64 (1.6.3-6) ... Setting up bsdextrautils (2.41.2-1) ... Setting up libmagic-mgc (1:5.46-5) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libxml2-16:arm64 (2.14.6+dfsg-0.1) ... Setting up libdebhelper-perl (13.28) ... Setting up libbrotli1:arm64 (1.1.0-2+b7) ... Setting up libuv1t64:arm64 (1.51.0-2) ... Setting up libmagic1t64:arm64 (1:5.46-5) ... Setting up libnghttp2-14:arm64 (1.64.0-1.1+b1) ... Setting up gettext-base (0.23.1-2+b1) ... Setting up m4 (1.4.20-2) ... Setting up libcom-err2:arm64 (1.47.2-3+b3) ... Setting up file (1:5.46-5) ... Setting up libelf1t64:arm64 (0.193-3) ... Setting up libkrb5support0:arm64 (1.21.3-5) ... Setting up libsasl2-modules-db:arm64 (2.1.28+dfsg1-10) ... Setting up autotools-dev (20240727.1) ... Setting up libjsoncpp26:arm64 (1.9.6-4) ... Setting up libproc2-0:arm64 (2:4.0.4-9) ... Setting up libunistring5:arm64 (1.3-2) ... Setting up autopoint (0.23.1-2) ... Setting up libk5crypto3:arm64 (1.21.3-5) ... Setting up libsasl2-2:arm64 (2.1.28+dfsg1-10) ... Setting up autoconf (2.72-3.1) ... Setting up libnghttp3-9:arm64 (1.12.0-1) ... Setting up zlib1g-dev:arm64 (1:1.3.dfsg+really1.3.1-1+b1) ... Setting up libffi8:arm64 (3.5.2-2) ... Setting up dwz (0.16-2) ... Setting up sensible-utils (0.0.26) ... Setting up libuchardet0:arm64 (0.0.8-2) ... Setting up procps (2:4.0.4-9) ... Setting up libtasn1-6:arm64 (4.20.0-2) ... Setting up libngtcp2-16:arm64 (1.16.0-1) ... Setting up cmake-data (4.1.1+really3.31.6-2) ... Setting up librhash1:arm64 (1.4.6-1) ... Setting up libkrb5-3:arm64 (1.21.3-5) ... Setting up libssh2-1t64:arm64 (1.11.1-1) ... Setting up libarchive13t64:arm64 (3.7.4-4+b1) ... Setting up libldap2:arm64 (2.6.10+dfsg-1) ... Setting up automake (1:1.17-4) ... update-alternatives: using /usr/bin/automake-1.17 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.15.0-1) ... Setting up gettext (0.23.1-2+b1) ... Setting up libtool (2.5.4-5) ... Setting up libidn2-0:arm64 (2.3.8-4) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (21) ... Setting up libp11-kit0:arm64 (0.25.9-2) ... Setting up libgssapi-krb5-2:arm64 (1.21.3-5) ... Setting up libngtcp2-crypto-ossl0:arm64 (1.16.0-1) ... Setting up dh-strip-nondeterminism (1.15.0-1) ... Setting up groff-base (1.23.0-9) ... Setting up libgnutls30t64:arm64 (3.8.10-2) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libpsl5t64:arm64 (0.21.2-1.1+b1) ... Setting up man-db (2.13.1-1) ... Not building database; man-db/auto-update is not 'true'. Setting up librtmp1:arm64 (2.4+20151223.gitfa8646d.1-3) ... Setting up libcurl4t64:arm64 (8.16.0-4) ... Setting up debhelper (13.28) ... Setting up cmake (4.1.1+really3.31.6-2) ... Processing triggers for libc-bin (2.41-12) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: Running cd /build/reproducible-path/diamond-aligner-2.1.14/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../diamond-aligner_2.1.14-1_source.changes dpkg-buildpackage: info: source package diamond-aligner dpkg-buildpackage: info: source version 2.1.14-1 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Andreas Tille dpkg-source --before-build . dpkg-buildpackage: info: host architecture arm64 debian/rules clean dh clean dh_clean debian/rules binary dh binary dh_update_autotools_config dh_autoreconf debian/rules override_dh_auto_configure make[1]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14' dh_auto_configure -- -DX86=OFF -DCMAKE_BUILD_TYPE=Release -DCMAKE_POLICY_VERSION_MINIMUM=3.5 cd obj-aarch64-linux-gnu && DEB_PYTHON_INSTALL_LAYOUT=deb PKG_CONFIG=/usr/bin/pkg-config cmake -DCMAKE_INSTALL_PREFIX=/usr -DCMAKE_BUILD_TYPE=None -DCMAKE_INSTALL_SYSCONFDIR=/etc -DCMAKE_INSTALL_LOCALSTATEDIR=/var -DCMAKE_EXPORT_NO_PACKAGE_REGISTRY=ON -DCMAKE_FIND_USE_PACKAGE_REGISTRY=OFF -DCMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY=ON -DFETCHCONTENT_FULLY_DISCONNECTED=ON -DCMAKE_INSTALL_RUNSTATEDIR=/run -DCMAKE_SKIP_INSTALL_ALL_DEPENDENCY=ON "-GUnix Makefiles" -DCMAKE_VERBOSE_MAKEFILE=ON -DCMAKE_INSTALL_LIBDIR=lib/aarch64-linux-gnu -DX86=OFF -DCMAKE_BUILD_TYPE=Release -DCMAKE_POLICY_VERSION_MINIMUM=3.5 .. CMake Deprecation Warning at CMakeLists.txt:1 (cmake_minimum_required): Compatibility with CMake < 3.10 will be removed from a future version of CMake. Update the VERSION argument value. Or, use the ... syntax to tell CMake that the project requires at least but has been updated to work with policies introduced by or earlier. -- The C compiler identification is GNU 15.2.0 -- The CXX compiler identification is GNU 15.2.0 -- Detecting C compiler ABI info -- Detecting C compiler ABI info - done -- Check for working C compiler: /usr/bin/cc - skipped -- Detecting C compile features -- Detecting C compile features - done -- Detecting CXX compiler ABI info -- Detecting CXX compiler ABI info - done -- Check for working CXX compiler: /usr/bin/c++ - skipped -- Detecting CXX compile features -- Detecting CXX compile features - done -- Looking for sys/types.h -- Looking for sys/types.h - found -- Looking for stdint.h -- Looking for stdint.h - found -- Looking for stddef.h -- Looking for stddef.h - found -- Check size of ptrdiff_t -- Check size of ptrdiff_t - done -- Check size of int -- Check size of int - done -- Performing Test HAS_GNUPP14 -- Performing Test HAS_GNUPP14 - Success -- Performing Test HAS_GNUPP17 -- Performing Test HAS_GNUPP17 - Success -- Performing Test HAS_GNUPP20 -- Performing Test HAS_GNUPP20 - Success -- Looking for sysinfo -- Looking for sysinfo - found -- Found ZLIB: /usr/lib/aarch64-linux-gnu/libz.so (found version "1.3.1") -- Performing Test CMAKE_HAVE_LIBC_PTHREAD -- Performing Test CMAKE_HAVE_LIBC_PTHREAD - Success -- Found Threads: TRUE -- Configuring done (3.7s) -- Generating done (0.1s) CMake Warning: Manually-specified variables were not used by the project: CMAKE_EXPORT_NO_PACKAGE_REGISTRY CMAKE_FIND_PACKAGE_NO_PACKAGE_REGISTRY CMAKE_INSTALL_LIBDIR CMAKE_INSTALL_LOCALSTATEDIR CMAKE_INSTALL_RUNSTATEDIR CMAKE_INSTALL_SYSCONFDIR CMAKE_POLICY_VERSION_MINIMUM FETCHCONTENT_FULLY_DISCONNECTED -- Build files have been written to: /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu make[1]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14' dh_auto_build cd obj-aarch64-linux-gnu && make -j12 INSTALL="install --strip-program=true" VERBOSE=1 make[1]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' /usr/bin/cmake -S/build/reproducible-path/diamond-aligner-2.1.14 -B/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu --check-build-system CMakeFiles/Makefile.cmake 0 /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu/CMakeFiles /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu//CMakeFiles/progress.marks make -f CMakeFiles/Makefile2 all make[2]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make -f CMakeFiles/arch_generic.dir/build.make CMakeFiles/arch_generic.dir/depend make -f CMakeFiles/arch_neon.dir/build.make CMakeFiles/arch_neon.dir/depend make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' cd /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu/CMakeFiles/arch_generic.dir/DependInfo.cmake "--color=" make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' cd /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu/CMakeFiles/arch_neon.dir/DependInfo.cmake "--color=" make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make -f CMakeFiles/arch_neon.dir/build.make CMakeFiles/arch_neon.dir/build make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make -f CMakeFiles/arch_generic.dir/build.make CMakeFiles/arch_generic.dir/build make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' [ 0%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/swipe/banded_3frame_swipe.cpp.o [ 0%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/swipe/banded_3frame_swipe.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/swipe/banded_3frame_swipe.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/swipe/banded_3frame_swipe.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/swipe/banded_3frame_swipe.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/banded_3frame_swipe.cpp [ 1%] Building CXX object CMakeFiles/arch_neon.dir/src/search/stage1_2.cpp.o [ 2%] Building CXX object CMakeFiles/arch_generic.dir/src/search/stage1_2.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/search/stage1_2.cpp.o -MF CMakeFiles/arch_generic.dir/src/search/stage1_2.cpp.o.d -o CMakeFiles/arch_generic.dir/src/search/stage1_2.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/stage1_2.cpp [ 3%] Building CXX object CMakeFiles/arch_neon.dir/src/tools/benchmark.cpp.o [ 3%] Building CXX object CMakeFiles/arch_generic.dir/src/masking/tantan.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/swipe/banded_3frame_swipe.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/swipe/banded_3frame_swipe.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/swipe/banded_3frame_swipe.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/banded_3frame_swipe.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/masking/tantan.cpp.o -MF CMakeFiles/arch_generic.dir/src/masking/tantan.cpp.o.d -o CMakeFiles/arch_generic.dir/src/masking/tantan.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/search/stage1_2.cpp.o -MF CMakeFiles/arch_neon.dir/src/search/stage1_2.cpp.o.d -o CMakeFiles/arch_neon.dir/src/search/stage1_2.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/stage1_2.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/tools/benchmark.cpp.o -MF CMakeFiles/arch_neon.dir/src/tools/benchmark.cpp.o.d -o CMakeFiles/arch_neon.dir/src/tools/benchmark.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/benchmark.cpp [ 4%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/scan_diags.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/scan_diags.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/scan_diags.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/scan_diags.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/scan_diags.cpp [ 4%] Building CXX object CMakeFiles/arch_generic.dir/src/tools/benchmark.cpp.o [ 5%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/ungapped_simd.cpp.o [ 5%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/swipe/anchored_wrapper.cpp.o [ 5%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/swipe/swipe_wrapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/ungapped_simd.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/ungapped_simd.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/ungapped_simd.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/ungapped_simd.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/swipe/swipe_wrapper.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/swipe/swipe_wrapper.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/swipe/swipe_wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/tools/benchmark.cpp.o -MF CMakeFiles/arch_generic.dir/src/tools/benchmark.cpp.o.d -o CMakeFiles/arch_generic.dir/src/tools/benchmark.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/benchmark.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/swipe/anchored_wrapper.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/swipe/anchored_wrapper.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/swipe/anchored_wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/anchored_wrapper.cpp [ 6%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/swipe/swipe_wrapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/swipe/swipe_wrapper.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/swipe/swipe_wrapper.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/swipe/swipe_wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:369, from /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:27: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h: In instantiation of ‘static void Eigen_GENERIC::PlainObjectBase::_check_template_params() [with Derived = Eigen_GENERIC::Array]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:134:35: required from ‘Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array() [with _Scalar = float; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ 134 | Base::_check_template_params(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /usr/include/c++/15/array:102:12: required from here 102 | struct array | ^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:102: warning: bitwise operation between different enumeration types ‘Eigen_GENERIC::PlainObjectBase >::’ and ‘Eigen_GENERIC::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:102: warning: bitwise operation between different enumeration types ‘Eigen_GENERIC::PlainObjectBase >::’ and ‘Eigen_GENERIC::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h: In instantiation of ‘static void Eigen_GENERIC::PlainObjectBase::_check_template_params() [with Derived = Eigen_GENERIC::Array]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:170:35: required from ‘Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const T&) [with T = double; _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 170 | Base::_check_template_params(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:61:31: required from here 61 | Array f(0.0), d, t; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:102: warning: bitwise operation between different enumeration types ‘Eigen_GENERIC::PlainObjectBase >::’ and ‘Eigen_GENERIC::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:102: warning: bitwise operation between different enumeration types ‘Eigen_GENERIC::PlainObjectBase >::’ and ‘Eigen_GENERIC::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ^~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:483: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h: In instantiation of ‘struct Eigen_GENERIC::internal::redux_impl, Eigen_GENERIC::internal::redux_evaluator >, 3, 2>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen_GENERIC::internal::traits::Scalar Eigen_GENERIC::DenseBase::redux(const Func&) const [with BinaryOp = Eigen_GENERIC::internal::scalar_sum_op; Derived = Eigen_GENERIC::Array; typename Eigen_GENERIC::internal::traits::Scalar = float]’ 418 | return internal::redux_impl::run(thisEval, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:453:25: required from ‘typename Eigen_GENERIC::internal::traits::Scalar Eigen_GENERIC::DenseBase::sum() const [with Derived = Eigen_GENERIC::Array; typename Eigen_GENERIC::internal::traits::Scalar = float]’ 453 | return derived().redux(Eigen::internal::scalar_sum_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:82:24: required from here 82 | const float s = f.sum(); | ~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:315:28: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::internal::redux_evaluator >::’ and ‘Eigen_GENERIC::internal::redux_traits, Eigen_GENERIC::internal::redux_evaluator > >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 315 | VectorizedSize = (Size / PacketSize) * PacketSize | ~~~~~~^~~~~~~~~~~~~ [ 7%] Building CXX object CMakeFiles/arch_generic.dir/src/dp/score_profile.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_GENERIC -DARCH_ID=0 -DEigen=Eigen_GENERIC -MD -MT CMakeFiles/arch_generic.dir/src/dp/score_profile.cpp.o -MF CMakeFiles/arch_generic.dir/src/dp/score_profile.cpp.o.d -o CMakeFiles/arch_generic.dir/src/dp/score_profile.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/score_profile.cpp In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:446: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator >, Eigen_GENERIC::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = Eigen_GENERIC::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:207:18: required from ‘Derived& Eigen_GENERIC::ArrayBase::operator*=(const Eigen_GENERIC::ArrayBase&) [with OtherDerived = Eigen_GENERIC::Array; Derived = Eigen_GENERIC::Array]’ 207 | call_assignment(derived(), other.derived(), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:84:8: required from here 84 | t *= d; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator, Eigen_GENERIC::Array > >, Eigen_GENERIC::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = Eigen_GENERIC::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28: required from ‘Derived& Eigen_GENERIC::DenseBase::operator*=(const Scalar&) [with Derived = Eigen_GENERIC::Array; Scalar = float]’ 20 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:85:8: required from here 85 | f *= f2f; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator >, Eigen_GENERIC::internal::add_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = add_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = Eigen_GENERIC::internal::add_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = add_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = add_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:194:18: required from ‘Derived& Eigen_GENERIC::ArrayBase::operator+=(const Eigen_GENERIC::ArrayBase&) [with OtherDerived = Eigen_GENERIC::Array; Derived = Eigen_GENERIC::Array]’ 194 | call_assignment(derived(), other.derived(), internal::add_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:86:8: required from here 86 | f += t; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator, 50, 1, false> >, Eigen_GENERIC::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Block, 50, 1, false>; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Block, 50, 1, false>; Functor = Eigen_GENERIC::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Block, 50, 1, false>; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Block, 50, 1, false>; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:207:18: required from ‘Derived& Eigen_GENERIC::ArrayBase::operator*=(const Eigen_GENERIC::ArrayBase&) [with OtherDerived = Eigen_GENERIC::Block, 50, 1, false>; Derived = Eigen_GENERIC::Array]’ 207 | call_assignment(derived(), other.derived(), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:88:79: required from here 88 | f *= e[(size_t)letter_mask(seq[i])].template segment(len - i, WINDOW); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator, Eigen_GENERIC::Array > >, Eigen_GENERIC::internal::add_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = add_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = Eigen_GENERIC::internal::add_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = add_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = add_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/SelfCwiseBinaryOp.h:27:28: required from ‘Derived& Eigen_GENERIC::ArrayBase::operator+=(const Scalar&) [with Derived = Eigen_GENERIC::Array; Scalar = float]’ 27 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::add_assign_op()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:127:23: required from here 127 | f += p_repeat_end * b; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator >, Eigen_GENERIC::internal::assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::Array; Functor = Eigen_GENERIC::internal::assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::Array]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen_GENERIC::PlainObjectBase::_set(const Eigen_GENERIC::DenseBase&) [with OtherDerived = Eigen_GENERIC::Array; Derived = Eigen_GENERIC::Array]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:118:24: required from ‘Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>&) [with _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 118 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:124:7: required from here 124 | t = f; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_GENERIC::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_GENERIC::internal::generic_dense_assignment_kernel >, Eigen_GENERIC::internal::evaluator, Eigen_GENERIC::Array > >, Eigen_GENERIC::internal::assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_GENERIC::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_GENERIC::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_GENERIC::Array; SrcXprType = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Functor = Eigen_GENERIC::internal::assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_GENERIC::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_GENERIC::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen_GENERIC::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen_GENERIC::Array; Src = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen_GENERIC::PlainObjectBase::_set(const Eigen_GENERIC::DenseBase&) [with OtherDerived = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; Derived = Eigen_GENERIC::Array]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:109:24: required from ‘Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen_GENERIC::DenseBase&) [with OtherDerived = Eigen_GENERIC::CwiseNullaryOp, Eigen_GENERIC::Array >; _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 109 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CwiseNullaryOp.h:327:20: required from ‘Derived& Eigen_GENERIC::DenseBase::setConstant(const Scalar&) [with Derived = Eigen_GENERIC::Array; Scalar = float]’ 327 | return derived() = Constant(rows(), cols(), val); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:92:24: required from ‘Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_GENERIC::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Scalar&) [with _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1; Scalar = float]’ 92 | Base::setConstant(value); | ~~~~~~~~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:83:7: required from here 83 | t = b; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_GENERIC::Array::’ and ‘Eigen_GENERIC::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ [ 8%] Building CXX object CMakeFiles/arch_neon.dir/src/masking/tantan.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/masking/tantan.cpp.o -MF CMakeFiles/arch_neon.dir/src/masking/tantan.cpp.o.d -o CMakeFiles/arch_neon.dir/src/masking/tantan.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics [ 8%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/scan_diags.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/scan_diags.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/scan_diags.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/scan_diags.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/scan_diags.cpp In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:369, from /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:27: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h: In instantiation of ‘static void Eigen_NEON::PlainObjectBase::_check_template_params() [with Derived = Eigen_NEON::Array]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:134:35: required from ‘Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array() [with _Scalar = float; int _Rows = -1; int _Cols = 1; int _Options = 0; int _MaxRows = -1; int _MaxCols = 1]’ 134 | Base::_check_template_params(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /usr/include/c++/15/array:102:12: required from here 102 | struct array | ^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:102: warning: bitwise operation between different enumeration types ‘Eigen_NEON::PlainObjectBase >::’ and ‘Eigen_NEON::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:102: warning: bitwise operation between different enumeration types ‘Eigen_NEON::PlainObjectBase >::’ and ‘Eigen_NEON::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h: In instantiation of ‘static void Eigen_NEON::PlainObjectBase::_check_template_params() [with Derived = Eigen_NEON::Array]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:170:35: required from ‘Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Array(const T&) [with T = double; _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 170 | Base::_check_template_params(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:61:31: required from here 61 | Array f(0.0), d, t; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:102: warning: bitwise operation between different enumeration types ‘Eigen_NEON::PlainObjectBase >::’ and ‘Eigen_NEON::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:102: warning: bitwise operation between different enumeration types ‘Eigen_NEON::PlainObjectBase >::’ and ‘Eigen_NEON::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ^~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:483: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h: In instantiation of ‘struct Eigen_NEON::internal::redux_impl, Eigen_NEON::internal::redux_evaluator >, 3, 2>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:418:56: required from ‘typename Eigen_NEON::internal::traits::Scalar Eigen_NEON::DenseBase::redux(const Func&) const [with BinaryOp = Eigen_NEON::internal::scalar_sum_op; Derived = Eigen_NEON::Array; typename Eigen_NEON::internal::traits::Scalar = float]’ 418 | return internal::redux_impl::run(thisEval, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:453:25: required from ‘typename Eigen_NEON::internal::traits::Scalar Eigen_NEON::DenseBase::sum() const [with Derived = Eigen_NEON::Array; typename Eigen_NEON::internal::traits::Scalar = float]’ 453 | return derived().redux(Eigen::internal::scalar_sum_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:82:24: required from here 82 | const float s = f.sum(); | ~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:315:28: warning: arithmetic between different enumeration types ‘Eigen_NEON::internal::redux_evaluator >::’ and ‘Eigen_NEON::internal::redux_traits, Eigen_NEON::internal::redux_evaluator > >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 315 | VectorizedSize = (Size / PacketSize) * PacketSize | ~~~~~~^~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:446: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator >, Eigen_NEON::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = Eigen_NEON::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:207:18: required from ‘Derived& Eigen_NEON::ArrayBase::operator*=(const Eigen_NEON::ArrayBase&) [with OtherDerived = Eigen_NEON::Array; Derived = Eigen_NEON::Array]’ 207 | call_assignment(derived(), other.derived(), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:84:8: required from here 84 | t *= d; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator, Eigen_NEON::Array > >, Eigen_NEON::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = Eigen_NEON::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/SelfCwiseBinaryOp.h:20:28: required from ‘Derived& Eigen_NEON::DenseBase::operator*=(const Scalar&) [with Derived = Eigen_NEON::Array; Scalar = float]’ 20 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:85:8: required from here 85 | f *= f2f; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator >, Eigen_NEON::internal::add_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = add_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = Eigen_NEON::internal::add_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = add_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = add_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:194:18: required from ‘Derived& Eigen_NEON::ArrayBase::operator+=(const Eigen_NEON::ArrayBase&) [with OtherDerived = Eigen_NEON::Array; Derived = Eigen_NEON::Array]’ 194 | call_assignment(derived(), other.derived(), internal::add_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:86:8: required from here 86 | f += t; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator, 50, 1, false> >, Eigen_NEON::internal::mul_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Block, 50, 1, false>; Functor = mul_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Block, 50, 1, false>; Functor = Eigen_NEON::internal::mul_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Block, 50, 1, false>; Func = mul_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Block, 50, 1, false>; Func = mul_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ArrayBase.h:207:18: required from ‘Derived& Eigen_NEON::ArrayBase::operator*=(const Eigen_NEON::ArrayBase&) [with OtherDerived = Eigen_NEON::Block, 50, 1, false>; Derived = Eigen_NEON::Array]’ 207 | call_assignment(derived(), other.derived(), internal::mul_assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:88:79: required from here 88 | f *= e[(size_t)letter_mask(seq[i])].template segment(len - i, WINDOW); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator, Eigen_NEON::Array > >, Eigen_NEON::internal::add_assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = add_assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = Eigen_NEON::internal::add_assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = add_assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = add_assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/SelfCwiseBinaryOp.h:27:28: required from ‘Derived& Eigen_NEON::ArrayBase::operator+=(const Scalar&) [with Derived = Eigen_NEON::Array; Scalar = float]’ 27 | internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::add_assign_op()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:127:23: required from here 127 | f += p_repeat_end * b; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator >, Eigen_NEON::internal::assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::Array; Functor = Eigen_NEON::internal::assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::Array]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen_NEON::PlainObjectBase::_set(const Eigen_NEON::DenseBase&) [with OtherDerived = Eigen_NEON::Array; Derived = Eigen_NEON::Array]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:118:24: required from ‘Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>&) [with _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 118 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:124:7: required from here 124 | t = f; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h: In instantiation of ‘static void Eigen_NEON::internal::dense_assignment_loop::run(Kernel&) [with Kernel = Eigen_NEON::internal::generic_dense_assignment_kernel >, Eigen_NEON::internal::evaluator, Eigen_NEON::Array > >, Eigen_NEON::internal::assign_op, 0>]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:741:37: required from ‘void Eigen_NEON::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = assign_op]’ 741 | dense_assignment_loop::run(kernel); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen_NEON::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen_NEON::Array; SrcXprType = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Functor = Eigen_NEON::internal::assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen_NEON::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen_NEON::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen_NEON::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen_NEON::Array; Src = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen_NEON::PlainObjectBase::_set(const Eigen_NEON::DenseBase&) [with OtherDerived = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; Derived = Eigen_NEON::Array]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:109:24: required from ‘Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen_NEON::DenseBase&) [with OtherDerived = Eigen_NEON::CwiseNullaryOp, Eigen_NEON::Array >; _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1]’ 109 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CwiseNullaryOp.h:327:20: required from ‘Derived& Eigen_NEON::DenseBase::setConstant(const Scalar&) [with Derived = Eigen_NEON::Array; Scalar = float]’ 327 | return derived() = Constant(rows(), cols(), val); | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Array.h:92:24: required from ‘Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen_NEON::Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Scalar&) [with _Scalar = float; int _Rows = 50; int _Cols = 1; int _Options = 0; int _MaxRows = 50; int _MaxCols = 1; Scalar = float]’ 92 | Base::setConstant(value); | ~~~~~~~~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/masking/tantan.cpp:83:7: required from here 83 | t = b; | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:432:31: warning: arithmetic between different enumeration types ‘Eigen_NEON::Array::’ and ‘Eigen_NEON::internal::unpacket_traits<__Float32x4_t>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 432 | alignedSize = (size/packetSize)*packetSize }; | ~~~~~^~~~~~~~~~~~ [ 9%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/ungapped_simd.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/ungapped_simd.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/ungapped_simd.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/ungapped_simd.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/ungapped_simd.cpp [ 10%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/swipe/anchored_wrapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/swipe/anchored_wrapper.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/swipe/anchored_wrapper.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/swipe/anchored_wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/anchored_wrapper.cpp [ 10%] Building CXX object CMakeFiles/arch_neon.dir/src/dp/score_profile.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -DDISPATCH_ARCH=ARCH_NEON -DARCH_ID=4 -D__ARM_NEON -D__aarch64__ -DEigen=Eigen_NEON -MD -MT CMakeFiles/arch_neon.dir/src/dp/score_profile.cpp.o -MF CMakeFiles/arch_neon.dir/src/dp/score_profile.cpp.o.d -o CMakeFiles/arch_neon.dir/src/dp/score_profile.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/score_profile.cpp cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics In file included from /usr/include/c++/15/list:64, from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp:22: In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_NEON::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_NEON::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = __gnu_cxx::__normal_iterator >; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In file included from /usr/include/c++/15/list:64, from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp:22: In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_GENERIC::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_GENERIC::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = __gnu_cxx::__normal_iterator >; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_NEON::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_NEON::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = __gnu_cxx::__normal_iterator >; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_GENERIC::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_GENERIC::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = __gnu_cxx::__normal_iterator >; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_GENERIC::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_GENERIC::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = StringSetBase::ConstIterator; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_NEON::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_NEON::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = StringSetBase::ConstIterator; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_GENERIC::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_GENERIC::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = StringSetBase::ConstIterator; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In function ‘constexpr void std::__fill_a1(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’, inlined from ‘constexpr void std::__fill_a(_FIte, _FIte, const _Tp&) [with _FIte = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:979:21, inlined from ‘constexpr void std::fill(_ForwardIterator, _ForwardIterator, const _Tp&) [with _ForwardIterator = int*; _Tp = int]’ at /usr/include/c++/15/bits/stl_algobase.h:1011:20, inlined from ‘DP::Swipe::ARCH_NEON::Matrix::Matrix(int, int) [with Sv = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_matrix.h:66:12, inlined from ‘std::__cxx11::list DP::Swipe::ARCH_NEON::swipe(It, It, std::atomic*, Cbs, DP::TargetVec&, DP::Params&) [with Sv = int; Cbs = DP::NoCBS; It = StringSetBase::ConstIterator; Cfg = SwipeConfig, int, DummyIdMask >]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/full_swipe.h:165:9: /usr/include/c++/15/bits/stl_algobase.h:925:18: warning: ‘void* __builtin_memset(void*, int, long unsigned int)’ specified bound 18446744073709551612 exceeds maximum object size 9223372036854775807 [-Wstringop-overflow=] 925 | *__first = __val; | ~~~~~~~~~^~~~~~~ In file included from /usr/include/c++/15/bits/stl_pair.h:65, from /usr/include/c++/15/bits/stl_algobase.h:64: In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/banded_swipe.h:29, from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp:38: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:102:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In file included from /usr/include/c++/15/bits/stl_pair.h:61: In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 64 14 | std::array, N> b; | ^ In file included from /usr/include/c++/15/bits/stl_pair.h:65, from /usr/include/c++/15/bits/stl_algobase.h:64: In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/banded_swipe.h:29, from /build/reproducible-path/diamond-aligner-2.1.14/src/dp/swipe/swipe_wrapper.cpp:38: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:102:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In file included from /usr/include/c++/15/bits/stl_pair.h:61: In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 16 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 64 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 17 is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 68 into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 8> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 8; T = short int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 64 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:100:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:102:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:95:19, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:15: warning: array subscript [7, 576460752303423486] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [56, 4611686018427387888] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:16: warning: array subscript [7, 576460752303423486] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [56, 4611686018427387888] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_val]’ at /usr/include/c++/15/bits/stl_heap.h:142:29, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:247:23, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:15: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_val]’ at /usr/include/c++/15/bits/stl_heap.h:142:29, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:247:23, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:16: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:91:17, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:93:14, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:100:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:102:22, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:105:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:101:16, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:95:19, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:98:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:326:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [16, 1152921504606846974] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [64, 4611686018427387896] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:236:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 236 | __a = _GLIBCXX_MOVE(__b); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In function ‘constexpr std::_Require >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&) [with _Tp = int]’, inlined from ‘constexpr void std::pair<_T1, _T2>::swap(std::pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:327:6, inlined from ‘constexpr typename std::enable_if, std::__is_swappable<_T2> >::value>::type std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&) [with _T1 = int; _T2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1123:15, inlined from ‘constexpr void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = pair*; _ForwardIterator2 = pair*]’ at /usr/include/c++/15/bits/stl_algobase.h:186:11, inlined from ‘constexpr void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:94:20, inlined from ‘constexpr _RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1856:34, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1890:38, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/move.h:237:11: warning: array subscript [17, 1152921504606846975] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 237 | __b = _GLIBCXX_MOVE(__tmp); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [68, 4611686018427387900] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:15: warning: array subscript [7, 576460752303423486] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [56, 4611686018427387888] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript [15, 1152921504606846973] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [120, 9223372036854775784] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:16: warning: array subscript [7, 576460752303423486] is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset [56, 4611686018427387888] into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:46: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:241:29, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:48: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_val]’ at /usr/include/c++/15/bits/stl_heap.h:142:29, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:247:23, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:626:15: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 626 | first = std::forward(__p.first); | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr std::pair<_T1, _T2>& std::pair<_T1, _T2>::operator=(std::pair<_T1, _T2>&&) requires _S_assignable<_T1, _T2>() [with _T1 = int; _T2 = int]’, inlined from ‘constexpr void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_val]’ at /usr/include/c++/15/bits/stl_heap.h:142:29, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:247:23, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/bits/stl_pair.h:627:16: warning: array subscript 1 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 627 | second = std::forward(__p.second); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:264:25, inlined from ‘constexpr void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:425:19, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1870:23, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1051:43, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 2 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 8 into object ‘b’ of size 8 14 | std::array, N> b; | ^ In member function ‘constexpr auto std::__detail::_Synth3way::operator()(const _Tp&, const _Up&) const requires requires{{std::__detail::_Synth3way::operator()::__t < std::__detail::_Synth3way::operator()::__u} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];{std::__detail::_Synth3way::operator()::__u < std::__detail::_Synth3way::operator()::__t} -> decltype(auto) [requires std::__detail::__boolean_testable<, >];} [with _Tp = int; _Up = int]’, inlined from ‘constexpr std::common_comparison_category_t(), declval<_U1&>())), decltype (std::__detail::__synth3way(declval<_T2&>(), declval<_U2&>()))> std::operator<=>(const pair<_T1, _T2>&, const pair<_U1, _U2>&) [with _T1 = int; _T2 = int; _U1 = int; _U2 = int]’ at /usr/include/c++/15/bits/stl_pair.h:1053:35, inlined from ‘constexpr bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = std::pair*; _Iterator2 = std::pair*]’ at /usr/include/c++/15/bits/predefined_ops.h:45:23, inlined from ‘constexpr void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair*; _Distance = long int; _Tp = pair; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:232:14, inlined from ‘constexpr void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_heap.h:356:22, inlined from ‘constexpr void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1594:23, inlined from ‘constexpr void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1869:25, inlined from ‘constexpr void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1885:27, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1906:25, inlined from ‘constexpr void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ at /usr/include/c++/15/bits/stl_algo.h:1901:5, inlined from ‘constexpr void std::sort(_RAIter, _RAIter) [with _RAIter = pair*]’ at /usr/include/c++/15/bits/stl_algo.h:4841:18, inlined from ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:17:12: /usr/include/c++/15/compare:1244:28: warning: array subscript 3 is outside array bounds of ‘std::array, 1> [1]’ [-Warray-bounds=] 1244 | return __t <=> __u; | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h: In constructor ‘RangePartition::RangePartition(const int*, int, int) [with int N = 1; T = int]’: /build/reproducible-path/diamond-aligner-2.1.14/src/util/data_structures/range_partition.h:14:52: note: at offset 12 into object ‘b’ of size 8 14 | std::array, N> b; | ^ At global scope: cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics At global scope: cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' [ 10%] Built target arch_generic make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' [ 10%] Built target arch_neon make -f CMakeFiles/diamond.dir/build.make CMakeFiles/diamond.dir/depend make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' cd /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu && /usr/bin/cmake -E cmake_depends "Unix Makefiles" /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14 /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu/CMakeFiles/diamond.dir/DependInfo.cmake "--color=" make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make -f CMakeFiles/diamond.dir/build.make CMakeFiles/diamond.dir/build make[3]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' [ 11%] Building CXX object CMakeFiles/diamond.dir/src/run/main.cpp.o [ 11%] Building CXX object CMakeFiles/diamond.dir/src/basic/config.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/run/main.cpp.o -MF CMakeFiles/diamond.dir/src/run/main.cpp.o.d -o CMakeFiles/diamond.dir/src/run/main.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/run/main.cpp [ 12%] Building CXX object CMakeFiles/diamond.dir/src/data/queries.cpp.o [ 12%] Building CXX object CMakeFiles/diamond.dir/src/data/seed_histogram.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/basic/config.cpp.o -MF CMakeFiles/diamond.dir/src/basic/config.cpp.o.d -o CMakeFiles/diamond.dir/src/basic/config.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/basic/config.cpp [ 13%] Building CXX object CMakeFiles/diamond.dir/src/output/daa/daa_record.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/queries.cpp.o -MF CMakeFiles/diamond.dir/src/data/queries.cpp.o.d -o CMakeFiles/diamond.dir/src/data/queries.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/queries.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/seed_histogram.cpp.o -MF CMakeFiles/diamond.dir/src/data/seed_histogram.cpp.o.d -o CMakeFiles/diamond.dir/src/data/seed_histogram.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/seed_histogram.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/daa/daa_record.cpp.o -MF CMakeFiles/diamond.dir/src/output/daa/daa_record.cpp.o.d -o CMakeFiles/diamond.dir/src/output/daa/daa_record.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/daa/daa_record.cpp [ 14%] Building CXX object CMakeFiles/diamond.dir/src/util/util.cpp.o [ 14%] Building CXX object CMakeFiles/diamond.dir/src/util/command_line_parser.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/util.cpp.o -MF CMakeFiles/diamond.dir/src/util/util.cpp.o.d -o CMakeFiles/diamond.dir/src/util/util.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/util.cpp [ 15%] Building CXX object CMakeFiles/diamond.dir/src/basic/basic.cpp.o [ 17%] Building CXX object CMakeFiles/diamond.dir/src/stats/score_matrix.cpp.o [ 17%] Building CXX object CMakeFiles/diamond.dir/src/basic/hssp.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/basic/basic.cpp.o -MF CMakeFiles/diamond.dir/src/basic/basic.cpp.o.d -o CMakeFiles/diamond.dir/src/basic/basic.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/basic/basic.cpp [ 16%] Building CXX object CMakeFiles/diamond.dir/src/dp/ungapped_align.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/score_matrix.cpp.o -MF CMakeFiles/diamond.dir/src/stats/score_matrix.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/score_matrix.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/score_matrix.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/command_line_parser.cpp.o -MF CMakeFiles/diamond.dir/src/util/command_line_parser.cpp.o.d -o CMakeFiles/diamond.dir/src/util/command_line_parser.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/command_line_parser.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/basic/hssp.cpp.o -MF CMakeFiles/diamond.dir/src/basic/hssp.cpp.o.d -o CMakeFiles/diamond.dir/src/basic/hssp.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/basic/hssp.cpp [ 17%] Building CXX object CMakeFiles/diamond.dir/src/run/tools.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/dp/ungapped_align.cpp.o -MF CMakeFiles/diamond.dir/src/dp/ungapped_align.cpp.o.d -o CMakeFiles/diamond.dir/src/dp/ungapped_align.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/ungapped_align.cpp /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/run/tools.cpp.o -MF CMakeFiles/diamond.dir/src/run/tools.cpp.o.d -o CMakeFiles/diamond.dir/src/run/tools.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/run/tools.cpp [ 18%] Building CXX object CMakeFiles/diamond.dir/src/chaining/greedy_align.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/chaining/greedy_align.cpp.o -MF CMakeFiles/diamond.dir/src/chaining/greedy_align.cpp.o.d -o CMakeFiles/diamond.dir/src/chaining/greedy_align.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/chaining/greedy_align.cpp [ 19%] Building CXX object CMakeFiles/diamond.dir/src/output/output_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/output_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/output_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/output_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/output_format.cpp [ 19%] Building CXX object CMakeFiles/diamond.dir/src/output/join_blocks.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/join_blocks.cpp.o -MF CMakeFiles/diamond.dir/src/output/join_blocks.cpp.o.d -o CMakeFiles/diamond.dir/src/output/join_blocks.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/join_blocks.cpp [ 20%] Building CXX object CMakeFiles/diamond.dir/src/data/frequent_seeds.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/frequent_seeds.cpp.o -MF CMakeFiles/diamond.dir/src/data/frequent_seeds.cpp.o.d -o CMakeFiles/diamond.dir/src/data/frequent_seeds.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/frequent_seeds.cpp [ 20%] Building CXX object CMakeFiles/diamond.dir/src/align/legacy/query_mapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/legacy/query_mapper.cpp.o -MF CMakeFiles/diamond.dir/src/align/legacy/query_mapper.cpp.o.d -o CMakeFiles/diamond.dir/src/align/legacy/query_mapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/legacy/query_mapper.cpp [ 21%] Building CXX object CMakeFiles/diamond.dir/src/output/blast_tab_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/blast_tab_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/blast_tab_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/blast_tab_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/blast_tab_format.cpp [ 22%] Building CXX object CMakeFiles/diamond.dir/src/output/blast_pairwise_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/blast_pairwise_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/blast_pairwise_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/blast_pairwise_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/blast_pairwise_format.cpp [ 22%] Building CXX object CMakeFiles/diamond.dir/src/run/double_indexed.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/run/double_indexed.cpp.o -MF CMakeFiles/diamond.dir/src/run/double_indexed.cpp.o.d -o CMakeFiles/diamond.dir/src/run/double_indexed.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/run/double_indexed.cpp [ 23%] Building CXX object CMakeFiles/diamond.dir/src/output/sam_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/sam_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/sam_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/sam_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/sam_format.cpp [ 23%] Building CXX object CMakeFiles/diamond.dir/src/align/align.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/align.cpp.o -MF CMakeFiles/diamond.dir/src/align/align.cpp.o.d -o CMakeFiles/diamond.dir/src/align/align.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/align.cpp [ 24%] Building CXX object CMakeFiles/diamond.dir/src/search/setup.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/search/setup.cpp.o -MF CMakeFiles/diamond.dir/src/search/setup.cpp.o.d -o CMakeFiles/diamond.dir/src/search/setup.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/setup.cpp [ 25%] Building CXX object CMakeFiles/diamond.dir/src/data/taxonomy.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/taxonomy.cpp.o -MF CMakeFiles/diamond.dir/src/data/taxonomy.cpp.o.d -o CMakeFiles/diamond.dir/src/data/taxonomy.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/taxonomy.cpp [ 25%] Building CXX object CMakeFiles/diamond.dir/src/masking/masking.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/masking/masking.cpp.o -MF CMakeFiles/diamond.dir/src/masking/masking.cpp.o.d -o CMakeFiles/diamond.dir/src/masking/masking.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/masking/masking.cpp [ 26%] Building CXX object CMakeFiles/diamond.dir/src/data/seed_set.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/seed_set.cpp.o -MF CMakeFiles/diamond.dir/src/data/seed_set.cpp.o.d -o CMakeFiles/diamond.dir/src/data/seed_set.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/seed_set.cpp [ 26%] Building CXX object CMakeFiles/diamond.dir/src/util/simd.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/simd.cpp.o -MF CMakeFiles/diamond.dir/src/util/simd.cpp.o.d -o CMakeFiles/diamond.dir/src/util/simd.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/simd.cpp [ 27%] Building CXX object CMakeFiles/diamond.dir/src/output/taxon_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/taxon_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/taxon_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/taxon_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/taxon_format.cpp [ 27%] Building CXX object CMakeFiles/diamond.dir/src/output/daa/view.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/daa/view.cpp.o -MF CMakeFiles/diamond.dir/src/output/daa/view.cpp.o.d -o CMakeFiles/diamond.dir/src/output/daa/view.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/daa/view.cpp [ 28%] Building CXX object CMakeFiles/diamond.dir/src/output/output_sink.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/output_sink.cpp.o -MF CMakeFiles/diamond.dir/src/output/output_sink.cpp.o.d -o CMakeFiles/diamond.dir/src/output/output_sink.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/output_sink.cpp [ 29%] Building CXX object CMakeFiles/diamond.dir/src/output/target_culling.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/target_culling.cpp.o -MF CMakeFiles/diamond.dir/src/output/target_culling.cpp.o.d -o CMakeFiles/diamond.dir/src/output/target_culling.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/target_culling.cpp [ 29%] Building CXX object CMakeFiles/diamond.dir/src/align/legacy/banded_swipe_pipeline.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/legacy/banded_swipe_pipeline.cpp.o -MF CMakeFiles/diamond.dir/src/align/legacy/banded_swipe_pipeline.cpp.o.d -o CMakeFiles/diamond.dir/src/align/legacy/banded_swipe_pipeline.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/legacy/banded_swipe_pipeline.cpp [ 30%] Building CXX object CMakeFiles/diamond.dir/src/util/io/compressed_stream.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/compressed_stream.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/compressed_stream.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/compressed_stream.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/compressed_stream.cpp [ 30%] Building CXX object CMakeFiles/diamond.dir/src/util/io/deserializer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/deserializer.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/deserializer.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/deserializer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/deserializer.cpp [ 31%] Building CXX object CMakeFiles/diamond.dir/src/util/io/file_sink.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/file_sink.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/file_sink.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/file_sink.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/file_sink.cpp [ 32%] Building CXX object CMakeFiles/diamond.dir/src/util/io/file_source.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/file_source.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/file_source.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/file_source.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/file_source.cpp [ 32%] Building CXX object CMakeFiles/diamond.dir/src/util/io/input_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/input_file.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/input_file.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/input_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/input_file.cpp [ 33%] Building CXX object CMakeFiles/diamond.dir/src/util/io/input_stream_buffer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/input_stream_buffer.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/input_stream_buffer.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/input_stream_buffer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/input_stream_buffer.cpp [ 33%] Building CXX object CMakeFiles/diamond.dir/src/util/io/output_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/output_file.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/output_file.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/output_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/output_file.cpp [ 34%] Building CXX object CMakeFiles/diamond.dir/src/util/io/output_stream_buffer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/output_stream_buffer.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/output_stream_buffer.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/output_stream_buffer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/output_stream_buffer.cpp [ 35%] Building CXX object CMakeFiles/diamond.dir/src/util/io/serializer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/serializer.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/serializer.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/serializer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/serializer.cpp [ 35%] Building CXX object CMakeFiles/diamond.dir/src/util/io/temp_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/temp_file.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/temp_file.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/temp_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/temp_file.cpp [ 36%] Building CXX object CMakeFiles/diamond.dir/src/util/io/text_input_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/io/text_input_file.cpp.o -MF CMakeFiles/diamond.dir/src/util/io/text_input_file.cpp.o.d -o CMakeFiles/diamond.dir/src/util/io/text_input_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/io/text_input_file.cpp [ 36%] Building CXX object CMakeFiles/diamond.dir/src/data/taxon_list.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/taxon_list.cpp.o -MF CMakeFiles/diamond.dir/src/data/taxon_list.cpp.o.d -o CMakeFiles/diamond.dir/src/data/taxon_list.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/taxon_list.cpp [ 37%] Building CXX object CMakeFiles/diamond.dir/src/data/taxonomy_nodes.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/taxonomy_nodes.cpp.o -MF CMakeFiles/diamond.dir/src/data/taxonomy_nodes.cpp.o.d -o CMakeFiles/diamond.dir/src/data/taxonomy_nodes.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/taxonomy_nodes.cpp [ 38%] Building CXX object CMakeFiles/diamond.dir/src/lib/murmurhash/MurmurHash3.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/murmurhash/MurmurHash3.cpp.o -MF CMakeFiles/diamond.dir/src/lib/murmurhash/MurmurHash3.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/murmurhash/MurmurHash3.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/murmurhash/MurmurHash3.cpp [ 38%] Building CXX object CMakeFiles/diamond.dir/src/search/stage0.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/search/stage0.cpp.o -MF CMakeFiles/diamond.dir/src/search/stage0.cpp.o.d -o CMakeFiles/diamond.dir/src/search/stage0.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/stage0.cpp [ 39%] Building CXX object CMakeFiles/diamond.dir/src/data/seed_array.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/seed_array.cpp.o -MF CMakeFiles/diamond.dir/src/data/seed_array.cpp.o.d -o CMakeFiles/diamond.dir/src/data/seed_array.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/seed_array.cpp [ 39%] Building CXX object CMakeFiles/diamond.dir/src/output/paf_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/paf_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/paf_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/paf_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/paf_format.cpp [ 40%] Building CXX object CMakeFiles/diamond.dir/src/util/system/system.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/system/system.cpp.o -MF CMakeFiles/diamond.dir/src/util/system/system.cpp.o.d -o CMakeFiles/diamond.dir/src/util/system/system.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/system/system.cpp [ 41%] Building CXX object CMakeFiles/diamond.dir/src/util/algo/greedy_vertex_cover.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/algo/greedy_vertex_cover.cpp.o -MF CMakeFiles/diamond.dir/src/util/algo/greedy_vertex_cover.cpp.o.d -o CMakeFiles/diamond.dir/src/util/algo/greedy_vertex_cover.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/greedy_vertex_cover.cpp [ 41%] Building CXX object CMakeFiles/diamond.dir/src/util/sequence/sequence.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/sequence/sequence.cpp.o -MF CMakeFiles/diamond.dir/src/util/sequence/sequence.cpp.o.d -o CMakeFiles/diamond.dir/src/util/sequence/sequence.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/sequence.cpp [ 42%] Building CXX object CMakeFiles/diamond.dir/src/tools/tools.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/tools/tools.cpp.o -MF CMakeFiles/diamond.dir/src/tools/tools.cpp.o.d -o CMakeFiles/diamond.dir/src/tools/tools.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/tools.cpp [ 42%] Building CXX object CMakeFiles/diamond.dir/src/util/system/getRSS.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/system/getRSS.cpp.o -MF CMakeFiles/diamond.dir/src/util/system/getRSS.cpp.o.d -o CMakeFiles/diamond.dir/src/util/system/getRSS.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/system/getRSS.cpp [ 43%] Building CXX object CMakeFiles/diamond.dir/src/lib/tantan/LambdaCalculator.cc.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/tantan/LambdaCalculator.cc.o -MF CMakeFiles/diamond.dir/src/lib/tantan/LambdaCalculator.cc.o.d -o CMakeFiles/diamond.dir/src/lib/tantan/LambdaCalculator.cc.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/tantan/LambdaCalculator.cc [ 44%] Building CXX object CMakeFiles/diamond.dir/src/util/string/string.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/string/string.cpp.o -MF CMakeFiles/diamond.dir/src/util/string/string.cpp.o.d -o CMakeFiles/diamond.dir/src/util/string/string.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/string/string.cpp [ 44%] Building CXX object CMakeFiles/diamond.dir/src/align/extend.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/extend.cpp.o -MF CMakeFiles/diamond.dir/src/align/extend.cpp.o.d -o CMakeFiles/diamond.dir/src/align/extend.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/extend.cpp [ 45%] Building CXX object CMakeFiles/diamond.dir/src/test/test.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/test/test.cpp.o -MF CMakeFiles/diamond.dir/src/test/test.cpp.o.d -o CMakeFiles/diamond.dir/src/test/test.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/test/test.cpp [ 45%] Building CXX object CMakeFiles/diamond.dir/src/align/ungapped.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/ungapped.cpp.o -MF CMakeFiles/diamond.dir/src/align/ungapped.cpp.o.d -o CMakeFiles/diamond.dir/src/align/ungapped.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/ungapped.cpp [ 46%] Building CXX object CMakeFiles/diamond.dir/src/align/gapped_score.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/gapped_score.cpp.o -MF CMakeFiles/diamond.dir/src/align/gapped_score.cpp.o.d -o CMakeFiles/diamond.dir/src/align/gapped_score.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/gapped_score.cpp In file included from /usr/include/c++/15/bits/char_traits.h:59, from /usr/include/c++/15/string:44, from /usr/include/c++/15/stdexcept:41, from /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/sequence.cpp:22: In function ‘constexpr void std::_Construct(_Tp*, _Args&& ...) [with _Tp = signed char; _Args = {}]’, inlined from ‘static constexpr _ForwardIterator std::__uninitialized_default_n_1::__uninit_default_n(_ForwardIterator, _Size) [with _ForwardIterator = signed char*; _Size = long unsigned int]’ at /usr/include/c++/15/bits/stl_uninitialized.h:894:23, inlined from ‘static constexpr _ForwardIterator std::__uninitialized_default_n_1::__uninit_default_n(_ForwardIterator, _Size) [with _ForwardIterator = signed char*; _Size = long unsigned int]’ at /usr/include/c++/15/bits/stl_uninitialized.h:888:9, inlined from ‘constexpr _ForwardIterator std::__uninitialized_default_n(_ForwardIterator, _Size) [with _ForwardIterator = signed char*; _Size = long unsigned int]’ at /usr/include/c++/15/bits/stl_uninitialized.h:947:20, inlined from ‘constexpr _ForwardIterator std::__uninitialized_default_n_a(_ForwardIterator, _Size, allocator<_Tp2>&) [with _ForwardIterator = signed char*; _Size = long unsigned int; _Tp = signed char]’ at /usr/include/c++/15/bits/stl_uninitialized.h:1002:44, inlined from ‘constexpr void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = signed char; _Alloc = std::allocator]’ at /usr/include/c++/15/bits/vector.tcc:794:35, inlined from ‘constexpr void std::vector<_Tp, _Alloc>::resize(size_type) [with _Tp = signed char; _Alloc = std::allocator]’ at /usr/include/c++/15/bits/stl_vector.h:1146:21, inlined from ‘static size_t Translator::translate(const Sequence&, std::vector*)’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/translate.h:61:21, inlined from ‘std::array, 6> Util::Seq::translate(const Sequence&)’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/sequence.cpp:178:23: /usr/include/c++/15/bits/stl_construct.h:133:7: warning: writing 1 byte into a region of size 0 [-Wstringop-overflow=] 133 | ::new(static_cast(__p)) _Tp(std::forward<_Args>(__args)...); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/aarch64-linux-gnu/c++/15/bits/c++allocator.h:33, from /usr/include/c++/15/bits/allocator.h:46, from /usr/include/c++/15/string:45: In member function ‘_Tp* std::__new_allocator<_Tp>::allocate(size_type, const void*) [with _Tp = signed char]’, inlined from ‘constexpr _Tp* std::allocator< >::allocate(std::size_t) [with _Tp = signed char]’ at /usr/include/c++/15/bits/allocator.h:203:40, inlined from ‘static constexpr _Tp* std::allocator_traits >::allocate(allocator_type&, size_type) [with _Tp = signed char]’ at /usr/include/c++/15/bits/alloc_traits.h:614:28, inlined from ‘constexpr std::_Vector_base<_Tp, _Alloc>::pointer std::_Vector_base<_Tp, _Alloc>::_M_allocate(std::size_t) [with _Tp = signed char; _Alloc = std::allocator]’ at /usr/include/c++/15/bits/stl_vector.h:387:33, inlined from ‘constexpr void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = signed char; _Alloc = std::allocator]’ at /usr/include/c++/15/bits/vector.tcc:789:45, inlined from ‘constexpr void std::vector<_Tp, _Alloc>::resize(size_type) [with _Tp = signed char; _Alloc = std::allocator]’ at /usr/include/c++/15/bits/stl_vector.h:1146:21, inlined from ‘static size_t Translator::translate(const Sequence&, std::vector*)’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/translate.h:61:21, inlined from ‘std::array, 6> Util::Seq::translate(const Sequence&)’ at /build/reproducible-path/diamond-aligner-2.1.14/src/util/sequence/sequence.cpp:178:23: /usr/include/c++/15/bits/new_allocator.h:151:73: note: destination object of size 0 allocated by ‘operator new’ 151 | return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp))); | ^ [ 47%] Building CXX object CMakeFiles/diamond.dir/src/align/gapped_final.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/gapped_final.cpp.o -MF CMakeFiles/diamond.dir/src/align/gapped_final.cpp.o.d -o CMakeFiles/diamond.dir/src/align/gapped_final.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/gapped_final.cpp At global scope: cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics [ 47%] Building CXX object CMakeFiles/diamond.dir/src/align/full_db.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/full_db.cpp.o -MF CMakeFiles/diamond.dir/src/align/full_db.cpp.o.d -o CMakeFiles/diamond.dir/src/align/full_db.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/full_db.cpp [ 48%] Building CXX object CMakeFiles/diamond.dir/src/align/culling.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/culling.cpp.o -MF CMakeFiles/diamond.dir/src/align/culling.cpp.o.d -o CMakeFiles/diamond.dir/src/align/culling.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/culling.cpp [ 48%] Building CXX object CMakeFiles/diamond.dir/src/cluster/cluster_registry.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/cluster_registry.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/cluster_registry.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/cluster_registry.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/cluster_registry.cpp [ 49%] Building CXX object CMakeFiles/diamond.dir/src/cluster/cascaded/cascaded.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/cascaded/cascaded.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/cascaded/cascaded.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/cascaded/cascaded.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/cascaded/cascaded.cpp [ 50%] Building CXX object CMakeFiles/diamond.dir/src/align/output.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/output.cpp.o -MF CMakeFiles/diamond.dir/src/align/output.cpp.o.d -o CMakeFiles/diamond.dir/src/align/output.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/output.cpp [ 50%] Building CXX object CMakeFiles/diamond.dir/src/test/data.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/test/data.cpp.o -MF CMakeFiles/diamond.dir/src/test/data.cpp.o.d -o CMakeFiles/diamond.dir/src/test/data.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/test/data.cpp [ 51%] Building CXX object CMakeFiles/diamond.dir/src/test/test_cases.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/test/test_cases.cpp.o -MF CMakeFiles/diamond.dir/src/test/test_cases.cpp.o.d -o CMakeFiles/diamond.dir/src/test/test_cases.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/test/test_cases.cpp [ 51%] Building CXX object CMakeFiles/diamond.dir/src/chaining/smith_waterman.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/chaining/smith_waterman.cpp.o -MF CMakeFiles/diamond.dir/src/chaining/smith_waterman.cpp.o.d -o CMakeFiles/diamond.dir/src/chaining/smith_waterman.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/chaining/smith_waterman.cpp [ 52%] Building CXX object CMakeFiles/diamond.dir/src/output/xml_format.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/xml_format.cpp.o -MF CMakeFiles/diamond.dir/src/output/xml_format.cpp.o.d -o CMakeFiles/diamond.dir/src/output/xml_format.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/xml_format.cpp [ 52%] Building CXX object CMakeFiles/diamond.dir/src/align/gapped_filter.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/gapped_filter.cpp.o -MF CMakeFiles/diamond.dir/src/align/gapped_filter.cpp.o.d -o CMakeFiles/diamond.dir/src/align/gapped_filter.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/gapped_filter.cpp [ 53%] Building CXX object CMakeFiles/diamond.dir/src/util/parallel/filestack.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/parallel/filestack.cpp.o -MF CMakeFiles/diamond.dir/src/util/parallel/filestack.cpp.o.d -o CMakeFiles/diamond.dir/src/util/parallel/filestack.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/parallel/filestack.cpp [ 54%] Building CXX object CMakeFiles/diamond.dir/src/util/parallel/parallelizer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/parallel/parallelizer.cpp.o -MF CMakeFiles/diamond.dir/src/util/parallel/parallelizer.cpp.o.d -o CMakeFiles/diamond.dir/src/util/parallel/parallelizer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/parallel/parallelizer.cpp [ 54%] Building CXX object CMakeFiles/diamond.dir/src/util/parallel/multiprocessing.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/parallel/multiprocessing.cpp.o -MF CMakeFiles/diamond.dir/src/util/parallel/multiprocessing.cpp.o.d -o CMakeFiles/diamond.dir/src/util/parallel/multiprocessing.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/parallel/multiprocessing.cpp [ 55%] Building CXX object CMakeFiles/diamond.dir/src/tools/benchmark_io.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/tools/benchmark_io.cpp.o -MF CMakeFiles/diamond.dir/src/tools/benchmark_io.cpp.o.d -o CMakeFiles/diamond.dir/src/tools/benchmark_io.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/benchmark_io.cpp [ 55%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprob.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprob.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprob.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprob.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_dynprogprob.cpp [ 56%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogproblim.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogproblim.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogproblim.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogproblim.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_dynprogproblim.cpp [ 57%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprobproto.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprobproto.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprobproto.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprobproto.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_dynprogprobproto.cpp [ 57%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_ioutil.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_ioutil.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_ioutil.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_ioutil.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_ioutil.cpp [ 58%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstat.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstat.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstat.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstat.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_localmaxstat.cpp [ 58%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatmatrix.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatmatrix.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatmatrix.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatmatrix.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_localmaxstatmatrix.cpp [ 59%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatutil.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatutil.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatutil.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatutil.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_localmaxstatutil.cpp [ 60%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/njn_random.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/njn_random.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/njn_random.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/njn_random.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/njn_random.cpp [ 60%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_alignment_evaluer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_alignment_evaluer.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_alignment_evaluer.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_alignment_evaluer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_alignment_evaluer.cpp [ 61%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_alp.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_alp.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_alp.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_alp.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_alp.cpp [ 61%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_alp_data.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_alp_data.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_alp_data.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_data.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_alp_data.cpp [ 62%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_alp_regression.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_alp_regression.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_alp_regression.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_regression.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_alp_regression.cpp [ 63%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_alp_sim.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_alp_sim.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_alp_sim.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_sim.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_alp_sim.cpp [ 63%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_basic.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_basic.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_basic.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_basic.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_basic.cpp [ 64%] Building CXX object CMakeFiles/diamond.dir/src/lib/alp/sls_pvalues.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/alp/sls_pvalues.cpp.o -MF CMakeFiles/diamond.dir/src/lib/alp/sls_pvalues.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/alp/sls_pvalues.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/alp/sls_pvalues.cpp [ 64%] Building CXX object CMakeFiles/diamond.dir/src/align/global_ranking/global_ranking.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/global_ranking/global_ranking.cpp.o -MF CMakeFiles/diamond.dir/src/align/global_ranking/global_ranking.cpp.o.d -o CMakeFiles/diamond.dir/src/align/global_ranking/global_ranking.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/global_ranking/global_ranking.cpp [ 65%] Building CXX object CMakeFiles/diamond.dir/src/align/global_ranking/extend.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/global_ranking/extend.cpp.o -MF CMakeFiles/diamond.dir/src/align/global_ranking/extend.cpp.o.d -o CMakeFiles/diamond.dir/src/align/global_ranking/extend.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/global_ranking/extend.cpp [ 66%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/blast_seg.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/blast_seg.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/blast_seg.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/blast_seg.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/blast_seg.cpp [ 66%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/blast_filter.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/blast_filter.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/blast_filter.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/blast_filter.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/blast_filter.cpp [ 67%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/nlm_linear_algebra.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/nlm_linear_algebra.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/nlm_linear_algebra.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/nlm_linear_algebra.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/nlm_linear_algebra.cpp [ 67%] Building CXX object CMakeFiles/diamond.dir/src/stats/stats.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/stats.cpp.o -MF CMakeFiles/diamond.dir/src/stats/stats.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/stats.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/stats.cpp [ 68%] Building CXX object CMakeFiles/diamond.dir/src/stats/cbs.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/cbs.cpp.o -MF CMakeFiles/diamond.dir/src/stats/cbs.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/cbs.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/cbs.cpp [ 69%] Building CXX object CMakeFiles/diamond.dir/src/stats/comp_based_stats.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/comp_based_stats.cpp.o -MF CMakeFiles/diamond.dir/src/stats/comp_based_stats.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/comp_based_stats.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/comp_based_stats.cpp [ 69%] Building CXX object CMakeFiles/diamond.dir/src/stats/hauser_correction.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/hauser_correction.cpp.o -MF CMakeFiles/diamond.dir/src/stats/hauser_correction.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/hauser_correction.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/hauser_correction.cpp [ 70%] Building CXX object CMakeFiles/diamond.dir/src/stats/matrix_adjust.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/matrix_adjust.cpp.o -MF CMakeFiles/diamond.dir/src/stats/matrix_adjust.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/matrix_adjust.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/matrix_adjust.cpp [ 70%] Building CXX object CMakeFiles/diamond.dir/src/data/index.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/index.cpp.o -MF CMakeFiles/diamond.dir/src/data/index.cpp.o.d -o CMakeFiles/diamond.dir/src/data/index.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/index.cpp [ 71%] Building CXX object CMakeFiles/diamond.dir/src/data/dmnd/dmnd.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/dmnd/dmnd.cpp.o -MF CMakeFiles/diamond.dir/src/data/dmnd/dmnd.cpp.o.d -o CMakeFiles/diamond.dir/src/data/dmnd/dmnd.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/dmnd/dmnd.cpp [ 72%] Building CXX object CMakeFiles/diamond.dir/src/data/sequence_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/sequence_file.cpp.o -MF CMakeFiles/diamond.dir/src/data/sequence_file.cpp.o.d -o CMakeFiles/diamond.dir/src/data/sequence_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/sequence_file.cpp [ 72%] Building CXX object CMakeFiles/diamond.dir/src/tools/find_shapes.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/tools/find_shapes.cpp.o -MF CMakeFiles/diamond.dir/src/tools/find_shapes.cpp.o.d -o CMakeFiles/diamond.dir/src/tools/find_shapes.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/find_shapes.cpp [ 73%] Building CXX object CMakeFiles/diamond.dir/src/data/block/block.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/block/block.cpp.o -MF CMakeFiles/diamond.dir/src/data/block/block.cpp.o.d -o CMakeFiles/diamond.dir/src/data/block/block.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/block/block.cpp [ 73%] Building CXX object CMakeFiles/diamond.dir/src/data/block/block_wrapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/block/block_wrapper.cpp.o -MF CMakeFiles/diamond.dir/src/data/block/block_wrapper.cpp.o.d -o CMakeFiles/diamond.dir/src/data/block/block_wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/block/block_wrapper.cpp [ 74%] Building CXX object CMakeFiles/diamond.dir/src/run/config.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/run/config.cpp.o -MF CMakeFiles/diamond.dir/src/run/config.cpp.o.d -o CMakeFiles/diamond.dir/src/run/config.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/run/config.cpp [ 75%] Building CXX object CMakeFiles/diamond.dir/src/data/sequence_set.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/sequence_set.cpp.o -MF CMakeFiles/diamond.dir/src/data/sequence_set.cpp.o.d -o CMakeFiles/diamond.dir/src/data/sequence_set.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/sequence_set.cpp [ 75%] Building CXX object CMakeFiles/diamond.dir/src/align/global_ranking/table.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/global_ranking/table.cpp.o -MF CMakeFiles/diamond.dir/src/align/global_ranking/table.cpp.o.d -o CMakeFiles/diamond.dir/src/align/global_ranking/table.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/global_ranking/table.cpp [ 76%] Building CXX object CMakeFiles/diamond.dir/src/output/daa/daa_write.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/daa/daa_write.cpp.o -MF CMakeFiles/diamond.dir/src/output/daa/daa_write.cpp.o.d -o CMakeFiles/diamond.dir/src/output/daa/daa_write.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/daa/daa_write.cpp [ 76%] Building CXX object CMakeFiles/diamond.dir/src/search/seed_complexity.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/search/seed_complexity.cpp.o -MF CMakeFiles/diamond.dir/src/search/seed_complexity.cpp.o.d -o CMakeFiles/diamond.dir/src/search/seed_complexity.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/seed_complexity.cpp [ 77%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/tsv.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/tsv.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/tsv.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/tsv.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/tsv.cpp [ 77%] Building CXX object CMakeFiles/diamond.dir/src/basic/value.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/basic/value.cpp.o -MF CMakeFiles/diamond.dir/src/basic/value.cpp.o.d -o CMakeFiles/diamond.dir/src/basic/value.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/basic/value.cpp [ 78%] Building CXX object CMakeFiles/diamond.dir/src/masking/motifs.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/masking/motifs.cpp.o -MF CMakeFiles/diamond.dir/src/masking/motifs.cpp.o.d -o CMakeFiles/diamond.dir/src/masking/motifs.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/masking/motifs.cpp [ 79%] Building CXX object CMakeFiles/diamond.dir/src/align/alt_hsp.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/align/alt_hsp.cpp.o -MF CMakeFiles/diamond.dir/src/align/alt_hsp.cpp.o.d -o CMakeFiles/diamond.dir/src/align/alt_hsp.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/align/alt_hsp.cpp [ 79%] Building CXX object CMakeFiles/diamond.dir/src/data/fasta/fasta_file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/data/fasta/fasta_file.cpp.o -MF CMakeFiles/diamond.dir/src/data/fasta/fasta_file.cpp.o.d -o CMakeFiles/diamond.dir/src/data/fasta/fasta_file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/data/fasta/fasta_file.cpp [ 80%] Building CXX object CMakeFiles/diamond.dir/src/cluster/output.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/output.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/output.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/output.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/output.cpp [ 80%] Building CXX object CMakeFiles/diamond.dir/src/cluster/realign.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/realign.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/realign.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/realign.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/realign.cpp [ 81%] Building CXX object CMakeFiles/diamond.dir/src/cluster/reassign.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/reassign.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/reassign.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/reassign.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/reassign.cpp [ 82%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/read_tsv.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/read_tsv.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/read_tsv.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/read_tsv.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/read_tsv.cpp [ 82%] Building CXX object CMakeFiles/diamond.dir/src/tools/greedy_vertex_cover.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/tools/greedy_vertex_cover.cpp.o -MF CMakeFiles/diamond.dir/src/tools/greedy_vertex_cover.cpp.o.d -o CMakeFiles/diamond.dir/src/tools/greedy_vertex_cover.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/greedy_vertex_cover.cpp [ 83%] Building CXX object CMakeFiles/diamond.dir/src/cluster/cascaded/recluster.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/cascaded/recluster.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/cascaded/recluster.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/cascaded/recluster.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/cascaded/recluster.cpp [ 83%] Building CXX object CMakeFiles/diamond.dir/src/cluster/helpers.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/helpers.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/helpers.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/helpers.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/helpers.cpp [ 84%] Building CXX object CMakeFiles/diamond.dir/src/search/kmer_ranking.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/search/kmer_ranking.cpp.o -MF CMakeFiles/diamond.dir/src/search/kmer_ranking.cpp.o.d -o CMakeFiles/diamond.dir/src/search/kmer_ranking.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/kmer_ranking.cpp [ 85%] Building CXX object CMakeFiles/diamond.dir/src/chaining/hamming_ext.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/chaining/hamming_ext.cpp.o -MF CMakeFiles/diamond.dir/src/chaining/hamming_ext.cpp.o.d -o CMakeFiles/diamond.dir/src/chaining/hamming_ext.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/chaining/hamming_ext.cpp [ 85%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/blast_message.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/blast_message.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/blast_message.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/blast_message.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/blast_message.cpp [ 86%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/blast_stat.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/blast_stat.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/blast_stat.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/blast_stat.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/blast_stat.cpp [ 86%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/blastn_score.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/blastn_score.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/blastn_score.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/blastn_score.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/blastn_score.cpp [ 87%] Building CXX object CMakeFiles/diamond.dir/src/lib/blast/ncbi_std.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/lib/blast/ncbi_std.cpp.o -MF CMakeFiles/diamond.dir/src/lib/blast/ncbi_std.cpp.o.d -o CMakeFiles/diamond.dir/src/lib/blast/ncbi_std.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/lib/blast/ncbi_std.cpp [ 88%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/table.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/table.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/table.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/table.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/table.cpp [ 88%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/file.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/file.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/file.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/file.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/file.cpp [ 89%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/record.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/record.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/record.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/record.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/record.cpp [ 89%] Building CXX object CMakeFiles/diamond.dir/src/cluster/cascaded/helpers.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/cascaded/helpers.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/cascaded/helpers.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/cascaded/helpers.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/cascaded/helpers.cpp [ 90%] Building CXX object CMakeFiles/diamond.dir/src/cluster/cascaded/wrapper.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/cascaded/wrapper.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/cascaded/wrapper.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/cascaded/wrapper.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/cascaded/wrapper.cpp [ 91%] Building CXX object CMakeFiles/diamond.dir/src/output/daa/merge.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/output/daa/merge.cpp.o -MF CMakeFiles/diamond.dir/src/output/daa/merge.cpp.o.d -o CMakeFiles/diamond.dir/src/output/daa/merge.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/output/daa/merge.cpp [ 91%] Building CXX object CMakeFiles/diamond.dir/src/chaining/backtrace.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/chaining/backtrace.cpp.o -MF CMakeFiles/diamond.dir/src/chaining/backtrace.cpp.o.d -o CMakeFiles/diamond.dir/src/chaining/backtrace.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/chaining/backtrace.cpp [ 92%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/merge.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/merge.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/merge.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/merge.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/merge.cpp [ 92%] Building CXX object CMakeFiles/diamond.dir/src/util/tsv/join.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/tsv/join.cpp.o -MF CMakeFiles/diamond.dir/src/util/tsv/join.cpp.o.d -o CMakeFiles/diamond.dir/src/util/tsv/join.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/tsv/join.cpp [ 93%] Building CXX object CMakeFiles/diamond.dir/src/dp/scalar/smith_waterman.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/dp/scalar/smith_waterman.cpp.o -MF CMakeFiles/diamond.dir/src/dp/scalar/smith_waterman.cpp.o.d -o CMakeFiles/diamond.dir/src/dp/scalar/smith_waterman.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/dp/scalar/smith_waterman.cpp [ 94%] Building CXX object CMakeFiles/diamond.dir/src/tools/tsv.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/tools/tsv.cpp.o -MF CMakeFiles/diamond.dir/src/tools/tsv.cpp.o.d -o CMakeFiles/diamond.dir/src/tools/tsv.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/tools/tsv.cpp [ 94%] Building CXX object CMakeFiles/diamond.dir/src/cluster/external/external.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/external/external.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/external/external.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/external/external.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/external/external.cpp [ 95%] Building CXX object CMakeFiles/diamond.dir/src/cluster/external/align.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/external/align.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/external/align.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/external/align.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/external/align.cpp [ 95%] Building CXX object CMakeFiles/diamond.dir/src/cluster/external/cluster.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/external/cluster.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/external/cluster.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/external/cluster.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/external/cluster.cpp [ 96%] Building CXX object CMakeFiles/diamond.dir/src/cluster/external/output.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/cluster/external/output.cpp.o -MF CMakeFiles/diamond.dir/src/cluster/external/output.cpp.o.d -o CMakeFiles/diamond.dir/src/cluster/external/output.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/cluster/external/output.cpp [ 97%] Building CXX object CMakeFiles/diamond.dir/src/util/algo/pagerank.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/algo/pagerank.cpp.o -MF CMakeFiles/diamond.dir/src/util/algo/pagerank.cpp.o.d -o CMakeFiles/diamond.dir/src/util/algo/pagerank.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/pagerank.cpp [ 97%] Building CXX object CMakeFiles/diamond.dir/src/util/algo/mcl.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/util/algo/mcl.cpp.o -MF CMakeFiles/diamond.dir/src/util/algo/mcl.cpp.o.d -o CMakeFiles/diamond.dir/src/util/algo/mcl.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp [ 98%] Building CXX object CMakeFiles/diamond.dir/src/stats/blast/matrix_adjust.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/blast/matrix_adjust.cpp.o -MF CMakeFiles/diamond.dir/src/stats/blast/matrix_adjust.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/blast/matrix_adjust.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/blast/matrix_adjust.cpp [ 98%] Building CXX object CMakeFiles/diamond.dir/src/stats/blast/ncbi.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/stats/blast/ncbi.cpp.o -MF CMakeFiles/diamond.dir/src/stats/blast/ncbi.cpp.o.d -o CMakeFiles/diamond.dir/src/stats/blast/ncbi.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/stats/blast/ncbi.cpp [ 99%] Building CXX object CMakeFiles/diamond.dir/src/search/hit_buffer.cpp.o /usr/bin/c++ -DLEFTMOST_SEED_FILTER -DMAX_SHAPE_LEN=19 -DSEQ_MASK -DSTRICT_BAND -DWITH_NEON -D_ITERATOR_DEBUG_LEVEL=0 -I/build/reproducible-path/diamond-aligner-2.1.14/src -I/build/reproducible-path/diamond-aligner-2.1.14/src/lib -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -std=gnu++20 -MD -MT CMakeFiles/diamond.dir/src/search/hit_buffer.cpp.o -MF CMakeFiles/diamond.dir/src/search/hit_buffer.cpp.o.d -o CMakeFiles/diamond.dir/src/search/hit_buffer.cpp.o -c /build/reproducible-path/diamond-aligner-2.1.14/src/search/hit_buffer.cpp In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:369, from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Dense:1, from /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:1: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h: In instantiation of ‘static void Eigen::PlainObjectBase::_check_template_params() [with Derived = Eigen::Matrix]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:276:35: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>&&) [with _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 276 | Base::_check_template_params(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:35:12: required from here 35 | return result; | ^~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:102: warning: bitwise operation between different enumeration types ‘Eigen::PlainObjectBase >::’ and ‘Eigen::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:905:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 905 | EIGEN_STATIC_ASSERT((EIGEN_IMPLIES(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1, (Options&RowMajor)==RowMajor) | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:102: warning: bitwise operation between different enumeration types ‘Eigen::PlainObjectBase >::’ and ‘Eigen::StorageOptions’ is deprecated [-Wdeprecated-enum-enum-conversion] 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ~~~~~~~~^~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/util/StaticAssert.h:33:54: note: in definition of macro ‘EIGEN_STATIC_ASSERT’ 33 | #define EIGEN_STATIC_ASSERT(X,MSG) static_assert(X,#MSG); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:906:28: note: in expansion of macro ‘EIGEN_IMPLIES’ 906 | && EIGEN_IMPLIES(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1, (Options&RowMajor)==0) | ^~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:445: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::unary_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Matrix > >, Eigen::internal::IndexBased, double>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator, const Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Matrix > > >’ 90 | struct evaluator : public unary_evaluator | ^~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:349:33: required from ‘class Eigen::internal::redux_evaluator, const Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Matrix > > >’ 349 | Flags = evaluator::Flags & ~DirectAccessBit, | ^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:416:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_max_op; Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Matrix > >; typename Eigen::internal::traits::Scalar = double]’ 416 | ThisEvaluator thisEval(derived()); | ^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:438:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::maxCoeff() const [with Derived = Eigen::CwiseUnaryOp, const Eigen::CwiseBinaryOp, const Eigen::Matrix, const Eigen::Matrix > >; typename Eigen::internal::traits::Scalar = double]’ 438 | return derived().redux(Eigen::internal::scalar_max_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:55:40: required from here 55 | return ((A - B).cwiseAbs().maxCoeff() < eps); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:522:55: warning: arithmetic between different enumeration types ‘Eigen::internal::binary_evaluator, const Eigen::Matrix, const Eigen::Matrix >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>::’ and ‘Eigen::internal::functor_traits >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 522 | CoeffReadCost = evaluator::CoeffReadCost + functor_traits::Cost, | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::binary_evaluator, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:665:8: required from ‘struct Eigen::internal::evaluator, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >’ 665 | struct evaluator > | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:1338:41: required from ‘struct Eigen::internal::evaluator_wrapper_base, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ 1338 | CoeffReadCost = evaluator::CoeffReadCost, | ^~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:1405:8: required from ‘struct Eigen::internal::unary_evaluator, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >, Eigen::internal::IndexBased, double>’ 1405 | struct unary_evaluator > | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:90:8: required from ‘struct Eigen::internal::evaluator, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > > >’ 90 | struct evaluator : public unary_evaluator | ^~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:730:20: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Matrix; Src = Eigen::MatrixWrapper, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:804:27: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if<(! evaluator_assume_aliasing::value), void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::MatrixWrapper, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Func = assign_op; typename enable_if<(! evaluator_assume_aliasing::value), void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ 804 | call_assignment_no_alias(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::MatrixWrapper, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::MatrixWrapper, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; Derived = Eigen::Matrix]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:225:24: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::MatrixWrapper, const Eigen::ArrayWrapper >, const Eigen::CwiseNullaryOp, const Eigen::Array > > >; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 225 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:44:41: required from here 44 | M = M.array().pow(inflation).matrix(); | ^ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:681:51: warning: arithmetic between different enumeration types ‘Eigen::internal::evaluator_wrapper_base > >::’ and ‘Eigen::internal::evaluator, const Eigen::Array > >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 681 | CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:498: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h: In instantiation of ‘struct Eigen::internal::product_evaluator, Eigen::Matrix, 1>, 8, Eigen::DenseShape, Eigen::DenseShape, double, double>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:29:8: required from ‘struct Eigen::internal::evaluator, Eigen::Matrix, 1> >’ 29 | struct evaluator > | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:730:20: required from ‘void Eigen::internal::call_dense_assignment_loop(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::Product, Eigen::Matrix, 1>; Functor = assign_op]’ 730 | SrcEvaluatorType srcEvaluator(src); | ^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:879:31: required from ‘static void Eigen::internal::Assignment::run(DstXprType&, const SrcXprType&, const Functor&) [with DstXprType = Eigen::Matrix; SrcXprType = Eigen::Product, Eigen::Matrix, 1>; Functor = Eigen::internal::assign_op; Weak = void]’ 879 | call_dense_assignment_loop(dst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:836:49: required from ‘void Eigen::internal::call_assignment_no_alias(Dst&, const Src&, const Func&) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 1>; Func = assign_op]’ 836 | Assignment::run(actualDst, src, func); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:436:29: required from ‘static void Eigen::internal::generic_product_impl::eval_dynamic(Dst&, const LhsT&, const Rhs&, const Func&) [with Dst = Eigen::Matrix; LhsT = Eigen::Matrix; Func = Eigen::internal::assign_op; Lhs = Eigen::Matrix; Rhs = Eigen::Matrix]’ 436 | call_assignment_no_alias(dst, lhs.lazyProduct(rhs), func); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralMatrixMatrix.h:433:32: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:294:31: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const T&) [with T = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 294 | Base::template _init1(x); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:796:41: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if::value, void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>; Func = assign_op; typename enable_if::value, void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ 796 | typename plain_matrix_type::type tmp(src); | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; Derived = Eigen::Matrix]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:225:24: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 225 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:31:42: required from here 31 | if (power & 1) result = result * base; | ^~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:524:61: warning: arithmetic between different enumeration types ‘Eigen::GenericNumTraits::’ and ‘Eigen::internal::evaluator > >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 524 | : InnerSize * (NumTraits::MulCost + LhsCoeffReadCost + RhsCoeffReadCost) | ~~~~~~~~^~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:573:39: warning: arithmetic between different enumeration types ‘Eigen::internal::product_evaluator, Eigen::Matrix, 1>, 8, Eigen::DenseShape, Eigen::DenseShape, double, double>::’ and ‘Eigen::internal::packet_traits::’ is deprecated [-Wdeprecated-enum-enum-conversion] 573 | && (InnerSize % packet_traits::size == 0) | ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/Core:496: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralBlockPanelKernel.h: In instantiation of ‘void Eigen::internal::gebp_kernel::operator()(const DataMapper&, const LhsScalar*, const RhsScalar*, Index, Index, Index, ResScalar, Index, Index, Index, Index) [with LhsScalar = double; RhsScalar = double; Index = long int; DataMapper = Eigen::internal::blas_data_mapper; int mr = 6; int nr = 4; bool ConjugateLhs = false; bool ConjugateRhs = false; ResScalar = double]’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralMatrixMatrix.h:196:15: required from ‘static void Eigen::internal::general_matrix_matrix_product::run(Index, Index, Index, const LhsScalar*, Index, const RhsScalar*, Index, ResScalar*, Index, Index, ResScalar, Eigen::internal::level3_blocking&, Eigen::internal::GemmParallelInfo*) [with Index = long int; LhsScalar = double; int LhsStorageOrder = 0; bool ConjugateLhs = false; RhsScalar = double; int RhsStorageOrder = 0; bool ConjugateRhs = false; int ResInnerStride = 1; ResScalar = double]’ 196 | gebp(res.getSubMapper(i2, j2), blockA, blockB, actual_mc, actual_kc, actual_nc, alpha); | ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralMatrixMatrix.h:228:14: required from ‘void Eigen::internal::gemm_functor::operator()(Index, Index, Index, Index, Eigen::internal::GemmParallelInfo*) const [with Scalar = double; Index = long int; Gemm = Eigen::internal::general_matrix_matrix_product; Lhs = Eigen::Matrix; Rhs = Eigen::Matrix; Dest = Eigen::Matrix; BlockingType = Eigen::internal::gemm_blocking_space<0, double, double, -1, -1, -1, 1, false>]’ 228 | Gemm::run(rows, cols, m_lhs.cols(), | ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ 229 | &m_lhs.coeffRef(row,0), m_lhs.outerStride(), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 230 | &m_rhs.coeffRef(0,col), m_rhs.outerStride(), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 231 | (Scalar*)&(m_dest.coeffRef(row,col)), m_dest.innerStride(), m_dest.outerStride(), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 232 | m_actualAlpha, m_blocking, info); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/Parallelizer.h:98:7: required from ‘void Eigen::internal::parallelize_gemm(const Functor&, Index, Index, Index, bool) [with bool Condition = true; Functor = gemm_functor, Eigen::Matrix, Eigen::Matrix, Eigen::Matrix, gemm_blocking_space<0, double, double, -1, -1, -1, 1, false> >; Index = long int]’ 98 | func(0,rows, 0,cols); | ~~~~^~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralMatrixMatrix.h:487:9: required from ‘static void Eigen::internal::generic_product_impl::scaleAndAddTo(Dest&, const Lhs&, const Rhs&, const Scalar&) [with Dest = Eigen::Matrix; Lhs = Eigen::Matrix; Rhs = Eigen::Matrix; Scalar = double]’ 486 | internal::parallelize_gemm<(Dest::MaxRowsAtCompileTime>32 || Dest::MaxRowsAtCompileTime==Dynamic)> | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 487 | (GemmFunctor(lhs, rhs, dst, actualAlpha, blocking), a_lhs.rows(), a_rhs.cols(), a_lhs.cols(), Dest::Flags&RowMajorBit); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralMatrixMatrix.h:437:20: required from ‘static void Eigen::internal::generic_product_impl::evalTo(Dst&, const Lhs&, const Rhs&) [with Dst = Eigen::Matrix; Lhs = Eigen::Matrix; Rhs = Eigen::Matrix]’ 437 | scaleAndAddTo(dst, lhs, rhs, Scalar(1)); | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:148:43: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:294:31: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const T&) [with T = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 294 | Base::template _init1(x); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:796:41: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if::value, void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>; Func = assign_op; typename enable_if::value, void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ 796 | typename plain_matrix_type::type tmp(src); | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; Derived = Eigen::Matrix]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:225:24: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 225 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:31:42: required from here 31 | if (power & 1) result = result * base; | ^~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1120:22: warning: arithmetic between different enumeration types ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::operator()(const Eigen::internal::blas_data_mapper&, const double*, const double*, long int, long int, long int, ResScalar, long int, long int, long int, long int)::’ and ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 1120 | blB += pk*RhsProgress; | ~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1330:22: warning: arithmetic between different enumeration types ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::operator()(const Eigen::internal::blas_data_mapper&, const double*, const double*, long int, long int, long int, ResScalar, long int, long int, long int, long int)::’ and ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 1330 | blB += pk*RhsProgress; | ~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/products/GeneralBlockPanelKernel.h:1498:22: warning: arithmetic between different enumeration types ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::operator()(const Eigen::internal::blas_data_mapper&, const double*, const double*, long int, long int, long int, ResScalar, long int, long int, long int, long int)::’ and ‘Eigen::internal::gebp_kernel, 6, 4, false, false>::’ is deprecated [-Wdeprecated-enum-enum-conversion] 1498 | blB += pk*RhsProgress; | ~~^~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h: In instantiation of ‘struct Eigen::internal::binary_evaluator, const Eigen::Transpose, 1, -1, false> >, const Eigen::Block, -1, 1, true> >, Eigen::internal::IndexBased, Eigen::internal::IndexBased, double, double>’: /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:665:8: required from ‘struct Eigen::internal::evaluator, const Eigen::Transpose, 1, -1, false> >, const Eigen::Block, -1, 1, true> > >’ 665 | struct evaluator > | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:349:33: required from ‘class Eigen::internal::redux_evaluator, const Eigen::Transpose, 1, -1, false> >, const Eigen::Block, -1, 1, true> > >’ 349 | Flags = evaluator::Flags & ~DirectAccessBit, | ^~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:416:17: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::redux(const Func&) const [with BinaryOp = Eigen::internal::scalar_sum_op; Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose, 1, -1, false> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ 416 | ThisEvaluator thisEval(derived()); | ^~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Redux.h:453:25: required from ‘typename Eigen::internal::traits::Scalar Eigen::DenseBase::sum() const [with Derived = Eigen::CwiseBinaryOp, const Eigen::Transpose, 1, -1, false> >, const Eigen::Block, -1, 1, true> >; typename Eigen::internal::traits::Scalar = double]’ 453 | return derived().redux(Eigen::internal::scalar_sum_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/ProductEvaluators.h:578:75: required from ‘const Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::CoeffReturnType Eigen::internal::product_evaluator, ProductTag, Eigen::DenseShape, Eigen::DenseShape>::coeff(Eigen::Index, Eigen::Index) const [with Lhs = Eigen::Matrix; Rhs = Eigen::Matrix; int ProductTag = 8; typename Eigen::internal::traits::Lhs>::Scalar = double; typename Eigen::Product::Lhs = Eigen::Matrix; typename Eigen::internal::traits::Rhs>::Scalar = double; typename Eigen::Product::Rhs = Eigen::Matrix; CoeffReturnType = double; Eigen::Index = long int]’ 578 | return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum(); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:631:63: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ] /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:294:31: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::Matrix(const T&) [with T = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 294 | Base::template _init1(x); | ~~~~~~~~~~~~~~~~~~~~~~~~^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:796:41: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&, const Func&, typename enable_if::value, void*>::type) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>; Func = assign_op; typename enable_if::value, void*>::type = void*; typename evaluator_traits::Shape = Eigen::DenseShape]’ 796 | typename plain_matrix_type::type tmp(src); | ^~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/AssignEvaluator.h:782:18: required from ‘void Eigen::internal::call_assignment(Dst&, const Src&) [with Dst = Eigen::Matrix; Src = Eigen::Product, Eigen::Matrix, 0>]’ 782 | call_assignment(dst, src, internal::assign_op()); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/PlainObjectBase.h:714:32: required from ‘Derived& Eigen::PlainObjectBase::_set(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; Derived = Eigen::Matrix]’ 714 | internal::call_assignment(this->derived(), other.derived()); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/Matrix.h:225:24: required from ‘Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& Eigen::Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::operator=(const Eigen::DenseBase&) [with OtherDerived = Eigen::Product, Eigen::Matrix, 0>; _Scalar = double; int _Rows = -1; int _Cols = -1; int _Options = 0; int _MaxRows = -1; int _MaxCols = -1]’ 225 | return Base::_set(other); | ~~~~~~~~~~^~~~~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/util/algo/mcl.cpp:31:42: required from here 31 | if (power & 1) result = result * base; | ^~~~ /build/reproducible-path/diamond-aligner-2.1.14/src/lib/Eigen/src/Core/CoreEvaluators.h:681:51: warning: arithmetic between different enumeration types ‘Eigen::internal::unary_evaluator, 1, -1, false> >, Eigen::internal::IndexBased, double>::’ and ‘Eigen::internal::evaluator, -1, 1, true> >::’ is deprecated [-Wdeprecated-enum-enum-conversion] 681 | CoeffReadCost = evaluator::CoeffReadCost + evaluator::CoeffReadCost + functor_traits::Cost, | ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ cc1plus: note: unrecognized command-line option ‘-Wno-unknown-warning-option’ may have been intended to silence earlier diagnostics [100%] Linking CXX executable diamond /usr/bin/cmake -E cmake_link_script CMakeFiles/diamond.dir/link.txt --verbose=1 /usr/bin/c++ -g -O2 -ffile-prefix-map=/build/reproducible-path/diamond-aligner-2.1.14=. -fstack-protector-strong -fstack-clash-protection -Wformat -Werror=format-security -mbranch-protection=standard -Wdate-time -D_FORTIFY_SOURCE=2 -Wall -Wextra -Wno-implicit-fallthrough -Wreturn-type -Wno-unused -Wno-unused-parameter -Wno-unused-variable -Wno-uninitialized -Wno-deprecated-copy -Wno-unknown-warning-option -O3 -DNDEBUG -Wl,-z,relro -Wl,-z,now -Wl,--dependency-file=CMakeFiles/diamond.dir/link.d CMakeFiles/diamond.dir/src/run/main.cpp.o CMakeFiles/diamond.dir/src/basic/config.cpp.o CMakeFiles/diamond.dir/src/stats/score_matrix.cpp.o CMakeFiles/diamond.dir/src/data/queries.cpp.o CMakeFiles/diamond.dir/src/data/seed_histogram.cpp.o CMakeFiles/diamond.dir/src/output/daa/daa_record.cpp.o CMakeFiles/diamond.dir/src/util/command_line_parser.cpp.o CMakeFiles/diamond.dir/src/util/util.cpp.o CMakeFiles/diamond.dir/src/basic/basic.cpp.o CMakeFiles/diamond.dir/src/basic/hssp.cpp.o CMakeFiles/diamond.dir/src/dp/ungapped_align.cpp.o CMakeFiles/diamond.dir/src/run/tools.cpp.o CMakeFiles/diamond.dir/src/chaining/greedy_align.cpp.o CMakeFiles/diamond.dir/src/output/output_format.cpp.o CMakeFiles/diamond.dir/src/output/join_blocks.cpp.o CMakeFiles/diamond.dir/src/data/frequent_seeds.cpp.o CMakeFiles/diamond.dir/src/align/legacy/query_mapper.cpp.o CMakeFiles/diamond.dir/src/output/blast_tab_format.cpp.o CMakeFiles/diamond.dir/src/output/blast_pairwise_format.cpp.o CMakeFiles/diamond.dir/src/run/double_indexed.cpp.o CMakeFiles/diamond.dir/src/output/sam_format.cpp.o CMakeFiles/diamond.dir/src/align/align.cpp.o CMakeFiles/diamond.dir/src/search/setup.cpp.o CMakeFiles/diamond.dir/src/data/taxonomy.cpp.o CMakeFiles/diamond.dir/src/masking/masking.cpp.o CMakeFiles/diamond.dir/src/data/seed_set.cpp.o CMakeFiles/diamond.dir/src/util/simd.cpp.o CMakeFiles/diamond.dir/src/output/taxon_format.cpp.o CMakeFiles/diamond.dir/src/output/daa/view.cpp.o CMakeFiles/diamond.dir/src/output/output_sink.cpp.o CMakeFiles/diamond.dir/src/output/target_culling.cpp.o CMakeFiles/diamond.dir/src/align/legacy/banded_swipe_pipeline.cpp.o CMakeFiles/diamond.dir/src/util/io/compressed_stream.cpp.o CMakeFiles/diamond.dir/src/util/io/deserializer.cpp.o CMakeFiles/diamond.dir/src/util/io/file_sink.cpp.o CMakeFiles/diamond.dir/src/util/io/file_source.cpp.o CMakeFiles/diamond.dir/src/util/io/input_file.cpp.o CMakeFiles/diamond.dir/src/util/io/input_stream_buffer.cpp.o CMakeFiles/diamond.dir/src/util/io/output_file.cpp.o CMakeFiles/diamond.dir/src/util/io/output_stream_buffer.cpp.o CMakeFiles/diamond.dir/src/util/io/serializer.cpp.o CMakeFiles/diamond.dir/src/util/io/temp_file.cpp.o CMakeFiles/diamond.dir/src/util/io/text_input_file.cpp.o CMakeFiles/diamond.dir/src/data/taxon_list.cpp.o CMakeFiles/diamond.dir/src/data/taxonomy_nodes.cpp.o CMakeFiles/diamond.dir/src/lib/murmurhash/MurmurHash3.cpp.o CMakeFiles/diamond.dir/src/search/stage0.cpp.o CMakeFiles/diamond.dir/src/data/seed_array.cpp.o CMakeFiles/diamond.dir/src/output/paf_format.cpp.o CMakeFiles/diamond.dir/src/util/system/system.cpp.o CMakeFiles/diamond.dir/src/util/algo/greedy_vertex_cover.cpp.o CMakeFiles/diamond.dir/src/util/sequence/sequence.cpp.o CMakeFiles/diamond.dir/src/tools/tools.cpp.o CMakeFiles/diamond.dir/src/util/system/getRSS.cpp.o CMakeFiles/diamond.dir/src/lib/tantan/LambdaCalculator.cc.o CMakeFiles/diamond.dir/src/util/string/string.cpp.o CMakeFiles/diamond.dir/src/align/extend.cpp.o CMakeFiles/diamond.dir/src/test/test.cpp.o CMakeFiles/diamond.dir/src/align/ungapped.cpp.o CMakeFiles/diamond.dir/src/align/gapped_score.cpp.o CMakeFiles/diamond.dir/src/align/gapped_final.cpp.o CMakeFiles/diamond.dir/src/align/full_db.cpp.o CMakeFiles/diamond.dir/src/align/culling.cpp.o CMakeFiles/diamond.dir/src/cluster/cluster_registry.cpp.o CMakeFiles/diamond.dir/src/cluster/cascaded/cascaded.cpp.o CMakeFiles/diamond.dir/src/align/output.cpp.o CMakeFiles/diamond.dir/src/test/data.cpp.o CMakeFiles/diamond.dir/src/test/test_cases.cpp.o CMakeFiles/diamond.dir/src/chaining/smith_waterman.cpp.o CMakeFiles/diamond.dir/src/output/xml_format.cpp.o CMakeFiles/diamond.dir/src/align/gapped_filter.cpp.o CMakeFiles/diamond.dir/src/util/parallel/filestack.cpp.o CMakeFiles/diamond.dir/src/util/parallel/parallelizer.cpp.o CMakeFiles/diamond.dir/src/util/parallel/multiprocessing.cpp.o CMakeFiles/diamond.dir/src/tools/benchmark_io.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprob.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogproblim.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_dynprogprobproto.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_ioutil.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstat.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatmatrix.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_localmaxstatutil.cpp.o CMakeFiles/diamond.dir/src/lib/alp/njn_random.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_alignment_evaluer.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_alp.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_data.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_regression.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_alp_sim.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_basic.cpp.o CMakeFiles/diamond.dir/src/lib/alp/sls_pvalues.cpp.o CMakeFiles/diamond.dir/src/align/global_ranking/global_ranking.cpp.o CMakeFiles/diamond.dir/src/align/global_ranking/extend.cpp.o CMakeFiles/diamond.dir/src/lib/blast/blast_seg.cpp.o CMakeFiles/diamond.dir/src/lib/blast/blast_filter.cpp.o CMakeFiles/diamond.dir/src/lib/blast/nlm_linear_algebra.cpp.o CMakeFiles/diamond.dir/src/stats/stats.cpp.o CMakeFiles/diamond.dir/src/stats/cbs.cpp.o CMakeFiles/diamond.dir/src/stats/comp_based_stats.cpp.o CMakeFiles/diamond.dir/src/stats/hauser_correction.cpp.o CMakeFiles/diamond.dir/src/stats/matrix_adjust.cpp.o CMakeFiles/diamond.dir/src/data/index.cpp.o CMakeFiles/diamond.dir/src/data/dmnd/dmnd.cpp.o CMakeFiles/diamond.dir/src/data/sequence_file.cpp.o CMakeFiles/diamond.dir/src/tools/find_shapes.cpp.o CMakeFiles/diamond.dir/src/data/block/block.cpp.o CMakeFiles/diamond.dir/src/data/block/block_wrapper.cpp.o CMakeFiles/diamond.dir/src/run/config.cpp.o CMakeFiles/diamond.dir/src/data/sequence_set.cpp.o CMakeFiles/diamond.dir/src/align/global_ranking/table.cpp.o CMakeFiles/diamond.dir/src/output/daa/daa_write.cpp.o CMakeFiles/diamond.dir/src/search/seed_complexity.cpp.o CMakeFiles/diamond.dir/src/util/tsv/tsv.cpp.o CMakeFiles/diamond.dir/src/basic/value.cpp.o CMakeFiles/diamond.dir/src/masking/motifs.cpp.o CMakeFiles/diamond.dir/src/align/alt_hsp.cpp.o CMakeFiles/diamond.dir/src/data/fasta/fasta_file.cpp.o CMakeFiles/diamond.dir/src/cluster/output.cpp.o CMakeFiles/diamond.dir/src/cluster/realign.cpp.o CMakeFiles/diamond.dir/src/cluster/reassign.cpp.o CMakeFiles/diamond.dir/src/util/tsv/read_tsv.cpp.o CMakeFiles/diamond.dir/src/tools/greedy_vertex_cover.cpp.o CMakeFiles/diamond.dir/src/cluster/cascaded/recluster.cpp.o CMakeFiles/diamond.dir/src/cluster/helpers.cpp.o CMakeFiles/diamond.dir/src/search/kmer_ranking.cpp.o CMakeFiles/diamond.dir/src/chaining/hamming_ext.cpp.o CMakeFiles/diamond.dir/src/lib/blast/blast_message.cpp.o CMakeFiles/diamond.dir/src/lib/blast/blast_stat.cpp.o CMakeFiles/diamond.dir/src/lib/blast/blastn_score.cpp.o CMakeFiles/diamond.dir/src/lib/blast/ncbi_std.cpp.o CMakeFiles/diamond.dir/src/util/tsv/table.cpp.o CMakeFiles/diamond.dir/src/util/tsv/file.cpp.o CMakeFiles/diamond.dir/src/util/tsv/record.cpp.o CMakeFiles/diamond.dir/src/cluster/cascaded/helpers.cpp.o CMakeFiles/diamond.dir/src/cluster/cascaded/wrapper.cpp.o CMakeFiles/diamond.dir/src/output/daa/merge.cpp.o CMakeFiles/diamond.dir/src/chaining/backtrace.cpp.o CMakeFiles/diamond.dir/src/util/tsv/merge.cpp.o CMakeFiles/diamond.dir/src/util/tsv/join.cpp.o CMakeFiles/diamond.dir/src/dp/scalar/smith_waterman.cpp.o CMakeFiles/diamond.dir/src/tools/tsv.cpp.o CMakeFiles/diamond.dir/src/cluster/external/external.cpp.o CMakeFiles/diamond.dir/src/cluster/external/align.cpp.o CMakeFiles/diamond.dir/src/cluster/external/cluster.cpp.o CMakeFiles/diamond.dir/src/cluster/external/output.cpp.o CMakeFiles/diamond.dir/src/util/algo/pagerank.cpp.o CMakeFiles/diamond.dir/src/util/algo/mcl.cpp.o CMakeFiles/diamond.dir/src/stats/blast/matrix_adjust.cpp.o CMakeFiles/diamond.dir/src/stats/blast/ncbi.cpp.o CMakeFiles/diamond.dir/src/search/hit_buffer.cpp.o CMakeFiles/arch_generic.dir/src/dp/swipe/banded_3frame_swipe.cpp.o CMakeFiles/arch_generic.dir/src/search/stage1_2.cpp.o CMakeFiles/arch_generic.dir/src/tools/benchmark.cpp.o CMakeFiles/arch_generic.dir/src/dp/swipe/swipe_wrapper.cpp.o CMakeFiles/arch_generic.dir/src/masking/tantan.cpp.o CMakeFiles/arch_generic.dir/src/dp/scan_diags.cpp.o CMakeFiles/arch_generic.dir/src/dp/ungapped_simd.cpp.o CMakeFiles/arch_generic.dir/src/dp/swipe/anchored_wrapper.cpp.o CMakeFiles/arch_generic.dir/src/dp/score_profile.cpp.o CMakeFiles/arch_neon.dir/src/dp/swipe/banded_3frame_swipe.cpp.o CMakeFiles/arch_neon.dir/src/search/stage1_2.cpp.o CMakeFiles/arch_neon.dir/src/tools/benchmark.cpp.o CMakeFiles/arch_neon.dir/src/dp/swipe/swipe_wrapper.cpp.o CMakeFiles/arch_neon.dir/src/masking/tantan.cpp.o CMakeFiles/arch_neon.dir/src/dp/scan_diags.cpp.o CMakeFiles/arch_neon.dir/src/dp/ungapped_simd.cpp.o CMakeFiles/arch_neon.dir/src/dp/swipe/anchored_wrapper.cpp.o CMakeFiles/arch_neon.dir/src/dp/score_profile.cpp.o -o diamond /usr/lib/aarch64-linux-gnu/libz.so make[3]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' [100%] Built target diamond make[2]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' /usr/bin/cmake -E cmake_progress_start /build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu/CMakeFiles 0 make[1]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' debian/rules override_dh_auto_test make[1]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14' cd debian/tests && PATH=/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games sh diamond-calls + mktemp -d + TESTDIR=/tmp/tmp.Y5X0dBq0fp + diamond blastp --threads 1 --db test/C.faa.diamond --query test/E.faa --out /tmp/tmp.Y5X0dBq0fp/E.faa.vs.C.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0.007s] Database: test/C.faa.diamond (type: Diamond database, sequences: 109, letters: 51213) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.006s] Algorithm: Double-indexed Building query histograms... [0.019s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.005s] Initializing temporary storage... [0s] Building reference histograms... [0.017s] Allocating buffers... [0.001s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.002s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0.004s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.005s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.01s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0.009s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.015s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.013s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.012s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.008s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.609s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.131s Reported 77 pairwise alignments, 77 HSPs. 72 queries aligned. + diamond blastp --threads 1 --db test/E.faa.diamond --query test/C.faa --out /tmp/tmp.Y5X0dBq0fp/C.faa.vs.E.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0.008s] Database: test/E.faa.diamond (type: Diamond database, sequences: 72, letters: 54509) Block size = 2000000000 Opening the input file... [0.001s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.009s] Algorithm: Double-indexed Building query histograms... [0.023s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.006s] Initializing temporary storage... [0s] Building reference histograms... [0.033s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.01s] Masking low complexity seeds... [0.005s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.016s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.006s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.005s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.008s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.014s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.015s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.008s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.002s] Computing hash join... [0.008s] Masking low complexity seeds... [0.004s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.015s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.016s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.015s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0.007s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.015s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.01s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.226s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.982s Reported 41 pairwise alignments, 41 HSPs. 15 queries aligned. + diamond blastp --threads 1 --db test/C.faa.diamond --query test/L.faa --out /tmp/tmp.Y5X0dBq0fp/L.faa.vs.C.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C.faa.diamond (type: Diamond database, sequences: 109, letters: 51213) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.001s] Algorithm: Double-indexed Building query histograms... [0.023s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.005s] Initializing temporary storage... [0s] Building reference histograms... [0.018s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.011s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.01s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.01s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.014s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0.001s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.009s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.015s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.359s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.982s Reported 64 pairwise alignments, 64 HSPs. 33 queries aligned. + diamond blastp --threads 1 --db test/L.faa.diamond --query test/C.faa --out /tmp/tmp.Y5X0dBq0fp/C.faa.vs.L.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/L.faa.diamond (type: Diamond database, sequences: 40, letters: 26652) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0.004s] Masking queries... [0.003s] Algorithm: Double-indexed Building query histograms... [0.023s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.001s] Initializing temporary storage... [0s] Building reference histograms... [0.008s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0.01s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.009s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.013s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.005s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.012s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.013s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.002s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.014s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.576s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.232s Reported 133 pairwise alignments, 133 HSPs. 109 queries aligned. + diamond blastp --threads 1 --db test/C.faa.diamond --query test/M.faa --out /tmp/tmp.Y5X0dBq0fp/M.faa.vs.C.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C.faa.diamond (type: Diamond database, sequences: 109, letters: 51213) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.005s] Algorithm: Double-indexed Building query histograms... [0.02s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.005s] Initializing temporary storage... [0s] Building reference histograms... [0.033s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.012s] Computing hash join... [0.001s] Masking low complexity seeds... [0.005s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.014s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.005s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.015s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.012s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.011s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.01s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.012s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.017s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.015s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.016s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.014s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.444s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.23s Reported 62 pairwise alignments, 62 HSPs. 33 queries aligned. + diamond blastp --threads 1 --db test/M.faa.diamond --query test/C.faa --out /tmp/tmp.Y5X0dBq0fp/C.faa.vs.M.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0.006s] Database: test/M.faa.diamond (type: Diamond database, sequences: 40, letters: 26963) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.005s] Algorithm: Double-indexed Building query histograms... [0.027s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.005s] Initializing temporary storage... [0s] Building reference histograms... [0.01s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.014s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0.001s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.005s] Computing hash join... [0.01s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.015s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.009s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.002s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.008s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.012s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.535s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.185s Reported 131 pairwise alignments, 131 HSPs. 109 queries aligned. + diamond blastp --ignore-warnings --threads 1 --db test/C.faa.diamond --query test/C2.faa --out /tmp/tmp.Y5X0dBq0fp/C2.faa.vs.C.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0.001s] Database: test/C.faa.diamond (type: Diamond database, sequences: 109, letters: 51213) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.001s] Algorithm: Double-indexed Building query histograms... [0s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.002s] Initializing temporary storage... [0s] Building reference histograms... [0.009s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.015s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.012s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.005s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.001s] Masking low complexity seeds... [0.004s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0.009s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.012s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.092s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.526s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/C2.faa.diamond --query test/C.faa --out /tmp/tmp.Y5X0dBq0fp/C.faa.vs.C2.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C2.faa.diamond (type: Diamond database, sequences: 2, letters: 726) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.011s] Algorithm: Double-indexed Building query histograms... [0.028s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0s] Initializing temporary storage... [0s] Building reference histograms... [0.012s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.012s] Computing hash join... [0.002s] Masking low complexity seeds... [0.008s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.01s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0s] Building query seed array... [0.005s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0.003s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.001s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.003s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.006s] Computing hash join... [0.002s] Masking low complexity seeds... [0.006s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.01s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.002s] Computing hash join... [0.008s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.013s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.123s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.766s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/E.faa.diamond --query test/L.faa --out /tmp/tmp.Y5X0dBq0fp/L.faa.vs.E.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/E.faa.diamond (type: Diamond database, sequences: 72, letters: 54509) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.006s] Algorithm: Double-indexed Building query histograms... [0.021s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.002s] Initializing temporary storage... [0s] Building reference histograms... [0.028s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.014s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.012s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.009s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.009s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0.008s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.016s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.855s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.348s Reported 489 pairwise alignments, 489 HSPs. 32 queries aligned. + diamond blastp --threads 1 --db test/L.faa.diamond --query test/E.faa --out /tmp/tmp.Y5X0dBq0fp/E.faa.vs.L.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/L.faa.diamond (type: Diamond database, sequences: 40, letters: 26652) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0.004s] Masking queries... [0.005s] Algorithm: Double-indexed Building query histograms... [0.025s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.004s] Initializing temporary storage... [0s] Building reference histograms... [0.012s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.014s] Building query seed array... [0.005s] Computing hash join... [0.007s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.003s] Computing hash join... [0.005s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0.006s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.01s] Computing hash join... [0.008s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0.005s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.004s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.015s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.006s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.006s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [1.303s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.911s Reported 1173 pairwise alignments, 1173 HSPs. 72 queries aligned. + diamond blastp --threads 1 --db test/E.faa.diamond --query test/M.faa --out /tmp/tmp.Y5X0dBq0fp/M.faa.vs.E.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/E.faa.diamond (type: Diamond database, sequences: 72, letters: 54509) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.003s] Algorithm: Double-indexed Building query histograms... [0.011s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.002s] Initializing temporary storage... [0s] Building reference histograms... [0.02s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.012s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0.002s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0.002s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.01s] Computing hash join... [0.001s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.012s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0.003s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.002s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0.003s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.639s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.899s Reported 489 pairwise alignments, 489 HSPs. 32 queries aligned. + diamond blastp --threads 1 --db test/M.faa.diamond --query test/E.faa --out /tmp/tmp.Y5X0dBq0fp/E.faa.vs.M.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/M.faa.diamond (type: Diamond database, sequences: 40, letters: 26963) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.003s] Algorithm: Double-indexed Building query histograms... [0.017s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.003s] Initializing temporary storage... [0s] Building reference histograms... [0.011s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.002s] Computing hash join... [0.002s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.002s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.014s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.003s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.002s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.009s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.015s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.012s] Computing hash join... [0.006s] Masking low complexity seeds... [0.008s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.013s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.017s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.008s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.016s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.016s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [1.899s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 3.353s Reported 1173 pairwise alignments, 1173 HSPs. 72 queries aligned. + diamond blastp --ignore-warnings --threads 1 --db test/E.faa.diamond --query test/C2.faa --out /tmp/tmp.Y5X0dBq0fp/C2.faa.vs.E.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/E.faa.diamond (type: Diamond database, sequences: 72, letters: 54509) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0s] Algorithm: Double-indexed Building query histograms... [0.008s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.006s] Initializing temporary storage... [0s] Building reference histograms... [0.021s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0s] Computing hash join... [0.008s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.073s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.015s] Building query seed array... [0.019s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.027s] Computing hash join... [0.001s] Masking low complexity seeds... [0.006s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.004s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.034s] Building query seed array... [0.015s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.03s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.009s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.004s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.019s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.01s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.011s] Computing hash join... [0.028s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.031s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.031s] Building query seed array... [0.029s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.017s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0s] Computing hash join... [0.001s] Masking low complexity seeds... [0.008s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.006s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.005s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0.003s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.012s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.075s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.047s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/C2.faa.diamond --query test/E.faa --out /tmp/tmp.Y5X0dBq0fp/E.faa.vs.C2.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C2.faa.diamond (type: Diamond database, sequences: 2, letters: 726) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0.005s] Masking queries... [0.006s] Algorithm: Double-indexed Building query histograms... [0.022s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.002s] Initializing temporary storage... [0s] Building reference histograms... [0s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.013s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.014s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.015s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.009s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.018s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.014s] Computing hash join... [0s] Masking low complexity seeds... [0.01s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.008s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.01s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.009s] Masking low complexity seeds... [0.005s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.002s] Computing hash join... [0.001s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.015s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.007s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.005s] Computing hash join... [0.01s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.012s] Building query seed array... [0.003s] Computing hash join... [0.008s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.015s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.139s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.815s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/L.faa.diamond --query test/M.faa --out /tmp/tmp.Y5X0dBq0fp/M.faa.vs.L.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/L.faa.diamond (type: Diamond database, sequences: 40, letters: 26652) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.002s] Algorithm: Double-indexed Building query histograms... [0.024s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.004s] Initializing temporary storage... [0s] Building reference histograms... [0.022s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.016s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0.009s] Masking low complexity seeds... [0.004s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.013s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.016s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.015s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.012s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.012s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.009s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.011s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.005s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.002s] Masking low complexity seeds... [0.004s] Searching alignments... [0.015s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0.004s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.015s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.005s] Masking low complexity seeds... [0s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.011s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.013s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.016s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.007s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.012s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.012s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.012s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.014s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.011s] Masking low complexity seeds... [0.004s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.016s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.017s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.011s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.645s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.68s Reported 390 pairwise alignments, 390 HSPs. 39 queries aligned. + diamond blastp --threads 1 --db test/M.faa.diamond --query test/L.faa --out /tmp/tmp.Y5X0dBq0fp/L.faa.vs.M.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/M.faa.diamond (type: Diamond database, sequences: 40, letters: 26963) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.006s] Algorithm: Double-indexed Building query histograms... [0.018s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.004s] Initializing temporary storage... [0s] Building reference histograms... [0.013s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.01s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.001s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.001s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.001s] Computing hash join... [0.006s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.001s] Masking low complexity seeds... [0.006s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.005s] Computing hash join... [0.005s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.018s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.007s] Masking low complexity seeds... [0.001s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.013s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.007s] Masking low complexity seeds... [0.007s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.006s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.011s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.011s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.012s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.012s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.69s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 2.552s Reported 390 pairwise alignments, 390 HSPs. 40 queries aligned. + diamond blastp --ignore-warnings --threads 1 --db test/L.faa.diamond --query test/C2.faa --out /tmp/tmp.Y5X0dBq0fp/C2.faa.vs.L.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/L.faa.diamond (type: Diamond database, sequences: 40, letters: 26652) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.002s] Algorithm: Double-indexed Building query histograms... [0.008s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.004s] Initializing temporary storage... [0s] Building reference histograms... [0.026s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.001s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.008s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0.005s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.009s] Computing hash join... [0.002s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.003s] Computing hash join... [0.008s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.012s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.015s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.005s] Building query seed array... [0.015s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.01s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.073s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.707s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/C2.faa.diamond --query test/L.faa --out /tmp/tmp.Y5X0dBq0fp/L.faa.vs.C2.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C2.faa.diamond (type: Diamond database, sequences: 2, letters: 726) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.007s] Algorithm: Double-indexed Building query histograms... [0.02s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0s] Initializing temporary storage... [0s] Building reference histograms... [0.007s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.007s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.001s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.005s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0.01s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.009s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.01s] Building query seed array... [0.008s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.005s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.004s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.005s] Building query seed array... [0.006s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.002s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.006s] Computing hash join... [0.001s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.005s] Masking low complexity seeds... [0.001s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.009s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.004s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.006s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.01s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.008s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.008s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.005s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.119s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.811s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --ignore-warnings --threads 1 --db test/M.faa.diamond --query test/C2.faa --out /tmp/tmp.Y5X0dBq0fp/C2.faa.vs.M.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/M.faa.diamond (type: Diamond database, sequences: 40, letters: 26963) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.003s] Algorithm: Double-indexed Building query histograms... [0.007s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0.004s] Initializing temporary storage... [0s] Building reference histograms... [0.022s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.011s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.011s] Building query seed array... [0.002s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.01s] Computing hash join... [0.001s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.01s] Building query seed array... [0.005s] Computing hash join... [0s] Masking low complexity seeds... [0.009s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.011s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.008s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.011s] Computing hash join... [0.001s] Masking low complexity seeds... [0.01s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.001s] Building query seed array... [0.009s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.009s] Building query seed array... [0.002s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.01s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.006s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.006s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.001s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.009s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.001s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.006s] Computing hash join... [0.007s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.006s] Computing hash join... [0.007s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.008s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.002s] Computing hash join... [0.005s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.01s] Building query seed array... [0.01s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.004s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.003s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.001s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.072s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.686s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + diamond blastp --threads 1 --db test/C2.faa.diamond --query test/M.faa --out /tmp/tmp.Y5X0dBq0fp/M.faa.vs.C2.faa.diamond -e 1e-05 --outfmt 6 --sensitive diamond v2.1.14.168 (C) Max Planck Society for the Advancement of Science, Benjamin Buchfink, University of Tuebingen Documentation, support and updates available at http://www.diamondsearch.org Please cite: http://dx.doi.org/10.1038/s41592-021-01101-x Nature Methods (2021) #CPU threads: 1 Scoring parameters: (Matrix=BLOSUM62 Lambda=0.267 K=0.041 Penalties=11/1) Temporary directory: /tmp/tmp.Y5X0dBq0fp #Target sequences to report alignments for: 25 Opening the database... [0s] Database: test/C2.faa.diamond (type: Diamond database, sequences: 2, letters: 726) Block size = 2000000000 Opening the input file... [0s] Opening the output file... [0s] Loading query sequences... [0s] Masking queries... [0.011s] Algorithm: Double-indexed Building query histograms... [0.019s] Seeking in database... [0s] Loading reference sequences... [0s] Masking reference... [0s] Initializing temporary storage... [0s] Building reference histograms... [0.006s] Allocating buffers... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 1/4. Building reference seed array... [0.011s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 1/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.012s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 2/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 2/4. Building reference seed array... [0.004s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 3/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.001s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 4/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.007s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.006s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 5/16, index chunk 4/4. Building reference seed array... [0s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.003s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0.001s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0.002s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.003s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 6/16, index chunk 4/4. Building reference seed array... [0.014s] Building query seed array... [0.002s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 3/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 7/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 2/4. Building reference seed array... [0.002s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.002s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 8/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.005s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 2/4. Building reference seed array... [0s] Building query seed array... [0s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 9/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.002s] Masking low complexity seeds... [0s] Searching alignments... [0.007s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 10/16, index chunk 4/4. Building reference seed array... [0.002s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0.002s] Deallocating memory... [0.003s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.001s] Computing hash join... [0.006s] Masking low complexity seeds... [0s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.01s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 3/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 11/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.005s] Computing hash join... [0.002s] Masking low complexity seeds... [0.005s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 1/4. Building reference seed array... [0s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 2/4. Building reference seed array... [0.005s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 3/4. Building reference seed array... [0.005s] Building query seed array... [0.007s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 12/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.001s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 1/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 3/4. Building reference seed array... [0.001s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.007s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 13/16, index chunk 4/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 1/4. Building reference seed array... [0.004s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0.004s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.002s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 3/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 14/16, index chunk 4/4. Building reference seed array... [0.003s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.003s] Searching alignments... [0.006s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 1/4. Building reference seed array... [0.007s] Building query seed array... [0.008s] Computing hash join... [0s] Masking low complexity seeds... [0.002s] Searching alignments... [0.001s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 2/4. Building reference seed array... [0.007s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0.004s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.008s] Computing hash join... [0.007s] Masking low complexity seeds... [0.002s] Searching alignments... [0.003s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 15/16, index chunk 4/4. Building reference seed array... [0.011s] Building query seed array... [0.004s] Computing hash join... [0s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 1/4. Building reference seed array... [0.001s] Building query seed array... [0.001s] Computing hash join... [0.004s] Masking low complexity seeds... [0.003s] Searching alignments... [0.009s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 2/4. Building reference seed array... [0.003s] Building query seed array... [0.007s] Computing hash join... [0.003s] Masking low complexity seeds... [0.003s] Searching alignments... [0.005s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 3/4. Building reference seed array... [0s] Building query seed array... [0.006s] Computing hash join... [0.007s] Masking low complexity seeds... [0.003s] Searching alignments... [0s] Deallocating memory... [0s] Processing query block 1, reference block 1/1, shape 16/16, index chunk 4/4. Building reference seed array... [0.012s] Building query seed array... [0.004s] Computing hash join... [0.003s] Masking low complexity seeds... [0s] Searching alignments... [0s] Deallocating memory... [0s] Deallocating buffers... [0s] Clearing query masking... [0s] Computing alignments... [0.149s] Deallocating reference... [0s] Loading reference sequences... [0s] Deallocating buffers... [0s] Deallocating queries... [0s] Loading query sequences... [0s] Closing the input file... [0s] Closing the output file... [0s] Closing the database... [0s] Cleaning up... [0s] Total time = 1.572s Reported 1 pairwise alignments, 1 HSPs. 1 queries aligned. + rm -rf /tmp/tmp.Y5X0dBq0fp make[1]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14' create-stamp debian/debhelper-build-stamp dh_prep dh_auto_install --destdir=debian/diamond-aligner/ cd obj-aarch64-linux-gnu && make -j12 install DESTDIR=/build/reproducible-path/diamond-aligner-2.1.14/debian/diamond-aligner AM_UPDATE_INFO_DIR=no INSTALL="install --strip-program=true" make[1]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' /usr/bin/cmake -S/build/reproducible-path/diamond-aligner-2.1.14 -B/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu --check-build-system CMakeFiles/Makefile.cmake 0 make -f CMakeFiles/Makefile2 preinstall make[2]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' make[2]: Nothing to be done for 'preinstall'. make[2]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' Install the project... /usr/bin/cmake -P cmake_install.cmake -- Install configuration: "Release" -- Installing: /build/reproducible-path/diamond-aligner-2.1.14/debian/diamond-aligner/usr/bin/diamond make[1]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14/obj-aarch64-linux-gnu' dh_installdocs dh_installchangelogs dh_installman dh_perl dh_link dh_strip_nondeterminism debian/rules override_dh_compress make[1]: Entering directory '/build/reproducible-path/diamond-aligner-2.1.14' dh_compress --exclude=.pdf make[1]: Leaving directory '/build/reproducible-path/diamond-aligner-2.1.14' dh_fixperms dh_missing dh_dwz -a dh_strip -a dh_makeshlibs -a dh_shlibdeps -a dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 from: /lib/ld-linux-aarch64.so.1 dpkg-shlibdeps: warning: diversions involved - output may be incorrect diversion by libc6 to: /lib/ld-linux-aarch64.so.1.usr-is-merged dh_installdeb dh_gencontrol dh_md5sums dh_builddeb dpkg-deb: building package 'diamond-aligner-dbgsym' in '../diamond-aligner-dbgsym_2.1.14-1_arm64.deb'. dpkg-deb: building package 'diamond-aligner' in '../diamond-aligner_2.1.14-1_arm64.deb'. dpkg-genbuildinfo --build=binary -O../diamond-aligner_2.1.14-1_arm64.buildinfo dpkg-genchanges --build=binary -O../diamond-aligner_2.1.14-1_arm64.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env I: removing directory /srv/workspace/pbuilder/1073135 and its subdirectories I: Current time: Mon Nov 23 02:25:55 -12 2026 I: pbuilder-time-stamp: 1795443955 Tue Oct 21 08:03:18 UTC 2025 I: 1st build successful. Starting 2nd build on remote node codethink04-arm64.debian.net. Tue Oct 21 08:03:18 UTC 2025 I: Preparing to do remote build '2' on codethink04-arm64.debian.net. Tue Oct 21 08:08:41 UTC 2025 I: Deleting $TMPDIR on codethink04-arm64.debian.net. Tue Oct 21 08:08:42 UTC 2025 I: diamond-aligner_2.1.14-1_arm64.changes: Format: 1.8 Date: Fri, 17 Oct 2025 11:44:29 +0200 Source: diamond-aligner Binary: diamond-aligner diamond-aligner-dbgsym Architecture: arm64 Version: 2.1.14-1 Distribution: unstable Urgency: medium Maintainer: Debian Med Packaging Team Changed-By: Andreas Tille Description: diamond-aligner - accelerated BLAST compatible local sequence aligner Closes: 1112842 Changes: diamond-aligner (2.1.14-1) unstable; urgency=medium . * Fix build with CMake 4 Closes: #1112842 * d/watch: version=5 * New upstream version * debputy lint --auto-fix (routine-update) Checksums-Sha1: cfc7b552224bd32738fcbf70274aaf6efb08f6d7 38557188 diamond-aligner-dbgsym_2.1.14-1_arm64.deb 6ff2518037da6c1cdcab5c98b5a3527894895ca5 6019 diamond-aligner_2.1.14-1_arm64.buildinfo a288664a99300f1549dfa5d70a91daa091966b58 2019784 diamond-aligner_2.1.14-1_arm64.deb Checksums-Sha256: e06793ad56a942839029b0e0df62f255435735bbae443ddd70a81b5db7b9a10e 38557188 diamond-aligner-dbgsym_2.1.14-1_arm64.deb 0f0cc907195f27a5d43d5ff6009d612e5b34a07f3ffa62cf1d33107589689356 6019 diamond-aligner_2.1.14-1_arm64.buildinfo 41503de8f60b788b2e2277305c7dbf73e8a30501e07756955c464aa63e534603 2019784 diamond-aligner_2.1.14-1_arm64.deb Files: c3b1ec044a61d5f9b2161313fd42c043 38557188 debug optional diamond-aligner-dbgsym_2.1.14-1_arm64.deb 8d994d61cb9b4ead4a1f0261a7344c40 6019 science optional diamond-aligner_2.1.14-1_arm64.buildinfo 23a110f0938c097edb1a265e7df14a59 2019784 science optional diamond-aligner_2.1.14-1_arm64.deb Tue Oct 21 08:08:43 UTC 2025 I: diffoscope 306 will be used to compare the two builds: Running as unit: rb-diffoscope-arm64_5-124947.service; invocation ID: bdc3ac28b9164c84aa53fdcd63f95c67 # Profiling output for: /usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/diamond-aligner_2.1.14-1.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/diamond-aligner_2.1.14-1.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/diamond-aligner_2.1.14-1.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/b1/diamond-aligner_2.1.14-1_arm64.changes /srv/reproducible-results/rbuild-debian/r-b-build.ziRywyZI/b2/diamond-aligner_2.1.14-1_arm64.changes ## command (total time: 0.000s) 0.000s 1 call cmp (internal) ## has_same_content_as (total time: 0.000s) 0.000s 1 call diffoscope.comparators.binary.FilesystemFile ## main (total time: 0.003s) 0.003s 2 calls outputs 0.000s 1 call cleanup Finished with result: success Main processes terminated with: code=exited, status=0/SUCCESS Service runtime: 202ms CPU time consumed: 167ms Memory peak: 17.7M (swap: 0B) Tue Oct 21 08:08:43 UTC 2025 I: diffoscope 306 found no differences in the changes files, and a .buildinfo file also exists. Tue Oct 21 08:08:43 UTC 2025 I: diamond-aligner from forky built successfully and reproducibly on arm64. Tue Oct 21 08:08:44 UTC 2025 I: Removing signed diamond-aligner_2.1.14-1_arm64.buildinfo.asc files: removed './b1/diamond-aligner_2.1.14-1_arm64.buildinfo.asc' removed './b2/diamond-aligner_2.1.14-1_arm64.buildinfo.asc'