LTS Termination Proof

by AProVE

Input

• Initial Location: l4, l1, l0, l2
• Transitions: (pre-variables and post-variables)

  l0	1	l1:		x1 = _Result_4HAT0 ∧ x2 = _x_5HAT0 ∧ x1 = _Result_4HATpost ∧ x2 = _x_5HATpost ∧ _Result_4HAT0 = _Result_4HATpost ∧ _x_5HATpost = 1 + _x_5HAT0 ∧ − _x_5HAT0 ≤ 0
  l0	2	l1:		x1 = _x ∧ x2 = _x1 ∧ x1 = _x2 ∧ x2 = _x3 ∧ _x1 = _x3 ∧ _x = _x2 ∧ 0 ≤ −1 − _x1
  l2	3	l0:		x1 = _x4 ∧ x2 = _x5 ∧ x1 = _x6 ∧ x2 = _x7 ∧ _x5 = _x7 ∧ _x4 = _x6
  l1	4	l3:		x1 = _x8 ∧ x2 = _x9 ∧ x1 = _x10 ∧ x2 = _x11 ∧ _x9 = _x11 ∧ _x10 = _x10
  l4	5	l2:		x1 = _x12 ∧ x2 = _x13 ∧ x1 = _x14 ∧ x2 = _x15 ∧ _x13 = _x15 ∧ _x12 = _x14

Proof

1 Switch to Cooperation Termination Proof

2 SCC Decomposition

There exist no SCC in the program graph.

Tool configuration

AProVE

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