[wontfix] GCC 4.1.2, 4.2.0, 4.2.1, 4.2.2 miscompile CADO-NFS

Imported issue: Initially reported by @zimmerma in https://gforge.inria.fr/tracker/?group_id=2065&aid=14490

---

This was reported by Sam Wagstaff, and confirmed on gcc10.fsffrance.org, with GCC 4.1.2. GCC 4.2.0, 4.2.1, 4.2.2 also fail (see details below).

zimmerma@gcc10:~/cado-nfs-1.1$ build/gcc10/sieve/las -poly c143.poly -fb c143.roots -q0 32341742 -q1 32513060
# (a55366a) build/gcc10/sieve/las -poly c143.poly -fb c143.roots -q0 32341742 -q1 32513060
# Compiled with gcc 4.1.2
# Compilation flags -std=c99 -g -W -Wall -O2
# SSE_NORM_INIT is activated
# Sieving parameters: rlim=10000000 alim=20000000 lpbr=29 lpba=29
#                     mfbr=58 mfba=87 rlambda=2.1 alambda=3.2
#                     skewness=244227.6
# Alg. side: log2(maxnorm)=259.60 logbase=2.042823 bound=92
# Rat. side: log2(maxnorm)=105.97 logbase=1.338557 bound=148
# bucket_region = 65536
# nb_buckets = 128
# bucket_limit = 36891
# Reading algebraic factor base of 17Mb took 4.9s
# Creating rational factor base of 12Mb took 0.8s
# Number of primes in algebraic factor base = 1272138
# Number of bucket-sieved primes in algebraic factor base per thread = 1271536
# Inverse sum of bucket-sieved primes in algebraic factor base per thread = 0.69678 [hit jitter 0.00%]
# Number of primes in rational factor base = 664579
# Number of bucket-sieved primes in rational factor base per thread = 664015
# Inverse sum of bucket-sieved primes in rational factor base per thread = 0.65940 [hit jitter 0.00%]
#
### q=32341753: root 6172465
# Sieving q=32341753; rho=6172465; a0=1479428; b0=-5; a1=3213609; b1=11
las: /home/zimmerma/cado-nfs-1.1/utils/modredc_15ul.h:350: modredc15ul_intmod: Assertion `t2[1] == 0' failed.
Aborted