LTS Termination Proof

by T2Cert

Input

Integer Transition System

Initial Location: 7

Transitions: (pre-variables and post-variables)

0	0	1:	0 ≤ 0 ∧ 0 ≤ 0 ∧ − x_0 ≤ 0 ∧ Result_0 − Result_post ≤ 0 ∧ − Result_0 + Result_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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0
0	1	2:	1 + x_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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
2	2	3:	− 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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
3	3	4:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ −1 − x_0 + x_post ≤ 0 ∧ 1 + x_0 − x_post ≤ 0 ∧ −1 − y_0 + y_post ≤ 0 ∧ 1 + y_0 − y_post ≤ 0 ∧ x_0 − x_post ≤ 0 ∧ − x_0 + x_post ≤ 0 ∧ y_0 − y_post ≤ 0 ∧ − y_0 + y_post ≤ 0 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
4	4	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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
0	5	5:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 + x_0 ≤ 0 ∧ 1 + y_0 ≤ 0 ∧ −1 − y_0 ≤ 0 ∧ −1 − y_0 + y_post ≤ 0 ∧ 1 + y_0 − y_post ≤ 0 ∧ ___const_99_0 − x_0 + x_post ≤ 0 ∧ − ___const_99_0 + x_0 − x_post ≤ 0 ∧ x_0 − x_post ≤ 0 ∧ − x_0 + x_post ≤ 0 ∧ y_0 − y_post ≤ 0 ∧ − y_0 + y_post ≤ 0 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
5	6	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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
6	7	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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0
7	8	6:	− 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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:

− 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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0

and for every transition t, a duplicate t is considered.

2 Transition Removal

We remove transitions 0, 7, 8 using the following ranking functions, which are bounded by −13.

7:	0
6:	0
0:	0
2:	0
3:	0
4:	0
5:	0
1:	0
7:	−5
6:	−6
0:	−7
2:	−7
3:	−7
4:	−7
5:	−7
0_var_snapshot:	−7
0*:	−7
1:	−11

Hints:

10	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
3	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
4	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
6	lexWeak[ [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] ]
7	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] ]
8	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] ]

3 Location Addition

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

0* 12 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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_0 ≤ 0

4 Location Addition

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

0 10 0_var_snapshot: − 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 ∧ − ___const_99_0 + ___const_99_0 ≤ 0 ∧ ___const_99_0 − ___const_99_0 ≤ 0 ∧ − Result_post + Result_post ≤ 0 ∧ Result_post − Result_post ≤ 0 ∧ − Result_0 + Result_0 ≤ 0 ∧ Result_0 − Result_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, 4, 5, 0_var_snapshot, 0* }.

5.1.1 Transition Removal

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

0:	1 − 8⋅y_0
2:	−1 − 8⋅y_0
3:	−2 − 8⋅y_0
4:	3 − 8⋅y_0
5:	3 − 8⋅y_0
0_var_snapshot:	−8⋅y_0
0*:	2 − 8⋅y_0

Hints:

10	lexWeak[ [0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
12	lexWeak[ [0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
1	lexWeak[ [0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2	lexWeak[ [0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
3	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0] ]
4	lexWeak[ [0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
5	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
6	lexWeak[ [0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]

5.1.2 Transition Removal

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

0:	−2 − 5⋅x_0
2:	−4 − 5⋅x_0
3:	−5 − 5⋅x_0
4:	−5⋅x_0
5:	−5⋅x_0
0_var_snapshot:	−3 − 5⋅x_0
0*:	−1 − 5⋅x_0

Hints:

10	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ]
12	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ]
1	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] , [5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ]
3	lexWeak[ [0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0] ]
4	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ]
6	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0] ]

5.1.3 Transition Removal

We remove transitions 10, 2, 3, 4, 6 using the following ranking functions, which are bounded by −3.

0:	−2
2:	2
3:	1
4:	0
5:	0
0_var_snapshot:	−3
0*:	−1

Hints:

10	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] ]
12	lexWeak[ [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] ]
2	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] ]
3	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] ]
4	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] ]
6	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] ]

5.1.4 Transition Removal

We remove transition 12 using the following ranking functions, which are bounded by −1.

0:	−1
2:	0
3:	0
4:	0
5:	0
0_var_snapshot:	0
0*:	0

Hints:

12	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] ]

5.1.5 Splitting Cut-Point Transitions

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

5.1.5.1 Cut-Point Subproblem 1/1

Here we consider cut-point transition 9.

5.1.5.1.1 Splitting Cut-Point Transitions

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

Tool configuration

T2Cert

version: 1.0