LTS Termination Proof

by T2Cert

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
2 17 2: x0_post + x0_post ≤ 0x0_postx0_post ≤ 0x0_0 + x0_0 ≤ 0x0_0x0_0 ≤ 0oldX1_post + oldX1_post ≤ 0oldX1_postoldX1_post ≤ 0oldX1_0 + oldX1_0 ≤ 0oldX1_0oldX1_0 ≤ 0oldX0_post + oldX0_post ≤ 0oldX0_postoldX0_post ≤ 0oldX0_0 + oldX0_0 ≤ 0oldX0_0oldX0_0 ≤ 0
and for every transition t, a duplicate t is considered.

2 Transition Removal

We remove transitions 0, 5, 6, 8, 10, 11, 12, 13, 14, 15, 16 using the following ranking functions, which are bounded by −15.

7: 0
6: 0
0: 0
2: 0
3: 0
5: 0
4: 0
1: 0
7: −6
6: −7
0: −8
2: −8
3: −8
5: −8
2_var_snapshot: −8
2*: −8
4: −9
1: −10

3 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

2* 20 2: x0_post + x0_post ≤ 0x0_postx0_post ≤ 0x0_0 + x0_0 ≤ 0x0_0x0_0 ≤ 0oldX1_post + oldX1_post ≤ 0oldX1_postoldX1_post ≤ 0oldX1_0 + oldX1_0 ≤ 0oldX1_0oldX1_0 ≤ 0oldX0_post + oldX0_post ≤ 0oldX0_postoldX0_post ≤ 0oldX0_0 + oldX0_0 ≤ 0oldX0_0oldX0_0 ≤ 0

4 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

2 18 2_var_snapshot: x0_post + x0_post ≤ 0x0_postx0_post ≤ 0x0_0 + x0_0 ≤ 0x0_0x0_0 ≤ 0oldX1_post + oldX1_post ≤ 0oldX1_postoldX1_post ≤ 0oldX1_0 + oldX1_0 ≤ 0oldX1_0oldX1_0 ≤ 0oldX0_post + oldX0_post ≤ 0oldX0_postoldX0_post ≤ 0oldX0_0 + oldX0_0 ≤ 0oldX0_0oldX0_0 ≤ 0

5 SCC Decomposition

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

5.1 SCC Subproblem 1/1

Here we consider the SCC { 0, 2, 3, 5, 2_var_snapshot, 2* }.

5.1.1 Transition Removal

We remove transition 3 using the following ranking functions, which are bounded by 7.

0: −1 + 4⋅x0_0
2: 1 + 4⋅x0_0
3: 4⋅x0_0
5: 4⋅x0_0
2_var_snapshot: 4⋅x0_0
2*: 2 + 4⋅x0_0

5.1.2 Transition Removal

We remove transitions 18, 20, 1, 2, 4, 7, 9 using the following ranking functions, which are bounded by −6.

0: −1
2: −3
3: −6⋅x0_0
5: −5
2_var_snapshot: −4
2*: −2

5.1.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

5.1.3.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 17.

5.1.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

Tool configuration

T2Cert