find_points_work: y^2 = x^2 + 1, height 10                 12  (12 seen)
  moduli used: 4 in the first stage, 4 in both, 3 primes in the third
  the region searched: 1 interval(s), [-10, 10]
cof = NULL                                                 -2  (0 seen)
height 0                                                   -2  (0 seen)
height -7                                                  -2  (0 seen)
domain = NULL                                              -2  (0 seen)
degree 0                                                   -2  (0 seen)
degree -1                                                  -2  (0 seen)
degree 2 with c[1] = c[2] = 0 (degree 0 after stripping)   -1  (0 seen)
degree 6 after initialising for degree 3                   -3  (0 seen)
degree 3 with two leading zeros (genus drops)              -1  (0 seen)
num_inter -3                                               12  (12 seen)
b_low -2, b_high 0                                         12  (12 seen)
b_low 5, b_high 3 (only the points at infinity)             2  (2 seen)
array_size 1                                               12  (12 seen)
sturm 1000                                                 12  (12 seen)
num_primes 1000, sp2 500, sp1 600                          12  (12 seen)
  moduli used: 53 in the first stage, 53 in both
max_forbidden 1000                                         12  (12 seen)
a search with the choices left to the library              12  (12 seen)
  sp1 -1 sp2 -1 num_primes -1 max_forbidden -1 b_low 0 b_high -1 array_size 0 sturm 100 flags 0, domain unchanged, 1 interval(s) searched
RATPOINTS_NO_Y (one point of each pair)                     6  (6 seen)
RATPOINTS_NO_CHECK (the survivors, y = 0)                   6  (6 seen)
RATPOINTS_NO_REVERSE | RATPOINTS_NO_JACOBI                 12  (12 seen)
a callback that declines every point                        0  (12 seen)
a callback that stops at the first point                    1  (1 seen)
the same, on the interval [0.5, 2]                          1  (1 seen)
    (1 : 1 : 0)
    (1 : -1 : 0)
    (0 : 1 : 1)
    (0 : -1 : 1)
    (-4 : 5 : 3)
    (-4 : -5 : 3)
    (3 : 5 : 4)
    (3 : -5 : 4)
y^2 = x^2 + 1 on [-2, -1] U [0, 1]                          8  (8 seen)
  the region searched: 2 interval(s)
find_points: y^2 = x^5 + 1, height 30                       4  (4 seen)
find_points: y^2 = (x^2 + 1)(x^4 + 1), height 30            8  (8 seen)
    (1 : 1 : 0)
    (1 : -1 : 0)
    (0 : 1 : 1)
    (0 : -1 : 1)
the same on [-0.5, 0.5]                                     4  (4 seen)
y^2 = x^2 + 1, height 2000, one thread                   2852  (2852 seen)
the same on three threads                                2852  (2852 seen)
  num_threads after the search: 3
  the two runs: 2852 and 2852 points, the same in the same order
(x^2 + 1)(x^4 + 1), height 3000, one thread                 8  (8 seen)
the same on three threads                                   8  (8 seen)
  the two runs: 8 and 8 points, the same in the same order
x^5 + 1, height 500, stop at the first point, one thread    1  (1 seen)
the same on three threads                                   1  (1 seen)
  the two runs: 1 and 1 points, the same in the same order
the survivors (RATPOINTS_NO_CHECK), height 300, one thread  218  (218 seen)
the same on three threads                                 218  (218 seen)
  the two runs: 218 and 218 points, the same in the same order
as many threads as there are processors                  2852  (2852 seen)
two threads after the pool of three                      2852  (2852 seen)
and one thread after that                                2852  (2852 seen)
  the two runs: 2852 and 2852 points, the same in the same order
find_points on four threads (the pool made and freed inside)    8  (8 seen)
