Development.Shake.Profile:generateTrace from shake-0.15.5
Time bar (total: 1.6s)
| 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 |
Compiled 7 to 6 computations (14.3% saved)
| 1.0s | 8 256× | 0 | valid |
ival-mult: 537.0ms (87.3% of total)ival-sub: 67.0ms (10.9% of total)ival-true: 5.0ms (0.8% of total)exact: 4.0ms (0.6% of total)ival-assert: 3.0ms (0.5% of total)| Ground Truth | Overpredictions | Example | Underpredictions | Example | Subexpression |
|---|---|---|---|---|---|
| 0 | 0 | - | 0 | - | (-.f64 x x) |
| 0 | 0 | - | 0 | - | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| 0 | 0 | - | 0 | - | #s(literal 1000000 binary64) |
| 0 | 0 | - | 0 | - | x |
| Predicted + | Predicted - | |
|---|---|---|
| + | 0 | 0 |
| - | 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 256 |
| number | freq |
|---|---|
| 0 | 256 |
| Predicted + | Predicted Maybe | Predicted - | |
|---|---|---|---|
| + | 0 | 0 | 0 |
| - | 0 | 0 | 1 |
| 47.0ms | 512× | 0 | valid |
Compiled 30 to 16 computations (46.7% saved)
ival-sub: 18.0ms (90.6% of total)ival-mult: 1.0ms (5% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| 1× | egg-herbie |
| 8× | lower-+.f64 |
| 8× | sub-neg |
| 8× | lower-+.f32 |
| 8× | distribute-lft-neg-in |
| 6× | lower--.f64 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 2 |
| 1 | 22 | 2 |
| 2 | 30 | 2 |
| 3 | 45 | 2 |
| 4 | 52 | 2 |
| 5 | 54 | 2 |
| 0 | 4 | 5 |
| 0 | 6 | 1 |
| 1 | 10 | 1 |
| 2 | 13 | 1 |
| 3 | 15 | 1 |
| 4 | 17 | 1 |
| 5 | 19 | 1 |
| 6 | 23 | 1 |
| 7 | 28 | 1 |
| 0 | 28 | 1 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| 1× | saturated |
| Inputs |
|---|
(*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| Outputs |
|---|
(*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
#s(literal 0 binary64) |
Compiled 6 to 4 computations (33.3% saved)
Compiled 1 to 1 computations (0% saved)
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
Compiled 6 to 4 computations (33.3% saved)
| 1× | egg-herbie |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 192 | (-.f64 x x) | |
| cost-diff | 320 | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| 8× | lower-+.f64 |
| 8× | sub-neg |
| 8× | lower-+.f32 |
| 6× | lower--.f64 |
| 6× | lower--.f32 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 10 |
| 0 | 6 | 4 |
| 1 | 10 | 4 |
| 2 | 13 | 4 |
| 3 | 15 | 4 |
| 4 | 17 | 4 |
| 5 | 19 | 4 |
| 6 | 23 | 4 |
| 7 | 28 | 4 |
| 0 | 28 | 4 |
| 1× | iter limit |
| 1× | saturated |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
#s(literal 1000000 binary64) |
(-.f64 x x) |
x |
| Outputs |
|---|
(*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
#s(literal 0 binary64) |
#s(literal 1000000 binary64) |
(-.f64 x x) |
#s(literal 0 binary64) |
x |
Found 2 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0 | (-.f64 x x) | |
| accuracy | 0 | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| 6.0ms | 256× | 0 | valid |
Compiled 12 to 6 computations (50% saved)
ival-sub: 1.0ms (48.9% of total)ival-mult: 1.0ms (48.9% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ()) |
#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ()) |
| Outputs |
|---|
#s(alt 0 (taylor 0 x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) (patch (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt (-.f64 x x) (patch (-.f64 x x) #<representation binary64>) () ())) ()) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | ((* 1000000 (- x x)) (- x x)) |
| 0.0ms | x | @ | inf | ((* 1000000 (- x x)) (- x x)) |
| 0.0ms | x | @ | -inf | ((* 1000000 (- x x)) (- x x)) |
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 1 | 24 |
| 0 | 1 | 24 |
| 1× | saturated |
| 1× | saturated |
| Inputs |
|---|
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
| Outputs |
|---|
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
| 28× | lower-*.f64 |
| 28× | lower-*.f32 |
| 28× | lower-fma.f64 |
| 28× | lower-+.f64 |
| 28× | lower-fma.f32 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 4 | 8 |
| 0 | 6 | 2 |
| 1 | 20 | 2 |
| 0 | 84 | 2 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | iter limit |
| Inputs |
|---|
(*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
(-.f64 x x) |
| Outputs |
|---|
#s(literal 0 binary64) |
#s(literal 0 binary64) |
Compiled 77 to 4 computations (94.8% saved)
1 alts after pruning (1 fresh and 0 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 25 | 1 | 26 |
| Fresh | 0 | 0 | 0 |
| Picked | 1 | 0 | 1 |
| Done | 0 | 0 | 0 |
| Total | 26 | 1 | 27 |
| Status | Accuracy | Program |
|---|---|---|
| ▶ | 100.0% | #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
Compiled 3 to 2 computations (33.3% saved)
| 1× | egg-herbie |
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| cost-diff | 0 | #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
| 8× | lower-+.f64 |
| 8× | sub-neg |
| 8× | lower-+.f32 |
| 6× | lower--.f64 |
| 6× | lower--.f32 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 8 |
| 0 | 6 | 4 |
| 1 | 10 | 4 |
| 2 | 13 | 4 |
| 3 | 15 | 4 |
| 4 | 17 | 4 |
| 5 | 19 | 4 |
| 6 | 23 | 4 |
| 7 | 28 | 4 |
| 0 | 28 | 4 |
| 1× | iter limit |
| 1× | saturated |
| 1× | saturated |
| 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) |
Found 1 expressions of interest:
| New | Metric | Score | Program |
|---|---|---|---|
| accuracy | 0 | #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
| 6.0ms | 256× | 0 | valid |
Compiled 8 to 7 computations (12.5% saved)
ival-sub: 1.0ms (47.5% of total)ival-mult: 1.0ms (47.5% of total)ival-true: 0.0ms (0% of total)exact: 0.0ms (0% of total)ival-assert: 0.0ms (0% of total)| Inputs |
|---|
#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ()) |
| Outputs |
|---|
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor 0 x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
#s(alt 0 (taylor -inf x) (#s(alt #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) (patch #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) #<representation binary64>) () ())) ()) |
3 calls:
| Time | Variable | Point | Expression | |
|---|---|---|---|---|
| 0.0ms | x | @ | 0 | ((* 1000000 (- x x))) |
| 0.0ms | x | @ | inf | ((* 1000000 (- x x))) |
| 0.0ms | x | @ | -inf | ((* 1000000 (- x x))) |
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 1 | 12 |
| 0 | 1 | 12 |
| 1× | saturated |
| 1× | saturated |
| Inputs |
|---|
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
| Outputs |
|---|
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
0 |
#s(literal 0 binary64) |
| 28× | lower-*.f64 |
| 28× | lower-*.f32 |
| 28× | lower-fma.f64 |
| 28× | lower-+.f64 |
| 28× | lower-fma.f32 |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 7 |
| 0 | 6 | 3 |
| 1 | 20 | 3 |
| 0 | 84 | 3 |
| 1× | iter limit |
| 1× | iter limit |
| 1× | iter limit |
| 1× | unsound |
| 1× | saturated |
| Inputs |
|---|
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
| Outputs |
|---|
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
Compiled 27 to 2 computations (92.6% saved)
1 alts after pruning (0 fresh and 1 done)
| Pruned | Kept | Total | |
|---|---|---|---|
| New | 13 | 0 | 13 |
| Fresh | 0 | 0 | 0 |
| Picked | 0 | 1 | 1 |
| Done | 0 | 0 | 0 |
| Total | 13 | 1 | 14 |
| Status | Accuracy | Program |
|---|---|---|
| ✓ | 100.0% | #s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
Compiled 11 to 7 computations (36.4% saved)
Total 0b remaining (0%)
Threshold costs 0b (0%)
| 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)) |
3 calls:
| 1.0ms | x |
| 1.0ms | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| 1.0ms | (-.f64 x x) |
| Accuracy | Segments | Branch |
|---|---|---|
| 100.0% | 1 | x |
| 100.0% | 1 | (*.f64 #s(literal 1000000 binary64) (-.f64 x x)) |
| 100.0% | 1 | (-.f64 x x) |
Compiled 12 to 7 computations (41.7% saved)
| 1× | egg-herbie |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 6 | 7 |
| 1× | saturated |
| Inputs |
|---|
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
| Outputs |
|---|
#s(approx (* 1000000 (- x x)) #s(literal 0 binary64)) |
Useful iterations: 0 (0.0ms)
| Iter | Nodes | Cost |
|---|---|---|
| 0 | 1 | 24 |
| 0 | 1 | 24 |
| 1× | done |
| 1× | saturated |
| 1× | saturated |
Compiled 5 to 4 computations (20% saved)
Compiled 22 to 16 computations (27.3% saved)
Loading profile data...