FastMath test1

Time bar (total: 1.1s)

start0.0ms (0.0%)

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

analyze0.0ms (0.0%)

Memory
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0.0%0.0%100.0%0.0%0.0%0.0%0.0%0
100.0%100.0%0.0%0.0%0.0%0.0%0.0%1
Compiler

Compiled 9 to 8 computations (11.1% saved)

sample760.0ms (67.0%)

Memory
-15.7MiB live, 1 305.8MiB allocated; 227ms collecting garbage
Samples
433.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 224.0ms
ival-mult!: 125.0ms (55.7% of total)
ival-add!: 98.0ms (43.7% of total)
adjust: 2.0ms (0.9% of total)
Bogosity

preprocess18.0ms (1.6%)

Memory
-3.7MiB live, 42.1MiB allocated; 6ms collecting garbage
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
01110
13310
2869
3989
Stop Event
1×saturated
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶99.5%
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
Symmetry

(negabs d)

Compiler

Compiled 14 to 12 computations (14.3% saved)

sample0.0ms (0.0%)

Memory
0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Calls
Call 1
Inputs
10
20
Outputs
#s(literal 10 binary64)
#s(literal 20 binary64)
Samples
0.0ms1×0valid
Compiler

Compiled 4 to 4 computations (0.0% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
adjust: 0.0ms (0.0% of total)

series13.0ms (1.2%)

Memory
37.6MiB live, 37.6MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01428
Stop Event
1×iter-limit
Counts
6 → 4
Calls
Call 1
Inputs
d
#s(literal 10 binary64)
(*.f64 d #s(literal 10 binary64))
#s(literal 20 binary64)
(*.f64 d #s(literal 20 binary64))
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
Outputs
#s(approx d d)
#s(approx (* d 10) (*.f64 #s(literal 10 binary64) d))
#s(approx (* d 20) (*.f64 #s(literal 20 binary64) d))
#s(approx (+ (* d 10) (* d 20)) (*.f64 #s(literal 30 binary64) d))
Calls

3 calls:

TimeVariablePoint
1.0ms
d
-inf
1.0ms
d
inf
1.0ms
d
0

rewrite288.0ms (25.4%)

Memory
-4.5MiB live, 277.5MiB allocated; 41ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0616
0912
13712
212312
328112
442512
578712
6346312
0460112
Stop Event
1×iter-limit
1×node-limit
1×iter-limit
Counts
6 → 34
Calls
Call 1
Inputs
d
#s(literal 10 binary64)
(*.f64 d #s(literal 10 binary64))
#s(literal 20 binary64)
(*.f64 d #s(literal 20 binary64))
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
Outputs
d
#s(literal 10 binary64)
(*.f64 #s(literal -10 binary64) (neg.f64 d))
(*.f64 (neg.f64 d) #s(literal -10 binary64))
(*.f64 #s(literal 10 binary64) d)
(*.f64 d #s(literal 10 binary64))
(neg.f64 (*.f64 #s(literal -10 binary64) d))
#s(literal 20 binary64)
(*.f64 #s(literal -20 binary64) (neg.f64 d))
(*.f64 (neg.f64 d) #s(literal -20 binary64))
(*.f64 #s(literal 20 binary64) d)
(*.f64 d #s(literal 20 binary64))
(neg.f64 (*.f64 #s(literal -20 binary64) d))
(*.f64 #s(literal -30 binary64) (neg.f64 d))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 #s(literal -10 binary64) d) (*.f64 #s(literal 20 binary64) d))) (*.f64 #s(literal 20 binary64) d))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d))) (*.f64 #s(literal 20 binary64) d))
(*.f64 (-.f64 #s(literal 1 binary64) (/.f64 (*.f64 #s(literal -20 binary64) d) (*.f64 #s(literal 10 binary64) d))) (*.f64 #s(literal 10 binary64) d))
(*.f64 #s(literal 30 binary64) d)
(*.f64 (neg.f64 d) #s(literal -30 binary64))
(*.f64 (+.f64 #s(literal 1 binary64) (/.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d))) (*.f64 #s(literal 10 binary64) d))
(*.f64 d #s(literal 30 binary64))
(/.f64 (-.f64 (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d)) (*.f64 (*.f64 #s(literal -10 binary64) d) (*.f64 #s(literal -10 binary64) d))) (+.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal -10 binary64) d)))
(/.f64 (-.f64 (pow.f64 (*.f64 #s(literal 20 binary64) d) #s(literal 3 binary64)) (pow.f64 (*.f64 #s(literal -10 binary64) d) #s(literal 3 binary64))) (+.f64 (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d)) (+.f64 (*.f64 (*.f64 #s(literal -10 binary64) d) (*.f64 #s(literal -10 binary64) d)) (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal -10 binary64) d)))))
(/.f64 (-.f64 (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d)) (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d))) (-.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d)))
(/.f64 (-.f64 (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d)) (*.f64 (*.f64 #s(literal -20 binary64) d) (*.f64 #s(literal -20 binary64) d))) (+.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal -20 binary64) d)))
(/.f64 (+.f64 (pow.f64 (*.f64 #s(literal 20 binary64) d) #s(literal 3 binary64)) (pow.f64 (*.f64 #s(literal 10 binary64) d) #s(literal 3 binary64))) (+.f64 (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d)) (-.f64 (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d)) (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d)))))
(/.f64 (-.f64 (pow.f64 (*.f64 #s(literal 10 binary64) d) #s(literal 3 binary64)) (pow.f64 (*.f64 #s(literal -20 binary64) d) #s(literal 3 binary64))) (+.f64 (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d)) (+.f64 (*.f64 (*.f64 #s(literal -20 binary64) d) (*.f64 #s(literal -20 binary64) d)) (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal -20 binary64) d)))))
(/.f64 (-.f64 (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d)) (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d))) (-.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d)))
(/.f64 (+.f64 (pow.f64 (*.f64 #s(literal 10 binary64) d) #s(literal 3 binary64)) (pow.f64 (*.f64 #s(literal 20 binary64) d) #s(literal 3 binary64))) (+.f64 (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 10 binary64) d)) (-.f64 (*.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 20 binary64) d)) (*.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d)))))
(neg.f64 (*.f64 #s(literal -30 binary64) d))
(-.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal -10 binary64) d))
(-.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal -20 binary64) d))
(+.f64 (*.f64 #s(literal 20 binary64) d) (*.f64 #s(literal 10 binary64) d))
(+.f64 (*.f64 #s(literal 10 binary64) d) (*.f64 #s(literal 20 binary64) d))

eval3.0ms (0.2%)

Memory
13.0MiB live, 13.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 443 to 107 computations (75.8% saved)

prune3.0ms (0.3%)

Memory
-40.4MiB live, 6.2MiB allocated; 3ms collecting garbage
Pruning

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New33134
Fresh000
Picked101
Done000
Total34135
Accuracy
100.0%
Counts
35 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(*.f64 d #s(literal 30 binary64))
Compiler

Compiled 3 to 3 computations (0.0% saved)

sample0.0ms (0.0%)

Memory
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Calls
Call 1
Inputs
30
Outputs
#s(literal 30 binary64)
Samples
0.0ms1×0valid
Compiler

Compiled 3 to 3 computations (0.0% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
adjust: 0.0ms (0.0% of total)

series5.0ms (0.4%)

Memory
19.5MiB live, 19.5MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0610
Stop Event
1×iter-limit
Counts
3 → 2
Calls
Call 1
Inputs
d
#s(literal 30 binary64)
(*.f64 d #s(literal 30 binary64))
Outputs
#s(approx d d)
#s(approx (* d 30) (*.f64 #s(literal 30 binary64) d))
Calls

3 calls:

TimeVariablePoint
1.0ms
d
inf
1.0ms
d
-inf
0.0ms
d
0

rewrite11.0ms (1.0%)

Memory
-4.0MiB live, 42.6MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
035
045
155
055
Stop Event
1×iter-limit
1×saturated
1×iter-limit
Counts
3 → 4
Calls
Call 1
Inputs
d
#s(literal 30 binary64)
(*.f64 d #s(literal 30 binary64))
Outputs
d
#s(literal 30 binary64)
(*.f64 #s(literal 30 binary64) d)
(*.f64 d #s(literal 30 binary64))

eval0.0ms (0.0%)

Memory
1.7MiB live, 1.7MiB allocated; 0ms collecting garbage
Compiler

Compiled 18 to 9 computations (50.0% saved)

prune1.0ms (0.1%)

Memory
3.8MiB live, 3.8MiB allocated; 0ms collecting garbage
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New404
Fresh000
Picked101
Done-110
Total415
Accuracy
100.0%
Counts
5 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(*.f64 d #s(literal 30 binary64))
Compiler

Compiled 3 to 3 computations (0.0% saved)

regimes4.0ms (0.3%)

Memory
16.6MiB live, 16.6MiB allocated; 0ms collecting garbage
Counts
2 → 1
Calls
Call 1
Inputs
(*.f64 d #s(literal 30 binary64))
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
Outputs
(*.f64 d #s(literal 30 binary64))
Calls

2 calls:

2.0ms
d
2.0ms
(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
Results
AccuracySegmentsBranch
100.0%1(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
100.0%1d
Compiler

Compiled 18 to 15 computations (16.7% saved)

derivations21.0ms (1.8%)

Memory
-40.7MiB live, 11.4MiB allocated; 7ms collecting garbage
Stop Event
1×done
Compiler

Compiled 3 to 3 computations (0.0% saved)

preprocess7.0ms (0.6%)

Memory
26.8MiB live, 26.8MiB allocated; 0ms collecting garbage
Compiler

Compiled 16 to 15 computations (6.3% saved)

end0.0ms (0.0%)

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

Profiling

Loading profile data...