Settings: Output files: "./col_0.TOnovel/tmp/segment_juncs.*.ebwt" Line rate: 6 (line is 64 bytes) Lines per side: 1 (side is 64 bytes) Offset rate: 5 (one in 32) FTable chars: 10 Strings: unpacked Max bucket size: default Max bucket size, sqrt multiplier: default Max bucket size, len divisor: 4 Difference-cover sample period: 1024 Endianness: little Actual local endianness: little Sanity checking: disabled Assertions: disabled Random seed: 0 Sizeofs: void*:8, int:4, long:8, size_t:8 Input files DNA, FASTA: ./col_0.TOnovel/tmp/segment_juncs.fa Reading reference sizes Time reading reference sizes: 00:00:00 Calculating joined length Writing header Reserving space for joined string Joining reference sequences Time to join reference sequences: 00:00:00 bmax according to bmaxDivN setting: 33 Using parameters --bmax 25 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 25 --dcv 1024 Constructing suffix-array element generator Building DifferenceCoverSample Building sPrime Building sPrimeOrder V-Sorting samples V-Sorting samples time: 00:00:00 Allocating rank array Ranking v-sort output Ranking v-sort output time: 00:00:00 Invoking Larsson-Sadakane on ranks Invoking Larsson-Sadakane on ranks time: 00:00:00 Sanity-checking and returning Building samples Reserving space for 12 sample suffixes Generating random suffixes QSorting 12 sample offsets, eliminating duplicates QSorting sample offsets, eliminating duplicates time: 00:00:00 Multikey QSorting 11 samples (Using difference cover) Multikey QSorting samples time: 00:00:00 Calculating bucket sizes Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Avg bucket size: 18 (target: 24) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 21 (Using difference cover) Sorting block time: 00:00:00 Returning block of 22 Getting block 2 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 22 (Using difference cover) Sorting block time: 00:00:00 Returning block of 23 Getting block 3 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 18 (Using difference cover) Sorting block time: 00:00:00 Returning block of 19 Getting block 4 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 18 (Using difference cover) Sorting block time: 00:00:00 Returning block of 19 Getting block 5 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 15 (Using difference cover) Sorting block time: 00:00:00 Returning block of 16 Getting block 6 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 16 (Using difference cover) Sorting block time: 00:00:00 Returning block of 17 Getting block 7 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 16 (Using difference cover) Sorting block time: 00:00:00 Returning block of 17 Exited Ebwt loop fchr[A]: 0 fchr[C]: 29 fchr[G]: 58 fchr[T]: 85 fchr[$]: 132 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4194787 bytes to primary EBWT file: ./col_0.TOnovel/tmp/segment_juncs.1.ebwt Wrote 24 bytes to secondary EBWT file: ./col_0.TOnovel/tmp/segment_juncs.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 132 bwtLen: 133 sz: 33 bwtSz: 34 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 5 offsSz: 20 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 1 numSides: 2 numLines: 2 ebwtTotLen: 128 ebwtTotSz: 128 reverse: 0 Total time for call to driver() for forward index: 00:00:00 Reading reference sizes Time reading reference sizes: 00:00:00 Calculating joined length Writing header Reserving space for joined string Joining reference sequences Time to join reference sequences: 00:00:00 bmax according to bmaxDivN setting: 33 Using parameters --bmax 25 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 25 --dcv 1024 Constructing suffix-array element generator Building DifferenceCoverSample Building sPrime Building sPrimeOrder V-Sorting samples V-Sorting samples time: 00:00:00 Allocating rank array Ranking v-sort output Ranking v-sort output time: 00:00:00 Invoking Larsson-Sadakane on ranks Invoking Larsson-Sadakane on ranks time: 00:00:00 Sanity-checking and returning Building samples Reserving space for 12 sample suffixes Generating random suffixes QSorting 12 sample offsets, eliminating duplicates QSorting sample offsets, eliminating duplicates time: 00:00:00 Multikey QSorting 11 samples (Using difference cover) Multikey QSorting samples time: 00:00:00 Calculating bucket sizes Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Split 2, merged 5; iterating... Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Split 2, merged 2; iterating... Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Avg bucket size: 18 (target: 24) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 21 (Using difference cover) Sorting block time: 00:00:00 Returning block of 22 Getting block 2 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 24 (Using difference cover) Sorting block time: 00:00:00 Returning block of 25 Getting block 3 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 16 (Using difference cover) Sorting block time: 00:00:00 Returning block of 17 Getting block 4 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 19 (Using difference cover) Sorting block time: 00:00:00 Returning block of 20 Getting block 5 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 9 (Using difference cover) Sorting block time: 00:00:00 Returning block of 10 Getting block 6 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 19 (Using difference cover) Sorting block time: 00:00:00 Returning block of 20 Getting block 7 of 7 Reserving size (25) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 18 (Using difference cover) Sorting block time: 00:00:00 Returning block of 19 Exited Ebwt loop fchr[A]: 0 fchr[C]: 29 fchr[G]: 58 fchr[T]: 85 fchr[$]: 132 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4194787 bytes to primary EBWT file: ./col_0.TOnovel/tmp/segment_juncs.rev.1.ebwt Wrote 24 bytes to secondary EBWT file: ./col_0.TOnovel/tmp/segment_juncs.rev.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 132 bwtLen: 133 sz: 33 bwtSz: 34 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 5 offsSz: 20 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 1 numSides: 2 numLines: 2 ebwtTotLen: 128 ebwtTotSz: 128 reverse: 0 Total time for backward call to driver() for mirror index: 00:00:00