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 ∧ − tmp_post + x_post ≤ 0 ∧ tmp_post − x_post ≤ 0 ∧ tmp_0 − tmp_post ≤ 0 ∧ − tmp_0 + tmp_post ≤ 0 ∧ x_0 − x_post ≤ 0 ∧ − x_0 + x_post ≤ 0
2	1	0:		− x_post + x_post ≤ 0 ∧ x_post − x_post ≤ 0 ∧ − x_0 + x_0 ≤ 0 ∧ x_0 − x_0 ≤ 0 ∧ − tmp_post + tmp_post ≤ 0 ∧ tmp_post − tmp_post ≤ 0 ∧ − tmp_0 + tmp_0 ≤ 0 ∧ tmp_0 − tmp_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.

There exist no SCC in the program graph.

T2Cert