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 ∧ − x_13_0 ≤ 0 ∧ 1 − x_13_0 + x_13_post ≤ 0 ∧ −1 + x_13_0 − x_13_post ≤ 0 ∧ rt_11_post − st_14_0 ≤ 0 ∧ − rt_11_post + st_14_0 ≤ 0 ∧ rt_11_0 − rt_11_post ≤ 0 ∧ − rt_11_0 + rt_11_post ≤ 0 ∧ x_13_0 − x_13_post ≤ 0 ∧ − x_13_0 + x_13_post ≤ 0 ∧ − st_14_0 + st_14_0 ≤ 0 ∧ st_14_0 − st_14_0 ≤ 0
0	1	1:	0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 + x_13_0 ≤ 0 ∧ rt_11_post − st_14_0 ≤ 0 ∧ − rt_11_post + st_14_0 ≤ 0 ∧ rt_11_0 − rt_11_post ≤ 0 ∧ − rt_11_0 + rt_11_post ≤ 0 ∧ − x_13_post + x_13_post ≤ 0 ∧ x_13_post − x_13_post ≤ 0 ∧ − x_13_0 + x_13_0 ≤ 0 ∧ x_13_0 − x_13_0 ≤ 0 ∧ − st_14_0 + st_14_0 ≤ 0 ∧ st_14_0 − st_14_0 ≤ 0
2	2	0:	− x_13_post + x_13_post ≤ 0 ∧ x_13_post − x_13_post ≤ 0 ∧ − x_13_0 + x_13_0 ≤ 0 ∧ x_13_0 − x_13_0 ≤ 0 ∧ − st_14_0 + st_14_0 ≤ 0 ∧ st_14_0 − st_14_0 ≤ 0 ∧ − rt_11_post + rt_11_post ≤ 0 ∧ rt_11_post − rt_11_post ≤ 0 ∧ − rt_11_0 + rt_11_0 ≤ 0 ∧ rt_11_0 − rt_11_0 ≤ 0

We consider the following cutpoint-transitions:

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

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

Hints:

There exist no SCC in the program graph.

T2Cert