Metrics for Development.Shake.Profile:generateTrace from shake-0.15.5

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
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)

sample583.0ms (52%)

Memory

7.9MiB live, 807.1MiB allocated; 194ms collecting garbage

Samples

367.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 96.0ms

ival-sub: 53.0ms (55.3% of total)

ival-mult: 27.0ms (28.1% of total)

ival-true: 5.0ms (5.2% of total)

exact: 5.0ms (5.2% of total)

adjust: 3.0ms (3.1% of total)

ival-assert: 3.0ms (3.1% of total)

Bogosity

explain65.0ms (5.8%)

Memory

-1.9MiB live, 51.7MiB allocated; 15ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 x x)`
-	-	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
-	-	`#s(literal 1000000 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

41.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 5.0ms

ival-sub: 3.0ms (60.4% of total)

ival-mult: 1.0ms (20.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)

preprocess278.0ms (24.8%)

Memory

8.8MiB live, 244.8MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	2
1	13	2
2	24	2
3	52	2
4	134	2
5	399	2
6	467	2
7	644	2
8	1248	2
9	3201	2
0	4	5
0	6	1
1	8	1
2	12	1
3	25	1
4	70	1
5	235	1
6	390	1
7	631	1
8	1236	1
9	3139	1
10	7726	1
0	8228	1

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.6MiB live, 1.6MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 #s(literal 1000000 binary64) (-.f64 x x))

Compiler

Compiled 5 to 4 computations (20% saved)

series1.0ms (0.1%)

Memory

3.9MiB live, 3.9MiB allocated; 0ms collecting garbage

Counts

4 → 2

Calls

Call 1

Inputs
(*.f64 #s(literal 1000000 binary64) (-.f64 x x))
#s(literal 1000000 binary64)
(-.f64 x x)
x

Outputs
0
x

Calls

3 calls:

Time	Variable		Point	Expression
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)

simplify6.0ms (0.6%)

Memory

-26.3MiB live, 19.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	2	2
0	2	2

Stop Event

1×	saturated
1×	saturated

Counts

2 → 1

Calls

Call 1

Inputs
0
x

Outputs
0
#s(literal 0 binary64)
x

rewrite46.0ms (4.1%)

Memory

-4.1MiB live, 137.8MiB allocated; 16ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	4
1	18	4
0	105	4

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	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

eval0.0ms (0%)

Memory: 2.1MiB live, 2.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 23 to 9 computations (60.9% saved)

prune1.0ms (0%)

Memory

3.0MiB live, 3.0MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	4	1	5
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	5	1	6

Accuracy

100.0%

Counts

6 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	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.4MiB live, 0.5MiB 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
0

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	x	@	0	((* 1000000 (- x x)) 0)
0.0ms	x	@	inf	((* 1000000 (- x x)) 0)
0.0ms	x	@	-inf	((* 1000000 (- x x)) 0)

simplify3.0ms (0.3%)

Memory

9.7MiB live, 9.7MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1
0	1	1

Stop Event

1×	saturated
1×	saturated

Counts

1 → 1

Calls

Call 1

Inputs
0

Outputs
0
#s(literal 0 binary64)

rewrite32.0ms (2.9%)

Memory

3.2MiB live, 48.2MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
0	6	4
1	20	4
0	113	4

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	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.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 14 to 6 computations (57.1% saved)

prune1.0ms (0.1%)

Memory

2.1MiB live, 2.1MiB allocated; 0ms collecting garbage

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	2	0	2
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	2	1	3

Accuracy

100.0%

Counts

3 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (* 1000000 (- x x)) #s(literal 0 binary64))

Compiler

Compiled 19 to 15 computations (21.1% saved)

regimes3.0ms (0.3%)

Memory

9.0MiB live, 9.0MiB 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

Accuracy	Segments	Branch
100.0%	1	`(-.f64 x x)`
100.0%	1	`(*.f64 #s(literal 1000000 binary64) (-.f64 x x))`
100.0%	1	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify90.0ms (8%)

Memory

-19.4MiB live, 117.2MiB allocated; 52ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	6	5
1	8	3
2	9	3
3	12	3
4	25	3
5	128	3
6	975	3
7	1874	3
8	2598	3
9	3887	3

Stop Event

1×	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))

derivations0.0ms (0%)

Memory

1.4MiB live, 1.4MiB allocated; 0ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess10.0ms (0.9%)

Memory: 29.0MiB live, 29.0MiB 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

start0.0ms (0%)

analyze0.0ms (0%)

sample583.0ms (52%)

explain65.0ms (5.8%)

preprocess278.0ms (24.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series1.0ms (0.1%)

simplify6.0ms (0.6%)

rewrite46.0ms (4.1%)

eval0.0ms (0%)

prune1.0ms (0%)

series0.0ms (0%)

simplify3.0ms (0.3%)

rewrite32.0ms (2.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes3.0ms (0.3%)

simplify90.0ms (8%)

derivations0.0ms (0%)

preprocess10.0ms (0.9%)

end0.0ms (0%)

Profiling