Metrics for Toniolo and Linder, Equation (10+)

start0.0ms (0%)

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

analyze527.0ms (17.6%)

Memory

-8.7MiB live, 642.3MiB allocated; 58ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
0%	0%	99.9%	0.1%	0%	0%	0%	3
0%	0%	99.9%	0.1%	0%	0%	0%	4
0%	0%	99.9%	0.1%	0%	0%	0%	5
0%	0%	99.9%	0.1%	0%	0%	0%	6
4.7%	4.7%	95.2%	0.1%	0%	0%	0%	7
5.5%	5.5%	94.4%	0.1%	0%	0%	0%	8
13.7%	13.7%	86.2%	0.1%	0%	0%	0%	9
20.5%	20.5%	79.4%	0.1%	0%	0%	0%	10
22%	21.9%	77.9%	0.1%	0%	0%	0%	11
28.6%	28.5%	71.3%	0.1%	0%	0%	0%	12

Compiler

Compiled 27 to 21 computations (22.2% saved)

sample2.1s (68.9%)

Memory

74.7MiB live, 2 040.2MiB allocated; 970ms collecting garbage

Samples

1.3s

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 1.1s

ival-mult: 224.0ms (20.6% of total)

ival-sin: 186.0ms (17.1% of total)

ival-div: 168.0ms (15.4% of total)

ival-pow: 166.0ms (15.3% of total)

ival-tan: 165.0ms (15.2% of total)

ival-pow2: 79.0ms (7.3% of total)

ival-add: 78.0ms (7.2% of total)

exact: 15.0ms (1.4% of total)

adjust: 3.0ms (0.3% of total)

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

Bogosity

explain315.0ms (10.5%)

Memory

11.6MiB live, 469.7MiB allocated; 121ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Underpredictions	Example	Subexpression
65	-	1	(-1.7608299845704348e-28 1.6589898325342234e-155 -4.087779073953969e+159)	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`
52	-	0	-	`(.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))`
17	-	0	-	`(.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k))`
8	-	0	-	`(.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k))`
1	-	0	-	`(/.f64 #s(literal 2 binary64) (.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64))))`
0	-	0	-	`k`
0	-	0	-	`(/.f64 k t)`
0	-	0	-	`t`
0	-	0	-	`#s(literal 1 binary64)`
0	-	0	-	`#s(literal 3 binary64)`
0	-	0	-	`(tan.f64 k)`
0	-	0	-	`(pow.f64 (/.f64 k t) #s(literal 2 binary64))`
0	-	0	-	`(+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64)))`
0	-	0	-	`(*.f64 l l)`
0	-	0	-	`(sin.f64 k)`
0	-	0	-	`(pow.f64 t #s(literal 3 binary64))`
0	-	0	-	`(+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64))`
0	-	0	-	`#s(literal 2 binary64)`
0	-	0	-	`l`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))`	*uo**	42	0
↳	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	underflow	81
↳	`(.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k))`	underflow	97
↳	`(.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k))`	underflow	90
↳	`(pow.f64 t #s(literal 3 binary64))`	underflow	70
↳	`(*.f64 l l)`	underflow	70
↳	`(/.f64 k t)`	overflow	33
↳	`(+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64))`	overflow	68
↳	`(+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64)))`	overflow	68
↳	`(pow.f64 (/.f64 k t) #s(literal 2 binary64))`	overflow	68
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	o/o	21	0
↳	`(pow.f64 t #s(literal 3 binary64))`	overflow	79
↳	`(*.f64 l l)`	overflow	68
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	u/u	17	0
↳	`(pow.f64 t #s(literal 3 binary64))`	underflow	70
↳	`(*.f64 l l)`	underflow	70
`*.f64`	`(.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k))`	*no**	17	0
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	n/o	11	0
↳	`(*.f64 l l)`	overflow	68
`*.f64`	`(.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k))`	*no**	8	0
`*.f64`	`(.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))`	*no**	8	0
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	n/u	7	0
↳	`(*.f64 l l)`	underflow	70
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	o/n	5	0
↳	`(pow.f64 t #s(literal 3 binary64))`	overflow	79
`/.f64`	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	u/n	3	0
↳	`(pow.f64 t #s(literal 3 binary64))`	underflow	70
`*.f64`	`(.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))`	*nu**	2	0
`/.f64`	`(/.f64 #s(literal 2 binary64) (.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64))))`	n/o	1	0
↳	`(.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l)) (sin.f64 k)) (tan.f64 k))`	overflow	63
↳	`(.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k))`	overflow	71
↳	`(+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64))`	overflow	68
↳	`(pow.f64 t #s(literal 3 binary64))`	overflow	79
↳	`(.f64 (.f64 (.f64 (/.f64 (pow.f64 t #s(literal 3 binary64)) (.f64 l l)) (sin.f64 k)) (tan.f64 k)) (+.f64 (+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64))) #s(literal 1 binary64)))`	overflow	95
↳	`(+.f64 #s(literal 1 binary64) (pow.f64 (/.f64 k t) #s(literal 2 binary64)))`	overflow	68
↳	`(/.f64 k t)`	overflow	33
↳	`(/.f64 (pow.f64 t #s(literal 3 binary64)) (*.f64 l l))`	overflow	88
↳	`(*.f64 l l)`	overflow	68
↳	`(pow.f64 (/.f64 k t) #s(literal 2 binary64))`	overflow	68

Confusion

	Predicted +	Predicted -
+	118	0
-	8	130

Precision

0.9365079365079365

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	118	0	0
-	8	0	130

Precision?

0.9365079365079365

Recall?

1.0

Freqs

test

number	freq
0	130
1	110
2	16

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

99.0ms

512×

valid

Compiler

Compiled 265 to 61 computations (77% saved)

Precisions

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

ival-mult: 13.0ms (20.7% of total)

ival-div: 10.0ms (15.9% of total)

ival-sin: 10.0ms (15.9% of total)

ival-tan: 10.0ms (15.9% of total)

ival-pow: 9.0ms (14.3% of total)

ival-add: 5.0ms (7.9% of total)

ival-pow2: 5.0ms (7.9% of total)

exact: 1.0ms (1.6% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

preprocess91.0ms (3%)

Memory

17.0MiB live, 60.4MiB allocated; 35ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	86	256
1	296	230
2	1467	230
0	19	25
0	32	25
1	68	23
2	249	23
3	1889	23
0	8567	23

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

end0.0ms (0%)

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

start0.0ms (0%)

analyze527.0ms (17.6%)

sample2.1s (68.9%)

explain315.0ms (10.5%)

preprocess91.0ms (3%)

end0.0ms (0%)

Profiling