by T2Cert
0 | 0 | 1: | − i_0 + nodecount_0 ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
0 | 1 | 2: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 + i_0 − nodecount_0 ≤ 0 ∧ −1 − i_0 + i_post ≤ 0 ∧ 1 + i_0 − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
3 | 2 | 4: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ −1 − i_0 + i_post ≤ 0 ∧ 1 + i_0 − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
3 | 3 | 1: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
5 | 4 | 2: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ edgecount_0 − i_0 ≤ 0 ∧ i_post ≤ 0 ∧ − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
5 | 5 | 3: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − edgecount_0 + i_0 ≤ 0 ∧ x_0 − x_post ≤ 0 ∧ − x_0 + x_post ≤ 0 ∧ y_0 − y_post ≤ 0 ∧ − y_0 + y_post ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
6 | 6 | 7: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ −1 − j_0 + j_post ≤ 0 ∧ 1 + j_0 − j_post ≤ 0 ∧ j_0 − j_post ≤ 0 ∧ − j_0 + j_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
8 | 7 | 9: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ edgecount_0 − j_0 ≤ 0 ∧ −1 − i_0 + i_post ≤ 0 ∧ 1 + i_0 − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
8 | 8 | 6: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − edgecount_0 + j_0 ≤ 0 ∧ x_0 − x_post ≤ 0 ∧ − x_0 + x_post ≤ 0 ∧ y_0 − y_post ≤ 0 ∧ − y_0 + y_post ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
10 | 9 | 4: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ − i_0 + nodecount_0 ≤ 0 ∧ i_post ≤ 0 ∧ − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
10 | 10 | 7: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 + i_0 − nodecount_0 ≤ 0 ∧ j_post ≤ 0 ∧ − j_post ≤ 0 ∧ j_0 − j_post ≤ 0 ∧ − j_0 + j_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
11 | 11 | 12: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
12 | 12 | 13: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ −1 − i_0 + i_post ≤ 0 ∧ 1 + i_0 − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
13 | 13 | 14: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
15 | 14 | 11: | 1 − i_0 + source_0 ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
15 | 15 | 11: | 1 + i_0 − source_0 ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
15 | 16 | 12: | i_0 − source_0 ≤ 0 ∧ − i_0 + source_0 ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
14 | 17 | 9: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ − i_0 + nodecount_0 ≤ 0 ∧ i_post ≤ 0 ∧ − i_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
14 | 18 | 15: | 1 + i_0 − nodecount_0 ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
9 | 19 | 10: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
7 | 20 | 8: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
4 | 21 | 5: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
2 | 22 | 0: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 | |
16 | 23 | 13: | 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ i_post ≤ 0 ∧ − i_post ≤ 0 ∧ edgecount_0 − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_post ≤ 0 ∧ i_0 − i_post ≤ 0 ∧ − i_0 + i_post ≤ 0 ∧ nodecount_0 − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_post ≤ 0 ∧ source_0 − source_post ≤ 0 ∧ − source_0 + source_post ≤ 0 ∧ − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 | |
17 | 24 | 16: | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
The following invariants are asserted.
0: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
1: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
2: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
3: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
4: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
5: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
6: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
7: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
8: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
9: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
10: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
11: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
12: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
13: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
14: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
15: | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 |
16: | TRUE |
17: | TRUE |
The invariants are proved as follows.
0 | (0) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
1 | (1) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
2 | (2) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
3 | (3) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
4 | (4) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
5 | (5) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
6 | (6) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
7 | (7) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
8 | (8) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
9 | (9) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
10 | (10) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
11 | (11) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
12 | (12) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
13 | (13) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
14 | (14) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
15 | (15) | −16 + edgecount_post ≤ 0 ∧ 16 − edgecount_post ≤ 0 ∧ −5 + nodecount_post ≤ 0 ∧ 5 − nodecount_post ≤ 0 ∧ source_post ≤ 0 ∧ − source_post ≤ 0 ∧ −16 + edgecount_0 ≤ 0 ∧ 16 − edgecount_0 ≤ 0 ∧ −5 + nodecount_0 ≤ 0 ∧ 5 − nodecount_0 ≤ 0 ∧ − source_0 ≤ 0 | ||
16 | (16) | TRUE | ||
17 | (17) | TRUE |
0 | 0 1 | |
0 | 1 2 | |
2 | 22 0 | |
3 | 2 4 | |
3 | 3 1 | |
4 | 21 5 | |
5 | 4 2 | |
5 | 5 3 | |
6 | 6 7 | |
7 | 20 8 | |
8 | 7 9 | |
8 | 8 6 | |
9 | 19 10 | |
10 | 9 4 | |
10 | 10 7 | |
11 | 11 12 | |
12 | 12 13 | |
13 | 13 14 | |
14 | 17 9 | |
14 | 18 15 | |
15 | 14 11 | |
15 | 15 11 | |
15 | 16 12 | |
16 | 23 13 | |
17 | 24 16 |
2 | 25 | : | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
4 | 32 | : | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
7 | 39 | : | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
9 | 46 | : | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
13 | 53 | : | − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0 |
We remove transitions
, , , , , , using the following ranking functions, which are bounded by −27.17: | 0 |
16: | 0 |
11: | 0 |
12: | 0 |
13: | 0 |
14: | 0 |
15: | 0 |
6: | 0 |
7: | 0 |
8: | 0 |
9: | 0 |
10: | 0 |
3: | 0 |
4: | 0 |
5: | 0 |
0: | 0 |
2: | 0 |
1: | 0 |
: | −8 |
: | −9 |
: | −10 |
: | −10 |
: | −10 |
: | −10 |
: | −10 |
: | −10 |
: | −10 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −11 |
: | −14 |
: | −14 |
: | −14 |
: | −14 |
: | −14 |
: | −15 |
: | −15 |
: | −15 |
: | −15 |
: | −16 |
26 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
33 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
40 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
47 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
54 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
28 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
26 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
35 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
33 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
42 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
40 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
49 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
47 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
56 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.
54 : − y_post + y_post ≤ 0 ∧ y_post − y_post ≤ 0 ∧ − y_0 + y_0 ≤ 0 ∧ y_0 − y_0 ≤ 0 ∧ − x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − source_post + source_post ≤ 0 ∧ source_post − source_post ≤ 0 ∧ − source_0 + source_0 ≤ 0 ∧ source_0 − source_0 ≤ 0 ∧ − nodecount_post + nodecount_post ≤ 0 ∧ nodecount_post − nodecount_post ≤ 0 ∧ − nodecount_0 + nodecount_0 ≤ 0 ∧ nodecount_0 − nodecount_0 ≤ 0 ∧ − j_post + j_post ≤ 0 ∧ j_post − j_post ≤ 0 ∧ − j_0 + j_0 ≤ 0 ∧ j_0 − j_0 ≤ 0 ∧ − i_post + i_post ≤ 0 ∧ i_post − i_post ≤ 0 ∧ − i_0 + i_0 ≤ 0 ∧ i_0 − i_0 ≤ 0 ∧ − edgecount_post + edgecount_post ≤ 0 ∧ edgecount_post − edgecount_post ≤ 0 ∧ − edgecount_0 + edgecount_0 ≤ 0 ∧ edgecount_0 − edgecount_0 ≤ 0
We consider subproblems for each of the 4 SCC(s) of the program graph.
Here we consider the SCC {
, , , }.We remove transition
using the following ranking functions, which are bounded by 0.: | −6⋅i_0 + 6⋅nodecount_0 − nodecount_post |
: | −1 − 6⋅i_0 + 6⋅nodecount_0 |
: | −13 + edgecount_post − 6⋅i_0 + 6⋅nodecount_0 − nodecount_post |
: | −6⋅i_0 + 6⋅nodecount_0 |
26 | lexWeak[ [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 0, 0, 0, 0, 0, 0, 0, 0, 6, 1, 0, 0, 0] ] |
28 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] ] |
lexStrict[ [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] ] |
We remove transitions 26, 28, using the following ranking functions, which are bounded by −6.
: | − nodecount_0 − nodecount_post |
: | 0 |
: | − nodecount_post |
: | 1 |
26 | lexStrict[ [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
28 | lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We consider 1 subproblems corresponding to sets of cut-point transitions as follows.
There remain no cut-point transition to consider. Hence the cooperation termination is trivial.
Here we consider the SCC {
, , , , }.We remove transition
using the following ranking functions, which are bounded by −1743.: | −6⋅edgecount_0 − edgecount_post − 114⋅i_0 |
: | −114⋅i_0 |
: | −6⋅edgecount_0 − edgecount_post − 114⋅i_0 + 16⋅nodecount_post |
: | −6⋅edgecount_0 − 114⋅i_0 + 16⋅nodecount_post |
: | 97 − 6⋅edgecount_0 − 114⋅i_0 |
33 | lexWeak[ [0, 0, 16, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 114, 0, 0, 0, 6] ] |
35 | lexWeak[ [0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 114, 0, 0, 0, 0] ] |
lexWeak[ [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 114, 0, 114, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6] ] | |
lexStrict[ [0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 114, 0, 1, 0, 6] , [1, 0, 0, 16, 0, 0, 120, 0, 0, 0, 0, 0, 0, 0, 114, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 114, 0, 1, 0, 6] ] |
We remove transitions 35, , using the following ranking functions, which are bounded by −97.
: | edgecount_post |
: | −16⋅nodecount_post |
: | −1 − 6⋅edgecount_0 |
: | −6⋅edgecount_0 |
: | 0 |
33 | lexWeak[ [0, 0, 16, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6] ] |
35 | lexStrict[ [0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
lexStrict[ [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6] , [0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We remove transition 33 using the following ranking functions, which are bounded by 4.
: | 0 |
: | nodecount_0 |
: | 0 |
: | 0 |
: | 0 |
33 | lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We consider 1 subproblems corresponding to sets of cut-point transitions as follows.
There remain no cut-point transition to consider. Hence the cooperation termination is trivial.
Here we consider the SCC {
, , , , , , , , }.We remove transition
using the following ranking functions, which are bounded by 175.: | −171⋅i_0 + 171⋅nodecount_0 |
: | −171⋅i_0 + 171⋅nodecount_0 |
: | −171⋅i_0 + 171⋅nodecount_0 |
: | −80 − 171⋅i_0 + 171⋅nodecount_0 + 34⋅nodecount_post |
: | −165 − 171⋅i_0 + 171⋅nodecount_0 + 34⋅nodecount_post |
: | −171⋅i_0 + 171⋅nodecount_0 |
: | −171⋅i_0 + 171⋅nodecount_0 |
: | −10⋅edgecount_0 − 171⋅i_0 + 171⋅nodecount_0 + 34⋅nodecount_post |
: | −171⋅i_0 + 171⋅nodecount_0 + 34⋅nodecount_post |
40 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] |
42 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] |
47 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 10] ] |
49 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 34, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 171, 0, 0, 0, 0] , [0, 0, 0, 34, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0, 0, 0, 0, 0, 171, 0, 0, 0, 0] ] |
We remove transition
using the following ranking functions, which are bounded by −2252.: | 5⋅edgecount_post − 165⋅j_0 + nodecount_post |
: | 10⋅edgecount_0 + 5⋅edgecount_post − 165⋅j_0 |
: | 9⋅edgecount_0 + 5⋅edgecount_post − 165⋅j_0 |
: | 9⋅edgecount_0 − 165⋅j_0 |
: | 8⋅edgecount_0 − 165⋅j_0 |
: | 16 + 9⋅edgecount_0 + 5⋅edgecount_post − 165⋅j_0 |
: | 10 + 10⋅edgecount_0 + 5⋅edgecount_post − 165⋅j_0 − nodecount_post |
: | 128 − 165⋅j_0 |
: | 9⋅edgecount_0 + 5⋅edgecount_post − 165⋅j_0 − 15⋅nodecount_post |
40 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 5, 0, 9, 0] ] |
42 | lexWeak[ [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 5, 0, 10, 0] ] |
47 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 0, 0, 0, 0] ] |
49 | lexWeak[ [0, 5, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 0, 0, 9, 0] ] |
lexWeak[ [0, 0, 0, 2, 0, 0, 10, 0, 0, 0, 0, 0, 0, 165, 0, 165, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 5, 0, 10, 0] ] | |
lexWeak[ [0, 0, 0, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 165, 5, 0, 9, 0] ] | |
lexStrict[ [0, 0, 1, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 5, 0, 0, 0] , [0, 5, 0, 0, 0, 0, 156, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 0, 0, 8, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 0, 0, 0, 0, 5, 0, 9, 0] ] |
We remove transitions 40, 42, 47, 49, , , , using the following ranking functions, which are bounded by −257.
: | 3⋅nodecount_0 |
: | −160 + 3⋅nodecount_0 |
: | −5 + 3⋅nodecount_0 − 48⋅nodecount_post |
: | −48⋅nodecount_post |
: | −17⋅edgecount_post |
: | 3⋅nodecount_0 − 48⋅nodecount_post |
: | −80 + 3⋅nodecount_0 |
: | −16⋅edgecount_post |
: | −10 + 3⋅nodecount_0 − 48⋅nodecount_post |
40 | lexStrict[ [0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
42 | lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
47 | lexStrict[ [0, 16, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0] , [0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
49 | lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 48, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 48, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0] , [16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 48, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We consider 2 subproblems corresponding to sets of cut-point transitions as follows.
There remain no cut-point transition to consider. Hence the cooperation termination is trivial.
There remain no cut-point transition to consider. Hence the cooperation termination is trivial.
Here we consider the SCC {
, , , , , , }.We remove transitions
, , using the following ranking functions, which are bounded by −257.: | −47 + 3⋅edgecount_post − 80⋅i_0 + 3⋅nodecount_0 + 80⋅source_0 |
: | −80⋅i_0 + 3⋅nodecount_0 + 80⋅source_0 |
: | 5 + 5⋅edgecount_0 − 80⋅i_0 + 80⋅source_0 |
: | 16 + 3⋅edgecount_post − 80⋅i_0 + 80⋅source_0 |
: | 3⋅edgecount_post − 80⋅i_0 + 80⋅source_0 |
: | 5⋅edgecount_post − 80⋅i_0 + 80⋅source_0 |
: | −5 + 5⋅edgecount_0 − 80⋅i_0 + 3⋅nodecount_0 + 80⋅source_0 |
54 | lexWeak[ [5, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 5, 0, 0, 0] ] |
56 | lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 5, 0] ] |
lexWeak[ [0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 80, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 5, 0] ] | |
lexWeak[ [0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 3, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 80, 3, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 80, 3, 0, 0, 0] , [0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 3, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0] , [0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 80, 3, 0, 0, 0] , [0, 3, 0, 0, 0, 0, 0, 0, 80, 0, 80, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We remove transitions 54, 56, , , using the following ranking functions, which are bounded by −33.
: | 2⋅nodecount_0 |
: | − edgecount_0 + 2⋅nodecount_0 |
: | − edgecount_0 |
: | −2⋅edgecount_post − nodecount_0 |
: | 3⋅nodecount_0 |
: | −2⋅edgecount_post |
: | −5 − edgecount_0 + 2⋅nodecount_0 |
54 | lexStrict[ [0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0] , [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
56 | lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] , [0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1] , [0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0] , [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] | |
lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We remove transition
using the following ranking functions, which are bounded by 4.: | 0 |
: | 0 |
: | 0 |
: | 0 |
: | nodecount_0 |
: | 0 |
: | 0 |
lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ] |
We consider 1 subproblems corresponding to sets of cut-point transitions as follows.
There remain no cut-point transition to consider. Hence the cooperation termination is trivial.
T2Cert