Kahan p13 Example 1

Time bar (total: 1.2s)

start0.0ms (0%)

Memory
0.2MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze3.0ms (0.3%)

Memory
6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
0%0%100%0%0%0%0%1
50%50%50%0%0%0%0%2
75%75%25%0%0%0%0%3
87.5%87.5%12.5%0%0%0%0%4
93.8%93.7%6.2%0%0%0%0%5
96.9%96.8%3.1%0%0%0%0%6
98.4%98.4%1.6%0%0%0%0%7
99.2%99.2%0.8%0%0%0%0%8
99.6%99.6%0.4%0%0%0%0%9
99.8%99.8%0.2%0%0%0%0%10
99.9%99.9%0.1%0%0%0%0%11
100%99.9%0%0%0%0%0%12
Compiler

Compiled 37 to 12 computations (67.6% saved)

sample902.0ms (75.1%)

Memory
54.7MiB live, 1 210.6MiB allocated; 189ms collecting garbage
Samples
596.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 428.0ms
ival-mult: 160.0ms (37.4% of total)
ival-add: 147.0ms (34.3% of total)
ival-div: 107.0ms (25% of total)
exact: 10.0ms (2.3% of total)
ival-assert: 3.0ms (0.7% of total)
adjust: 2.0ms (0.5% of total)
Bogosity

explain145.0ms (12.1%)

Memory
-39.4MiB live, 222.1MiB allocated; 31ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))
00-0-t
00-0-#s(literal 1 binary64)
00-0-(/.f64 (+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))) (+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))))
00-0-(*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)))
00-0-(+.f64 #s(literal 2 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))))
00-0-#s(literal 2 binary64)
00-0-(+.f64 #s(literal 1 binary64) t)
00-0-(*.f64 #s(literal 2 binary64) t)
00-0-(+.f64 #s(literal 1 binary64) (*.f64 (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t)) (/.f64 (*.f64 #s(literal 2 binary64) t) (+.f64 #s(literal 1 binary64) t))))
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
43.0ms512×0valid
Compiler

Compiled 239 to 34 computations (85.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 21.0ms
ival-add: 7.0ms (33.4% of total)
ival-div: 6.0ms (28.7% of total)
ival-mult: 6.0ms (28.7% of total)
exact: 1.0ms (4.8% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess151.0ms (12.6%)

Memory
-10.8MiB live, 79.3MiB allocated; 12ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
021122
172110
2273101
3150693
01455
01855
12155
22555
33655
48655
538255
6377555
0808855
Stop Event
1×saturated
1×node limit
1×iter limit
1×node limit

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Profiling

Loading profile data...