LTS Termination Proof

Input

Integer Transition System

Transitions: (pre-variables and post-variables)

l0	1	l1:		x1 = _aHAT0 ∧ x2 = _ret_incr3HAT0 ∧ x3 = _x2HAT0 ∧ x1 = _aHATpost ∧ x2 = _ret_incr3HATpost ∧ x3 = _x2HATpost ∧ _aHAT1 = 1 ∧ _x2HATpost = _aHAT1 ∧ _ret_incr3HATpost = 1 + _x2HATpost ∧ _aHATpost = _ret_incr3HATpost
l2	2	l0:		x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x1 = _x3 ∧ x2 = _x4 ∧ x3 = _x5 ∧ _x2 = _x5 ∧ _x1 = _x4 ∧ _x = _x3

We consider the following cutpoint-transitions:

l0	l0	l0:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
l2	l2	l2:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3

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

There exist no SCC in the program graph.

version: AProVE Commit ID: unknown
strategy: Statistics for single proof: 100.00 % (2 real / 0 unknown / 0 assumptions / 2 total proof steps)