troubleshooting with bnfcertify under Linux/x86-64

[Philippe Elbaz-Vincent <pev@math.univ-montp2.fr>]

Hi,


I have the following 'behavior'

                   GP/PARI CALCULATOR Version 2.2.10 (development CHANGES-1.1175)
                         amd64 running linux (x86-64 kernel) 64-bit version
                                compiled: Mar 14 2005, gcc-gcc 3.3.5
                          (readline v4.3 enabled, extended help available)

                                  Copyright (C) 2003 The PARI Group

PARI/GP is free software, covered by the GNU General Public License, and
comes WITHOUT ANY
WARRANTY WHATSOEVER.

Type ? for help, \q to quit.
Type ?12 for how to get moral (and possibly technical) support.

parisize = 300000000, primelimit = 1000000
gp > K=bnfinit(T^8 + T^6 + 6*T^4 - 4*T^2 + 1,1);
time = 39 ms.
gp > bnfcertify(K)
zsh: 14145 segmentation fault  /usr/local/devel/bin/gp

I have the same behavior with 2.2.10 (development CHANGES-1.1169)
and I have tried gcc-3.3.5, gcc-3.4.3 and the last snapshot (prerelease)
of gcc-4.0.0 with default compilation flag of PARI.
With 2.2.10 (development CHANGES-1.1106) I do not have a segfault but an
infinite loop, but basically it is quite reproducible.
Apparently it works fine on my 32bits machines.

Is it the expected behavior ? >;->

Cheers, Philippe.


I3M, UMR CNRS 5149, CC51, Université Montpellier II.
E-mail: pev@math.univ-montp2.fr     | Phone: +33 (0)467143958
http://www.math.univ-montp2.fr/~pev | Fax: +33 (0)467143558