| Jason Moxham on Fri, 03 Jul 2009 19:09:25 +0200 |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: Some bugs? |
To: <pari-dev@list.cr.yp.to> Sent: Friday, July 03, 2009 4:47 PM Subject: Re: Some bugs?
On Fri, Jul 03, 2009 at 04:12:26PM +0100, Jason Moxham wrote:I'll have a look at the others when I boot back to linux , I've just run the test under MSVC , and now I've got a lot errors to deal with , although most look fairly trivial , ie stacksize changesThat was with pari-2.4.2-alpha , I've tried the same with pari-svn and get a completely different set of errors , eg *** at top-level: setrand(1);bnf=bnfinit(x^2+105) *** ^---------------- *** bnfinit: bug in PARI/GP (Segmentation Fault), please report *** at top-level: for(i=1,1000,do(i)) *** ^------ *** in function do: my(t=bnfisintnorm(bnf,i)) *** ^-------------------- *** bnfisintnorm: please apply nfinit first. *** at top-level: setrand(1);bnf=bnfinit(x^2-65) *** ^--------------- *** bnfinit: bug in PARI/GP (Segmentation Fault), please report *** at top-level: for(i=1,1000,do(i-500)) *** ^---------- *** in function do: my(t=bnfisintnorm(bnf,i)) *** ^-------------------- *** bnfisintnorm: please apply nfinit first. *** at top-level: setrand(1);bnf=bnfinit(x^5-37) *** ^--------------- *** bnfinit: bug in PARI/GP (Segmentation Fault), please report *** at top-level: for(i=1,1000,do(i-500)) *** ^---------- *** in function do: my(t=bnfisintnorm(bnf,i)) *** ^-------------------- *** bnfisintnorm: please apply nfinit first. *** at top-level: bnfisintnorm(bnfinit(x^3+5),5) It looks like all the number field functions cant be found , everything compiles allright , and a lot of BASIC stuff works fine . Clearly I missed something.Looking at this excerpt, bnfinit fails with a SEGV, so all function that needthe output of bnfinit also fail. Try to do \g1 bnfinit(x^2+105); and let us now what that outputs. Cheers, Bill.
This is MSVC build on pari-2.4.2 just to show it works....
C:\Users\jasonadmin\pari-2.4.2-alpha-msvc32nogmp\src\pari_patches>gp
GP/PARI CALCULATOR Version 2.4.2 (development CHANGES-1.1969)
ix86 running Windows 3.2 (ix86 kernel) 32-bit version
compiled: Jul 3 2009, MSVC-1500
(readline not compiled in, extended help not enabled)
Copyright (C) 2000-2006 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 = 4000000, primelimit = 500000
? bnfinit(x^2+105)
%1 = [[2, 0, 0; 0, 2, 0; 0, 0, 2], [1, 1, 1, 0, 0, 0, 1; 1, 1, 0, 1, 0, 1,
0; 1,
0, 1, 1, 1, 0, 0], [;], Mat([0.E-37 + 8.680440892848727768120953206*I,
0.E-37 +
10.75052560806965122274788703*I, 0.E-37 + 11.42712797621331226724875481*I,
0.E-
37 + 12.28745458497605239059615414*I, 0.E-37 +
3.432297943279603018509133350*I,
0.E-37 + 3.770599127351433540759567240*I, 0.E-37 +
7.947234138551688506535677533
*I, 0, 0, 0.E-37]), [[11, [7, 1]~, 1, 1, [4, -105; 1, 4]], [13, [-5, 1]~, 1,
1,
[5, -105; 1, 5]], [19, [-3, 1]~, 1, 1, [3, -105; 1, 3]], [2, [1, 1]~, 2, 1,
[1,
-105; 1, 1]], [3, [0, 1]~, 2, 1, [0, -105; 1, 0]], [5, [0, 1]~, 2, 1,
[0, -105;
1, 0]], [7, [0, 1]~, 2, 1, [0, -105; 1, 0]], [19, [3, 1]~, 1, 1, [-3, -105;
1, -
3]], [13, [5, 1]~, 1, 1, [-5, -105; 1, -5]], [11, [15, 1]~, 1, 1, [-4, -105;
1,
-4]]], 0, [x^2 + 105, [0, 1], -420, 1, [Mat([1, 0.E-38 -
10.24695076595959838322
103868*I]), [1, -10.24695076595959838322103868; 1,
10.24695076595959838322103868
], 0, [2, 0; 0, -210], [210, 0; 0, 2], [105, 0; 0, -1], [105, [0, -105; 1,
0]]],
[0.E-38 - 10.24695076595959838322103868*I], [1, x], [1, 0; 0, 1], [1, 0,
0, -10
5; 0, 1, 1, 0]], [[8, [2, 2, 2], [[11, 7; 0, 1], [10, 5; 0, 1], [6, 3; 0,
1]]],
1, 1, [2, -1], []], [[-1, 0, 0; 0, -1, 0; 0, 0, -1],
[[-4.7957905455967410881238
87156 + 2.397255585669141291195666440*I], [-4.867534450455582420071478896 +
2.23
3670150445032372911300130*I], [-4.736198448394495460821504790 +
2.57197133451686
2895161734020*I]], [[-9.591581091193482176247774311 -
3.885929721510445185729620
327*I], [-9.735068900911164840142957792 - 6.283185307179586476925286767*I],
[-9.
472396896788990921643009580 - 6.283185307179586476925286767*I]]], 0] ? \g1 debug = 1 ? bnfinit(x^2+105) Time disc. factorisation: 0 Treating p^k = 2^2 Time round4: 0 get_red_G: starting LLL, prec = 4 (4 + 0) Time LLL basis: 0 Time mult. table: 0 Time matrices: 0 smallvectors looking for norm < 2.000015259 Time initalg & rootsof1: 0 R1 = 0, R2 = 1 D = 420 *** Bach constant: 0.300000 LIMC = 20, LIMC2 = 20 Time factor base: 0 Time sub factorbase (3 elements): 0 KCZ = 7, KC = 10, n = 15 1 2 3 4 5 6 7 #### Looking for 15 relations (small norms) 8 9 10 11 12 13 14 15 Time small norm relations: 0 small norms gave 15 relations. nb. fact./nb. small norm = 8/14 = 0.571 Time hnfspec [10 x 15] --> [3 x 8]: 0 #### Computing regulator multiple #### Tentative class number: 16 #### Computing check Time bestappr/regulator: 15 #### Tentative regulator : 1 ***** check = 2.071754 Computing powers for subFB: Vecsmall([5, 7, 9]) Time powFBgen: 0 (more relations needed: 1) ++++ cglob = 19: new relation (need 16) rel = 1^1 5^1 7^1 9^1 Time for this relation: 0 Time hnfadd (4 + 4): 0 #### Computing regulator multiple #### Tentative class number: 8 #### Computing check Time bestappr/regulator: 0 #### Tentative regulator : 1 ***** check = 1.035877 Time cleanarch: 0 #### Computing fundamental units #### Computing class group generators Time classgroup generators: 0%2 = [[2, 0, 0; 0, 2, 0; 0, 0, 2], [1, 1, 1, 0, 0, 0, 1; 1, 1, 0, 1, 0, 1, 0; 1, 0, 1, 1, 1, 0, 0], [;], Mat([0.E-37 + 8.680440892848727768120953206*I, 0.E-37 + 10.75052560806965122274788703*I, 0.E-37 + 11.42712797621331226724875481*I, 0.E- 46 + 12.28745458497605239059615414*I, 0.E-37 + 3.432297943279603018509133350*I, 0.E-38 + 3.770599127351433540759567240*I, 0.E-37 + 7.947234138551688506535677533 *I, 0, 0, 0.E-37]), [[11, [7, 1]~, 1, 1, [4, -105; 1, 4]], [13, [-5, 1]~, 1, 1, [5, -105; 1, 5]], [19, [-3, 1]~, 1, 1, [3, -105; 1, 3]], [2, [1, 1]~, 2, 1, [1, -105; 1, 1]], [3, [0, 1]~, 2, 1, [0, -105; 1, 0]], [5, [0, 1]~, 2, 1, [0, -105; 1, 0]], [7, [0, 1]~, 2, 1, [0, -105; 1, 0]], [19, [3, 1]~, 1, 1, [-3, -105; 1, - 3]], [13, [5, 1]~, 1, 1, [-5, -105; 1, -5]], [11, [15, 1]~, 1, 1, [-4, -105; 1, -4]]], 0, [x^2 + 105, [0, 1], -420, 1, [Mat([1, 0.E-38 - 10.24695076595959838322 103868*I]), [1, -10.24695076595959838322103868; 1, 10.24695076595959838322103868 ], 0, [2, 0; 0, -210], [210, 0; 0, 2], [105, 0; 0, -1], [105, [0, -105; 1, 0]]], [0.E-38 - 10.24695076595959838322103868*I], [1, x], [1, 0; 0, 1], [1, 0, 0, -10 5; 0, 1, 1, 0]], [[8, [2, 2, 2], [[11, 7; 0, 1], [10, 5; 0, 1], [6, 3; 0, 1]]], 1, 1, [2, -1], []], [[-1, 0, 0; 0, -1, 0; 0, 0, -1], [[-4.7957905455967410881238 87156 + 2.397255585669141291195666440*I], [-4.867534450455582420071478896 + 2.23 3670150445032372911300130*I], [-4.736198448394495460821504790 + 2.57197133451686 2895161734020*I]], [[-9.591581091193482176247774311 - 3.885929721510445185729620 327*I], [-9.735068900911164840142957792 - 6.283185307179586476925286767*I], [-9.
472396896788990921643009580 - 6.283185307179586476925286767*I]]], 0]
?
and here is parisvn with MSVC32 no GMP
C:\Users\jasonadmin\parisvn-msvc32nogmp>gp
GP/PARI CALCULATOR Version 2.4.3 (development svn-11782)
ix86 running Windows 3.2 (ix86 kernel) 32-bit version
compiled: Jul 3 2009, MSVC-1500
(readline not compiled in, extended help not enabled)
Copyright (C) 2000-2008 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 = 4000000, primelimit = 500509 ? bnfinit(x^2+105) *** at top-level: bnfinit(x^2+105) *** ^---------------- *** bnfinit: bug in PARI/GP (Segmentation Fault), please report*** Break loop: type <Return> three times, or Control-d, to go back to GP)
break> \g1 debug = 1 break> bnfinit(x^2+105) Time disc. factorisation: 0 Treating p^k = 2^2 Time round4: 0 get_red_G: starting LLL, prec = 4 (4 + 0) Time LLL basis: 0 Time mult. table: 0 Time matrices: 0 Time nfinit & rootsof1: 0 R1 = 0, R2 = 1 D = 420 LIMC = 20, LIMC2 = 20 Time factor base: 0 Time sub factorbase (3 elements): 0 KCZ = 7, KC = 10, n = 15 1 2 3 4 5 6 7 #### Looking for 15 relations (small norms) *** at top-level: bnfinit(x^2+105) *** ^---------------- *** bnfinit: bug in PARI/GP (Segmentation Fault), please report*** Break loop: type <Return> three times, or Control-d, to go back to GP)
break> Thanks Jason