r2_check.py (verification run 2); Python 3.13.5; parts 012345; back end both; PB = 320
============================================================================================================
N700-B:  N = 700;  Sigma* = 1/2 (computed);  nu = 141/19600000, x0 = 1/100, X = 1001137518398439861899/1000000000000000000000, rho = 7698967720440356451097/1000000000000000000000000000
  [1] (2), (3), (4) vanish exactly at the six states of Lemma 3.2, all C_j > 0, Sigma = Sigma*, feasible: True;  signs of the right-hand side of (1): + - + - + -   PASS
  [2] signs of P at the six test points: + - + - + -   PASS   (integers chat_1, that_0 of 16916 to 55095 bits)
      time: 1.1 s
  [3] Lemma 4.1 (PB = 320): 3446 closed intervals cover [x0, X]: 3420 without a root, 26 monotone; deepest bisection 26, 6863 point evaluations, smallest interval 1.48e-08
      roots of P in [x0, X]: 5, all simple;  signs of P': - + - + -   PASS   (one in each interval between consecutive test points: True)
        root 1:  x in (0.9835519215772500, 0.9835519511154499),  S in (0.9735519215772500, 0.9735519511154499)
        root 2:  x in (0.9845664553585304, 0.9845664701276302),  S in (0.9745664553585304, 0.9745664701276303)
        root 3:  x in (0.9860360694158590, 0.9860360841849589),  S in (0.9760360694158590, 0.9760360841849589)
        root 4:  x in (0.9872203296934995, 0.9872203444625994),  S in (0.9772203296934995, 0.9772203444625994)
        root 5:  x in (0.9888923985726263, 0.9888925167254258),  S in (0.9788923985726264, 0.9788925167254258)
      time: 8.4 s
  [4] coefficients of a positive multiple of P: degree 701, up to 17054 bits   (time: 0.6 s)
      Horner values of the coefficient list at the six test points equal the values of the recursion: True
      back end python-flint 0.9.0: 13 intervals between x0 and X, sign changes: 0 0 0 0 0 0 1 1 0 1 1 1 0
      cut points: 1/2, 4/5, 9/10, 19/20, 49/50, 491/500, 123/125, 197/200, 493/500, 987/1000, 247/250, 99/100
      every interval has 0 or 1 sign changes: True;  number of roots of P in (x0, X): 5   PASS   (time: 4.4 s)
      each root interval of part [3] lies in one of the five intervals with one sign change: True
      back end plain Python integers: 13 intervals between x0 and X, sign changes: 0 0 0 0 0 0 1 1 0 1 1 1 0
      cut points: 1/2, 4/5, 9/10, 19/20, 49/50, 491/500, 123/125, 197/200, 493/500, 987/1000, 247/250, 99/100
      every interval has 0 or 1 sign changes: True;  number of roots of P in (x0, X): 5   PASS   (time: 9.4 s)
      each root interval of part [3] lies in one of the five intervals with one sign change: True
  [5] gcd(P, P') is constant (all complex roots of P are simple): True   PASS   (time: 0.0 s)
  N700-B: ALL EXECUTED PARTS PASS   (total 24.8 s)
============================================================================================================
1 parameter points: ALL PASS
