Average Error: 64.0 → 64.0
Time: 4.7s
Precision: 64
\[1.899999999999999911182158029987476766109 \le t \le 2.100000000000000088817841970012523233891\]
\[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]
↓
\[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]
1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}
↓
1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}
double f(double t) {
        double r46828 = 1.7e+308;
        double r46829 = t;
        double r46830 = r46828 * r46829;
        double r46831 = r46830 - r46828;
        return r46831;
}
↓
double f(double t) {
        double r46832 = 1.7e+308;
        double r46833 = t;
        double r46834 = r46832 * r46833;
        double r46835 = r46834 - r46832;
        return r46835;
}

Error

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original64.0
Target0
Herbie64.0
\[\mathsf{fma}\left(1.699999999999999938830795788659981743333 \cdot 10^{308}, t, -1.699999999999999938830795788659981743333 \cdot 10^{308}\right)\]

Derivation

  1. Initial program 64.0

    \[1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]

  2. Final simplification64.0

    \[\leadsto 1.699999999999999938830795788659981743333 \cdot 10^{308} \cdot t - 1.699999999999999938830795788659981743333 \cdot 10^{308}\]

Reproduce

herbie shell --seed 2019326 
(FPCore (t)
  :name "fma_test2"
  :precision binary64
  :pre (<= 1.9 t 2.1)

  :herbie-target
  (fma 1.7e+308 t (- 1.7e+308))

  (- (* 1.7e+308 t) 1.7e+308))