Mutation report for check_delayed_onset.py: 30 single-point mutants; each must exit nonzero.
baseline (unmutated): exit 0, FAIL lines 0, stdout identical to expected_stdout.txt: yes

M01 certificate data corruption: one R entry
    edit: R[17][5] real part += 2^31 (= +1/2), re-packed
    exit 1 | FAIL lines 3 | first: FAIL [C3a] Bareiss route: leading minor 36 not positive
M02 certificate data corruption: one G' entry
    edit: G'[100][37] real part += 2^12 (= +2^-12), re-packed
    exit 1 | FAIL lines 2 | first: FAIL [C3b] Gram route: ||P - G'G'^dag - 2^-14 I||_F^2 >= 2^-28 (exact): rejected
M03 certificate data corruption: raw base64
    edit: DATA_G base64 character at offset 6000 changed to 'A'
    exit 1 | FAIL lines 3 | first: FAIL [C3 data] certificates: R 144x110 over 2^-32 Z[w] (sha256 80a51490a7a429a5), G' lower-triangular 144x144 over 2^-24 Z[w] (sha256 -) decoded
M04 c0 raised to 2^-12
    edit: 'C0_LOG2 = 14 ' -> 'C0_LOG2 = 12 '
    exit 1 | FAIL lines 6 | first: FAIL [C3a] Bareiss route: leading minor 50 not positive
M05 wrong partial-transpose factor (route a, 9-dim factor)
    edit: 'return Q[i*16 + j2][i2*16 + j]' -> 'return Q[i2*16 + j][i*16 + j2]'
    exit 1 | FAIL lines 2 | first: FAIL [C3a] Bareiss route: leading minor 33 not positive
M06 wrong partial-transpose factor (route b, 9-dim factor)
    edit: 'zip(Rr[i*16 + j2], Rc[i2*16 + j])' -> 'zip(Rr[i2*16 + j], Rc[i*16 + j2])'
    exit 1 | FAIL lines 2 | first: FAIL [C3b] Gram route: ||P - G'G'^dag - 2^-14 I||_F^2 >= 2^-28 (exact): rejected
M07 partial transpose dropped (route a)
    edit: 'return Q[i*16 + j2][i2*16 + j]' -> 'return Q[I][J]'
    exit 1 | FAIL lines 2 | first: FAIL [C3a] Bareiss route: leading minor 17 not positive
M08 missing conjugate in x = conj(y) (x) v
    edit: 'z = mul(cj(y[s][s2]), v[k][k2])' -> 'z = mul(y[s][s2], v[k][k2])'
    exit 1 | FAIL lines 1 | first: FAIL [C2] W and h(y,v): W = N^dag N (144x144 over Z[w], N_ab[(s,s'),(k,k')] = K_a[s,k] K_b[s',k']); h(y,v) = sum_ab |tr(Y^dag K_a V K_b^T)|^2 equals x
M09 missing conjugate in z = u (x) conj(v)
    edit: 'mul(u[i], cj(v[j]))' -> 'mul(u[i], v[j])'
    exit 1 | FAIL lines 1 | first: FAIL [C3] conclusion: for product x = u (x) v: x^dag Q^Gamma x = z^dag Q z >= 0 with z = u (x) conj(v) (identity checked on 2 exact test vectors), so 
M10 theta_6 = 1
    edit: 'THETA_EXP = [0, 0, 0, 0, 0, 1]' -> 'THETA_EXP = [0, 0, 0, 0, 0, 0]'
    exit 1 | FAIL lines 5 | first: FAIL [C1] design: 6 pairs partition the 3x4 grid, distinct rows and columns in each pair; theta = (1,1,1,1,1,1), gauge invariant prod_p theta_p^n_p = 
M11 flipped sign in phi
    edit: 'PHI_D = [1, 1, -1, -1]' -> 'PHI_D = [1, 1, -1, 1]'
    exit 1 | FAIL lines 3 | first: FAIL [C5] three-copy witness: psi^dag (K_a x K_b x K_c) phi = 0 exactly for all 216 (a,b,c), phi ~ |000>+|111>-|222>-|333>, psi = |000>+|111>+|222> !=
M12 p-bound: 26 -> 25 on the step-(4) side only
    edit: 'RANK3 = 26 ' -> 'RANK3 = 25 '
    exit 1 | FAIL lines 4 | first: FAIL [C5] three-copy witness: psi^dag (K_a x K_b x K_c) phi = 0 exactly for all 216 (a,b,c), phi ~ |000>+|111>-|222>-|333>, psi = |000>+|111>+|222> !=
M13 p-bound: 26 -> 25 on the three-copy side only
    edit: 'r3 = 3**3 - 1 if' -> 'r3 = 3**3 - 2 if'
    exit 1 | FAIL lines 3 | first: FAIL [C5] three-copy witness: psi^dag (K_a x K_b x K_c) phi = 0 exactly for all 216 (a,b,c), phi ~ |000>+|111>-|222>-|333>, psi = |000>+|111>+|222> !=
M14 p-bound: too-large a
    edit: 'A6 = 988169' -> 'A6 = 988170'
    exit 1 | FAIL lines 3 | first: FAIL [C6a] rational bounds: mu = 2^-14/9 = 1/147456, p = 1/1000: a = 0.988170 <= mu^p < 0.988171 and b = 0.999999 <= (1-8mu)^p < 1.000000 (big-integer
M15 p-bound: too-large b
    edit: 'B6 = 999999' -> 'B6 = 1000000'
    exit 1 | FAIL lines 3 | first: FAIL [C6a] rational bounds: mu = 2^-14/9 = 1/147456, p = 1/1000: a = 0.988169 <= mu^p < 0.988170 and b = 1.000000 <= (1-8mu)^p < 1.000001 (big-integer
M16 p-bound: p = 1/1000 -> 1/100
    edit: 'P_NUM, P_DEN = 1, 1000' -> 'P_NUM, P_DEN = 1, 100'
    exit 1 | FAIL lines 5 | first: FAIL [C6a] rational bounds: mu = 2^-14/9 = 1/147456, p = 1/100: a = 0.988169 <= mu^p < 0.988170 and b = 0.999999 <= (1-8mu)^p < 1.000000 (big-integer 
M17 Gram route Frobenius comparison: < -> <=
    edit: 'return se < 1 <<' -> 'return se <= 1 <<'
    exit 1 | FAIL lines 1 | first: FAIL [C7 guard] Gram self-test: exact 2x2 decomposition P = GG^dag + I accepted; boundary ||E||_F = 1 (P = 0) and indefinite 2x2 rejected
M18 Gram route Frobenius comparison: threshold x2
    edit: '(2*ps - 2*gam), se' -> '(2*ps - 2*gam + 2), se'
    exit 1 | FAIL lines 1 | first: FAIL [C7 guard] Gram self-test: exact 2x2 decomposition P = GG^dag + I accepted; boundary ||E||_F = 1 (P = 0) and indefinite 2x2 rejected
M19 Bareiss pivot sign test: <= 0 -> < 0
    edit: 'pb != 0 or pa <= 0' -> 'pb != 0 or pa < 0'
    exit 1 | FAIL lines 1 | first: FAIL [C7 guard] Bareiss self-test: PD 2x2 accepted; indefinite 2x2 and singular PSD 2x2 rejected
M20 Bareiss rounding tolerance 2^-20 -> 2^-30
    edit: 'DELTA_LOG2 = 20 ' -> 'DELTA_LOG2 = 30 '
    exit 1 | FAIL lines 2 | first: FAIL [C3a guard] rounding: P = L/2^28 + E with L Hermitian over Z[w] and ||E||_F <= 2^-20 (exact integer comparison)
M21 negative control vector G = diag(1,1,1,-1)
    edit: 'gd = [1, 1, -1, -1]' -> 'gd = [1, 1, 1, -1]'
    exit 1 | FAIL lines 2 | first: FAIL [C4a] control theta=(1,...,1): F = I3, G = diag(1,1,-1,-1) is an exact product kernel vector there: x^dag W1 x = 0, so r2 <= 8
M22 negative control theta not all ones
    edit: 'K1 = kraus([0]*6)' -> 'K1 = kraus([0]*5 + [1])'
    exit 1 | FAIL lines 2 | first: FAIL [C4a] control theta=(1,...,1): F = I3, G = diag(1,1,-1,-1) is an exact product kernel vector there: x^dag W1 x = 0, so r2 <= 8
M23 design: one pair cell moved
    edit: '((1,3),(2,0))' -> '((1,3),(2,1))'
    exit 1 | FAIL lines 10 | first: FAIL [C1] design: 6 pairs partition the 3x4 grid, distinct rows and columns in each pair; theta = (1,1,1,1,1,w), gauge invariant prod_p theta_p^n_p = 
M24 tau eps = 2^-12 (stale root bracket; the window itself still holds at this eps)
    edit: 'EPS_LOG2 = 20;' -> 'EPS_LOG2 = 12;'
    exit 1 | FAIL lines 1 | first: FAIL [C6e] explicit tau, upper side: (1-2^-12)^p < 1.000000 and 2^(-13 p) < 0.985550 (big-integer 1000-th powers), so T <= 2.971100 and T^2 <= 8.82743
M25 tau eps = 2^-8 (stale root brackets)
    edit: 'EPS_LOG2 = 20;' -> 'EPS_LOG2 = 8;'
    exit 1 | FAIL lines 2 | first: FAIL [C6d] explicit tau, lower side: tau = diag(1-2^-8, 2^-9, 2^-9) (trace 1); c = 0.999999 <= (1-2^-8)^p and d = 0.985549 <= 2^(-9 p) (big-integer 10
M26 tau eps = 2^-8 with a fresh valid certificate (upper side genuinely broken)
    edit: tau line: eps = 2^-8 with valid root brackets RC, RD recomputed for it
    exit 1 | FAIL lines 1 | first: FAIL [C6e] explicit tau, upper side: (1-2^-8)^p < 0.999997 and 2^(-9 p) < 0.993782 (big-integer 1000-th powers), so T <= 2.987561 and T^2 <= 8.9255207
M27 tau eps = 2^-30 with a fresh valid certificate (lower side genuinely broken)
    edit: tau line: eps = 2^-30 with valid root brackets RC, RD recomputed for it
    exit 1 | FAIL lines 1 | first: FAIL [C6d] explicit tau, lower side: tau = diag(1-2^-30, 2^-31, 2^-31) (trace 1); c = 0.999999 <= (1-2^-30)^p and d = 0.978741 <= 2^(-31 p) (big-integ
M28 weakened root bound: d raised above 2^(-21/1000)
    edit: 'RD = 985549' -> 'RD = 985550'
    exit 1 | FAIL lines 1 | first: FAIL [C6d] explicit tau, lower side: tau = diag(1-2^-20, 2^-21, 2^-21) (trace 1); c = 0.999999 <= (1-2^-20)^p and d = 0.985550 <= 2^(-21 p) (big-integ
M29 weakened root bound: upper bracket of (1-2^-20)^(1/1000) too small
    edit: 'RC = 999999' -> 'RC = 999998'
    exit 1 | FAIL lines 1 | first: FAIL [C6e] explicit tau, upper side: (1-2^-20)^p < 0.999999 and 2^(-21 p) < 0.985550 (big-integer 1000-th powers), so T <= 2.971099 and T^2 <= 8.82742
M30 C6d exponent (1-p)/3 -> (1-p)/2
    edit: 'fr = q/3' -> 'fr = q/2'
    exit 1 | FAIL lines 1 | first: FAIL [C6d] explicit tau, lower side: tau = diag(1-2^-20, 2^-21, 2^-21) (trace 1); c = 0.999999 <= (1-2^-20)^p and d = 0.985549 <= 2^(-21 p) (big-integ

summary: 30/30 mutants exit nonzero; survivors: none
