FastMath repmul

Time bar (total: 1.3s)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 9 to 6 computations (33.3% saved)

sample613.0ms (47.2%)

Memory
22.0MiB live, 1 058.4MiB allocated; 220ms collecting garbage
Samples
401.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 210.0ms
ival-mult!: 209.0ms (99.5% of total)
adjust: 1.0ms (0.5% of total)
Bogosity

explain494.0ms (38.1%)

Memory
-49.1MiB live, 167.9MiB allocated; 782ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-d1
00-0-(*.f64 (*.f64 d1 d1) d1)
00-0-(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
00-0-(*.f64 d1 d1)
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
428.0ms512×0valid
Compiler

Compiled 43 to 16 computations (62.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 412.0ms
ival-mult!: 411.0ms (99.9% of total)
adjust: 0.0ms (0% of total)

preprocess79.0ms (6.1%)

Memory
-8.5MiB live, 37.6MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 2 (0.0ms)

IterNodesCost
0922
13216
211510
323710
431010
531410
632410
735610
853910
9216010
10533110
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.9%
(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
Symmetry

(abs d1)

Compiler

Compiled 14 to 8 computations (42.9% saved)

series4.0ms (0.3%)

Memory
9.4MiB live, 9.4MiB allocated; 0ms collecting garbage
Counts
4 → 4
Calls
Call 1
Inputs
(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
(*.f64 (*.f64 d1 d1) d1)
(*.f64 d1 d1)
d1
Outputs
#s(approx (* (* (* d1 d1) d1) d1) #s(hole binary64 (pow d1 4)))
#s(approx (* (* d1 d1) d1) #s(hole binary64 (pow d1 3)))
#s(approx (* d1 d1) #s(hole binary64 (pow d1 2)))
#s(approx d1 #s(hole binary64 d1))
Calls

3 calls:

TimeVariablePointExpression
2.0ms
d1
@-inf
((* (* (* d1 d1) d1) d1) (* (* d1 d1) d1) (* d1 d1) d1)
1.0ms
d1
@inf
((* (* (* d1 d1) d1) d1) (* (* d1 d1) d1) (* d1 d1) d1)
1.0ms
d1
@0
((* (* (* d1 d1) d1) d1) (* (* d1 d1) d1) (* d1 d1) d1)

rewrite39.0ms (3%)

Memory
22.8MiB live, 68.4MiB allocated; 5ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01746
02134
14834
017334
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
8 → 60
Calls
Call 1
Inputs
(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
(*.f64 (*.f64 d1 d1) d1)
(*.f64 d1 d1)
d1
#s(approx (* (* (* d1 d1) d1) d1) #s(hole binary64 (pow d1 4)))
#s(approx (* (* d1 d1) d1) #s(hole binary64 (pow d1 3)))
#s(approx (* d1 d1) #s(hole binary64 (pow d1 2)))
#s(approx d1 #s(hole binary64 d1))
Outputs
(*.f64 (*.f64 (*.f64 d1 d1) (neg.f64 d1)) (neg.f64 d1))
(*.f64 (*.f64 (*.f64 d1 d1) (fabs.f64 d1)) (fabs.f64 d1))
(*.f64 (*.f64 d1 (pow.f64 d1 #s(literal 3/2 binary64))) (pow.f64 d1 #s(literal 3/2 binary64)))
(*.f64 (*.f64 (neg.f64 d1) (fabs.f64 d1)) (*.f64 (neg.f64 d1) (fabs.f64 d1)))
(*.f64 (*.f64 (neg.f64 d1) d1) (*.f64 (neg.f64 d1) d1))
(*.f64 (*.f64 (fabs.f64 d1) (neg.f64 d1)) (*.f64 (fabs.f64 d1) (neg.f64 d1)))
(*.f64 (*.f64 (fabs.f64 d1) d1) (*.f64 (fabs.f64 d1) d1))
(*.f64 (*.f64 d1 (neg.f64 d1)) (*.f64 d1 (neg.f64 d1)))
(*.f64 (*.f64 d1 (fabs.f64 d1)) (*.f64 d1 (fabs.f64 d1)))
(*.f64 (neg.f64 (*.f64 d1 d1)) (neg.f64 (*.f64 d1 d1)))
(*.f64 (pow.f64 d1 #s(literal 3/2 binary64)) (*.f64 (pow.f64 d1 #s(literal 3/2 binary64)) d1))
(*.f64 (neg.f64 d1) (*.f64 (neg.f64 d1) (*.f64 d1 d1)))
(*.f64 (fabs.f64 d1) (*.f64 (fabs.f64 d1) (*.f64 d1 d1)))
(*.f64 (pow.f64 d1 #s(literal 3 binary64)) d1)
(*.f64 (*.f64 d1 d1) (*.f64 d1 d1))
(*.f64 d1 (pow.f64 d1 #s(literal 3 binary64)))
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 4 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 4 binary64))
(exp.f64 (fma.f64 (log.f64 d1) #s(literal 2 binary64) (*.f64 (log.f64 d1) #s(literal 2 binary64))))
(exp.f64 (*.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64)) #s(literal 2 binary64)))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64))) (sinh.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64))))
(*.f64 (*.f64 d1 (neg.f64 d1)) (neg.f64 d1))
(*.f64 (*.f64 d1 (fabs.f64 d1)) (fabs.f64 d1))
(*.f64 (neg.f64 (pow.f64 d1 #s(literal 3/2 binary64))) (neg.f64 (pow.f64 d1 #s(literal 3/2 binary64))))
(*.f64 (fabs.f64 (pow.f64 d1 #s(literal 3/2 binary64))) (fabs.f64 (pow.f64 d1 #s(literal 3/2 binary64))))
(*.f64 (pow.f64 d1 #s(literal 3/2 binary64)) (pow.f64 d1 #s(literal 3/2 binary64)))
(*.f64 (neg.f64 d1) (*.f64 (neg.f64 d1) d1))
(*.f64 (fabs.f64 d1) (*.f64 (fabs.f64 d1) d1))
(*.f64 (*.f64 d1 d1) d1)
(*.f64 d1 (*.f64 d1 d1))
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 3 binary64))
(pow.f64 (pow.f64 d1 #s(literal 3/2 binary64)) #s(literal 2 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 3/2 binary64))
(pow.f64 d1 #s(literal 3 binary64))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 3 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 d1) #s(literal 3 binary64))) (sinh.f64 (*.f64 (log.f64 d1) #s(literal 3 binary64))))
(*.f64 (neg.f64 (neg.f64 d1)) (neg.f64 (neg.f64 d1)))
(*.f64 (neg.f64 (fabs.f64 d1)) (neg.f64 (fabs.f64 d1)))
(*.f64 (fabs.f64 (fabs.f64 d1)) (fabs.f64 (fabs.f64 d1)))
(*.f64 (exp.f64 (log.f64 d1)) (exp.f64 (log.f64 d1)))
(*.f64 (neg.f64 d1) (neg.f64 d1))
(*.f64 (fabs.f64 d1) (fabs.f64 d1))
(*.f64 d1 d1)
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 2 binary64))
(pow.f64 (neg.f64 d1) #s(literal 2 binary64))
(pow.f64 (fabs.f64 d1) #s(literal 2 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 1 binary64))
(pow.f64 d1 #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 d1) d1))
(neg.f64 (*.f64 d1 (neg.f64 d1)))
(fabs.f64 (*.f64 d1 d1))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 d1) #s(literal 2 binary64))))
d1
#s(approx (* (* (* d1 d1) d1) d1) (pow.f64 d1 #s(literal 4 binary64)))
#s(approx (* (* d1 d1) d1) (pow.f64 d1 #s(literal 3 binary64)))
#s(approx (* d1 d1) (*.f64 d1 d1))
#s(approx d1 d1)

eval5.0ms (0.4%)

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

Compiled 525 to 159 computations (69.7% saved)

prune12.0ms (0.9%)

Memory
-27.7MiB live, 17.4MiB allocated; 10ms collecting garbage
Pruning

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New59160
Fresh000
Picked101
Done000
Total60161
Accuracy
100.0%
Counts
61 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(pow.f64 d1 #s(literal 4 binary64))
Compiler

Compiled 3 to 3 computations (0% saved)

series2.0ms (0.1%)

Memory
5.3MiB live, 5.3MiB allocated; 0ms collecting garbage
Counts
3 → 2
Calls
Call 1
Inputs
(pow.f64 d1 #s(literal 4 binary64))
d1
#s(literal 4 binary64)
Outputs
#s(approx (pow d1 4) #s(hole binary64 (pow d1 4)))
#s(approx d1 #s(hole binary64 d1))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
d1
@inf
((pow d1 4) d1 4)
1.0ms
d1
@-inf
((pow d1 4) d1 4)
0.0ms
d1
@0
((pow d1 4) d1 4)

rewrite21.0ms (1.6%)

Memory
-2.8MiB live, 41.6MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0615
0615
11315
04215
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
5 → 12
Calls
Call 1
Inputs
(pow.f64 d1 #s(literal 4 binary64))
d1
#s(literal 4 binary64)
#s(approx (pow d1 4) #s(hole binary64 (pow d1 4)))
#s(approx d1 #s(hole binary64 d1))
Outputs
(*.f64 (neg.f64 (*.f64 d1 d1)) (neg.f64 (*.f64 d1 d1)))
(*.f64 (fabs.f64 (*.f64 d1 d1)) (fabs.f64 (*.f64 d1 d1)))
(*.f64 (*.f64 d1 d1) (*.f64 d1 d1))
(pow.f64 (exp.f64 (log.f64 d1)) #s(literal 4 binary64))
(pow.f64 (*.f64 d1 d1) #s(literal 2 binary64))
(pow.f64 d1 #s(literal 4 binary64))
(exp.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64))) (sinh.f64 (*.f64 (log.f64 d1) #s(literal 4 binary64))))
d1
#s(literal 4 binary64)
#s(approx (pow d1 4) (pow.f64 d1 #s(literal 4 binary64)))
#s(approx d1 d1)

eval1.0ms (0.1%)

Memory
2.3MiB live, 2.4MiB allocated; 0ms collecting garbage
Compiler

Compiled 63 to 24 computations (61.9% saved)

prune1.0ms (0.1%)

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

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New909
Fresh000
Picked011
Done000
Total9110
Accuracy
100.0%
Counts
10 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(pow.f64 d1 #s(literal 4 binary64))
Compiler

Compiled 13 to 9 computations (30.8% saved)

regimes3.0ms (0.2%)

Memory
9.4MiB live, 9.4MiB allocated; 0ms collecting garbage
Accuracy

Total -0.1b remaining (-∞%)

Threshold costs -0.1b (-∞%)

Counts
2 → 1
Calls
Call 1
Inputs
(pow.f64 d1 #s(literal 4 binary64))
(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
Outputs
(pow.f64 d1 #s(literal 4 binary64))
Calls

2 calls:

1.0ms
d1
1.0ms
(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
Results
AccuracySegmentsBranch
100.0%1(*.f64 (*.f64 (*.f64 d1 d1) d1) d1)
100.0%1d1
Compiler

Compiled 8 to 5 computations (37.5% saved)

derivations2.0ms (0.1%)

Memory
3.5MiB live, 3.5MiB allocated; 0ms collecting garbage
Stop Event
done
Compiler

Compiled 3 to 3 computations (0% saved)

preprocess23.0ms (1.7%)

Memory
-2.8MiB live, 30.6MiB allocated; 15ms collecting garbage
Remove

(abs d1)

Compiler

Compiled 26 to 20 computations (23.1% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...