Development.Shake.Profile:generateTrace from shake-0.15.5

Time bar (total: 1.6s)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.4MiB live, 0.4MiB 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 7 to 6 computations (14.3% saved)

sample660.0ms (41.3%)

Memory
45.7MiB live, 850.7MiB allocated; 285ms collecting garbage
Samples
419.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 243.0ms
ival-sub: 205.0ms (84.5% of total)
ival-mult: 22.0ms (9.1% of total)
ival-true: 5.0ms (2.1% of total)
exact: 5.0ms (2.1% of total)
ival-assert: 3.0ms (1.2% of total)
adjust: 2.0ms (0.8% of total)
Bogosity

explain99.0ms (6.2%)

Memory
-6.7MiB live, 149.5MiB allocated; 34ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(-.f64 x x)
00-0-(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
00-0-#s(literal 1000000 binary64)
00-0-x
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
34.0ms512×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 24.0ms
ival-sub: 22.0ms (90.6% of total)
ival-mult: 1.0ms (4.1% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess258.0ms (16.1%)

Memory
0.4MiB live, 232.4MiB allocated; 27ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
062
1132
2242
3522
41342
53992
64672
76442
812482
932012
045
061
181
2121
3251
4701
52351
63901
76311
812361
931391
1077261
082281
Stop Event
iter limit
node limit
iter limit
node limit
Calls
Call 1
Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
Outputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 0 binary64)
Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

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

Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory
0.6MiB live, 0.6MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
Compiler

Compiled 5 to 4 computations (20% saved)

series1.0ms (0.1%)

Memory
1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Counts
4 → 3
Calls
Call 1
Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x
Outputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@-inf
((* 1000000 (- x x)) 1000000 (- x x) x)
0.0ms
x
@inf
((* 1000000 (- x x)) 1000000 (- x x) x)
0.0ms
x
@0
((* 1000000 (- x x)) 1000000 (- x x) x)

simplify196.0ms (12.3%)

Memory
-15.7MiB live, 126.2MiB allocated; 27ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
089
1109
2149
3279
4729
52379
63929
76339
812389
931419
1077269
082289
Stop Event
iter limit
node limit
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (- x x) #s(hole binary64 0))
#s(approx x #s(hole binary64 x))
Outputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(approx (- x x) #s(hole binary64 0))
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(approx x #s(hole binary64 x))
#s(approx x x)

rewrite52.0ms (3.3%)

Memory
18.8MiB live, 62.7MiB allocated; 9ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
064
1184
01054
Stop Event
iter limit
iter limit
iter limit
unsound
iter limit
Counts
4 → 4
Calls
Call 1
Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x
Outputs
#s(literal 0 binary64)
#s(literal 1000000 binary64)
#s(literal 0 binary64)
x

eval1.0ms (0%)

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

Compiled 37 to 14 computations (62.2% saved)

prune1.0ms (0%)

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

1 alts after pruning (1 fresh and 0 done)

PrunedKeptTotal
New617
Fresh000
Picked101
Done000
Total718
Accuracy
100.0%
Counts
8 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
Compiler

Compiled 7 to 6 computations (14.3% saved)

series0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated; 0ms collecting garbage
Counts
2 → 1
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(literal 0 binary64)
Outputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@0
((* 1000000 (- x x)) 0)
0.0ms
x
@inf
((* 1000000 (- x x)) 0)
0.0ms
x
@-inf
((* 1000000 (- x x)) 0)

simplify177.0ms (11.1%)

Memory
-28.8MiB live, 116.0MiB allocated; 26ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
063
183
2123
3253
4703
52353
63903
76313
812363
931393
1077243
082263
Stop Event
iter limit
node limit
Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
Outputs
#s(approx (* 1000000 (- x x)) #s(hole binary64 0))
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

rewrite35.0ms (2.2%)

Memory
-1.3MiB live, 44.4MiB allocated; 6ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
068
064
1204
01134
Stop Event
iter limit
iter limit
iter limit
unsound
saturated
Counts
2 → 2
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(literal 0 binary64)
Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
#s(literal 0 binary64)

eval0.0ms (0%)

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

Compiled 14 to 6 computations (57.1% saved)

prune1.0ms (0.1%)

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

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New202
Fresh000
Picked011
Done000
Total213
Accuracy
100.0%
Counts
3 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
Compiler

Compiled 19 to 15 computations (21.1% saved)

regimes3.0ms (0.2%)

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

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
2 → 1
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
Calls

3 calls:

1.0ms
x
1.0ms
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
1.0ms
(-.f64 x x)
Results
AccuracySegmentsBranch
100.0%1(-.f64 x x)
100.0%1(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
100.0%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify64.0ms (4%)

Memory
5.4MiB live, 51.1MiB allocated; 5ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
065
183
293
3123
4253
51283
69753
718743
825983
938873
Stop Event
node limit
Calls
Call 1
Inputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))
Outputs
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

derivations34.0ms (2.1%)

Memory
-21.8MiB live, 31.5MiB allocated; 19ms collecting garbage
Stop Event
done
Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess15.0ms (0.9%)

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

Compiled 26 to 24 computations (7.7% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...