Average Error: 0.0 → 0.0
Time: 11.4s
Precision: 64
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
↓
\[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
↓
\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)
double f(double c) {
        double r16242 = c;
        double r16243 = sinh(r16242);
        double r16244 = -2.9807307601812193e+165;
        double r16245 = 2.0;
        double r16246 = pow(r16244, r16245);
        double r16247 = r16242 - r16246;
        double r16248 = fmod(r16243, r16247);
        return r16248;
}
↓
double f(double c) {
        double r16249 = c;
        double r16250 = sinh(r16249);
        double r16251 = -2.9807307601812193e+165;
        double r16252 = 2.0;
        double r16253 = pow(r16251, r16252);
        double r16254 = r16249 - r16253;
        double r16255 = fmod(r16250, r16254);
        return r16255;
}

Error

Bits error versus c

Derivation

  1. Initial program 0.0

    \[\left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]

  2. Final simplification0.0

    \[\leadsto \left(\left(\sinh c\right) \bmod \left(c - {\left( -2.980730760181219266293799099291950778447 \cdot 10^{165} \right)}^{2}\right)\right)\]

Reproduce

herbie shell --seed 2019350 +o rules:numerics
(FPCore (c)
  :name "Random Jason Timeout Test 002"
  :precision binary64
  (fmod (sinh c) (- c (pow -2.9807307601812193e+165 2))))