# LTS Termination Proof

by AProVE

## Input

Integer Transition System
• Initial Location: l5, l6, l1, l3, l0, l2
• Transitions: (pre-variables and post-variables)  l0 1 l1: x1 = _nI6HAT0 ∧ x2 = _nX4HAT0 ∧ x3 = _nX9HAT0 ∧ x4 = _nXHAT0 ∧ x5 = _res10HAT0 ∧ x6 = _res5HAT0 ∧ x7 = _ret_nBC18HAT0 ∧ x8 = _ret_nBC211HAT0 ∧ x9 = _tmp7HAT0 ∧ x10 = _tmpHAT0 ∧ x11 = _tmp___0HAT0 ∧ x1 = _nI6HATpost ∧ x2 = _nX4HATpost ∧ x3 = _nX9HATpost ∧ x4 = _nXHATpost ∧ x5 = _res10HATpost ∧ x6 = _res5HATpost ∧ x7 = _ret_nBC18HATpost ∧ x8 = _ret_nBC211HATpost ∧ x9 = _tmp7HATpost ∧ x10 = _tmpHATpost ∧ x11 = _tmp___0HATpost ∧ _tmp___0HAT0 = _tmp___0HATpost ∧ _tmp7HAT0 = _tmp7HATpost ∧ _tmpHAT0 = _tmpHATpost ∧ _ret_nBC211HAT0 = _ret_nBC211HATpost ∧ _ret_nBC18HAT0 = _ret_nBC18HATpost ∧ _res10HAT0 = _res10HATpost ∧ _nX9HAT0 = _nX9HATpost ∧ _nX4HAT0 = _nX4HATpost ∧ _nXHAT0 = _nXHATpost ∧ _nI6HATpost = 1 + _nI6HAT0 ∧ _res5HATpost = _res5HAT0 + _tmp7HAT0 l2 2 l0: x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x4 = _x3 ∧ x5 = _x4 ∧ x6 = _x5 ∧ x7 = _x6 ∧ x8 = _x7 ∧ x9 = _x8 ∧ x10 = _x9 ∧ x11 = _x10 ∧ x1 = _x11 ∧ x2 = _x12 ∧ x3 = _x13 ∧ x4 = _x14 ∧ x5 = _x15 ∧ x6 = _x16 ∧ x7 = _x17 ∧ x8 = _x18 ∧ x9 = _x19 ∧ x10 = _x20 ∧ x11 = _x21 ∧ _x10 = _x21 ∧ _x9 = _x20 ∧ _x7 = _x18 ∧ _x6 = _x17 ∧ _x5 = _x16 ∧ _x4 = _x15 ∧ _x2 = _x13 ∧ _x1 = _x12 ∧ _x3 = _x14 ∧ _x = _x11 ∧ _x19 = 0 l2 3 l0: x1 = _x22 ∧ x2 = _x23 ∧ x3 = _x24 ∧ x4 = _x25 ∧ x5 = _x26 ∧ x6 = _x27 ∧ x7 = _x28 ∧ x8 = _x29 ∧ x9 = _x30 ∧ x10 = _x31 ∧ x11 = _x32 ∧ x1 = _x33 ∧ x2 = _x34 ∧ x3 = _x35 ∧ x4 = _x36 ∧ x5 = _x37 ∧ x6 = _x38 ∧ x7 = _x39 ∧ x8 = _x40 ∧ x9 = _x41 ∧ x10 = _x42 ∧ x11 = _x43 ∧ _x32 = _x43 ∧ _x31 = _x42 ∧ _x29 = _x40 ∧ _x28 = _x39 ∧ _x27 = _x38 ∧ _x26 = _x37 ∧ _x24 = _x35 ∧ _x23 = _x34 ∧ _x25 = _x36 ∧ _x22 = _x33 ∧ _x41 = 1 l3 4 l4: x1 = _x44 ∧ x2 = _x45 ∧ x3 = _x46 ∧ x4 = _x47 ∧ x5 = _x48 ∧ x6 = _x49 ∧ x7 = _x50 ∧ x8 = _x51 ∧ x9 = _x52 ∧ x10 = _x53 ∧ x11 = _x54 ∧ x1 = _x55 ∧ x2 = _x56 ∧ x3 = _x57 ∧ x4 = _x58 ∧ x5 = _x59 ∧ x6 = _x60 ∧ x7 = _x61 ∧ x8 = _x62 ∧ x9 = _x63 ∧ x10 = _x64 ∧ x11 = _x65 ∧ 32 ≤ _x44 ∧ _x61 = _x49 ∧ _x64 = _x61 ∧ _x57 = _x47 ∧ _x66 = _x57 ∧ _x67 = _x67 ∧ _x68 = _x68 ∧ _x69 = _x69 ∧ _x70 = _x70 ∧ _x59 = _x59 ∧ _x62 = _x59 ∧ _x65 = _x62 ∧ _x44 = _x55 ∧ _x47 = _x58 ∧ _x45 = _x56 ∧ _x49 = _x60 ∧ _x52 = _x63 l3 5 l2: x1 = _x71 ∧ x2 = _x72 ∧ x3 = _x73 ∧ x4 = _x74 ∧ x5 = _x75 ∧ x6 = _x76 ∧ x7 = _x77 ∧ x8 = _x78 ∧ x9 = _x79 ∧ x10 = _x80 ∧ x11 = _x81 ∧ x1 = _x82 ∧ x2 = _x83 ∧ x3 = _x84 ∧ x4 = _x85 ∧ x5 = _x86 ∧ x6 = _x87 ∧ x7 = _x88 ∧ x8 = _x89 ∧ x9 = _x90 ∧ x10 = _x91 ∧ x11 = _x92 ∧ _x81 = _x92 ∧ _x79 = _x90 ∧ _x80 = _x91 ∧ _x78 = _x89 ∧ _x77 = _x88 ∧ _x76 = _x87 ∧ _x75 = _x86 ∧ _x73 = _x84 ∧ _x72 = _x83 ∧ _x74 = _x85 ∧ _x71 = _x82 ∧ 1 + _x71 ≤ 32 l1 6 l3: x1 = _x93 ∧ x2 = _x94 ∧ x3 = _x95 ∧ x4 = _x96 ∧ x5 = _x97 ∧ x6 = _x98 ∧ x7 = _x99 ∧ x8 = _x100 ∧ x9 = _x101 ∧ x10 = _x102 ∧ x11 = _x103 ∧ x1 = _x104 ∧ x2 = _x105 ∧ x3 = _x106 ∧ x4 = _x107 ∧ x5 = _x108 ∧ x6 = _x109 ∧ x7 = _x110 ∧ x8 = _x111 ∧ x9 = _x112 ∧ x10 = _x113 ∧ x11 = _x114 ∧ _x103 = _x114 ∧ _x101 = _x112 ∧ _x102 = _x113 ∧ _x100 = _x111 ∧ _x99 = _x110 ∧ _x98 = _x109 ∧ _x97 = _x108 ∧ _x95 = _x106 ∧ _x94 = _x105 ∧ _x96 = _x107 ∧ _x93 = _x104 l5 7 l1: x1 = _x115 ∧ x2 = _x116 ∧ x3 = _x117 ∧ x4 = _x118 ∧ x5 = _x119 ∧ x6 = _x120 ∧ x7 = _x121 ∧ x8 = _x122 ∧ x9 = _x123 ∧ x10 = _x124 ∧ x11 = _x125 ∧ x1 = _x126 ∧ x2 = _x127 ∧ x3 = _x128 ∧ x4 = _x129 ∧ x5 = _x130 ∧ x6 = _x131 ∧ x7 = _x132 ∧ x8 = _x133 ∧ x9 = _x134 ∧ x10 = _x135 ∧ x11 = _x136 ∧ _x125 = _x136 ∧ _x123 = _x134 ∧ _x124 = _x135 ∧ _x122 = _x133 ∧ _x121 = _x132 ∧ _x119 = _x130 ∧ _x117 = _x128 ∧ _x118 = _x129 ∧ _x126 = 0 ∧ _x131 = 0 ∧ _x127 = _x118 l6 8 l5: x1 = _x137 ∧ x2 = _x138 ∧ x3 = _x139 ∧ x4 = _x140 ∧ x5 = _x141 ∧ x6 = _x142 ∧ x7 = _x143 ∧ x8 = _x144 ∧ x9 = _x145 ∧ x10 = _x146 ∧ x11 = _x147 ∧ x1 = _x148 ∧ x2 = _x149 ∧ x3 = _x150 ∧ x4 = _x151 ∧ x5 = _x152 ∧ x6 = _x153 ∧ x7 = _x154 ∧ x8 = _x155 ∧ x9 = _x156 ∧ x10 = _x157 ∧ x11 = _x158 ∧ _x147 = _x158 ∧ _x145 = _x156 ∧ _x146 = _x157 ∧ _x144 = _x155 ∧ _x143 = _x154 ∧ _x142 = _x153 ∧ _x141 = _x152 ∧ _x139 = _x150 ∧ _x138 = _x149 ∧ _x140 = _x151 ∧ _x137 = _x148

## Proof

### 1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
 l5 l5 l5: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11 l6 l6 l6: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11 l1 l1 l1: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11 l3 l3 l3: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11 l0 l0 l0: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11 l2 l2 l2: x1 = x1 ∧ x2 = x2 ∧ x3 = x3 ∧ x4 = x4 ∧ x5 = x5 ∧ x6 = x6 ∧ x7 = x7 ∧ x8 = x8 ∧ x9 = x9 ∧ x10 = x10 ∧ x11 = x11
and for every transition t, a duplicate t is considered.

### 2 SCC Decomposition

We consider subproblems for each of the 1 SCC(s) of the program graph.

### 2.1 SCC Subproblem 1/1

Here we consider the SCC { l1, l3, l0, l2 }.

### 2.1.1 Transition Removal

We remove transition 5 using the following ranking functions, which are bounded by 0.

 l0: 30 − x1 l1: 31 − x1 l2: 30 − x1 l3: 31 − x1

### 2.1.2 Transition Removal

We remove transitions 1, 3, 2, 6 using the following ranking functions, which are bounded by 0.

 l0: 2 l1: 1 l2: 3 l3: 0

### 2.1.3 Trivial Cooperation Program

There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.

## Tool configuration

AProVE

• version: AProVE Commit ID: unknown
• strategy: Statistics for single proof: 100.00 % (6 real / 0 unknown / 0 assumptions / 6 total proof steps)