LTS Termination Proof

by T2Cert

Input

Integer Transition System

Transitions: (pre-variables and post-variables)

0	0	1:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ a22_0 − a22_post ≤ 0 ∧ − a22_0 + a22_post ≤ 0 ∧ a44_0 − a44_post ≤ 0 ∧ − a44_0 + a44_post ≤ 0
2	1	0:		− a44_post + a44_post ≤ 0 ∧ a44_post − a44_post ≤ 0 ∧ − a44_0 + a44_0 ≤ 0 ∧ a44_0 − a44_0 ≤ 0 ∧ − a22_post + a22_post ≤ 0 ∧ a22_post − a22_post ≤ 0 ∧ − a22_0 + a22_0 ≤ 0 ∧ a22_0 − a22_0 ≤ 0

We consider the following cutpoint-transitions:

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

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

Hints:

0	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0] ]
1	lexStrict[ [0, 0, 0, 0, 0, 0, 0, 0] , [0, 0, 0, 0, 0, 0, 0, 0] ]

There exist no SCC in the program graph.

T2Cert