LTS Termination Proof

by AProVE

Input

• Initial Location: f212_0_main_LE, f161_0_main_LT, f1_0_main_Load, __init
• Transitions: (pre-variables and post-variables)

  f1_0_main_Load	1	f161_0_main_LT:		x1 = _arg1 ∧ x2 = _arg2 ∧ x1 = _arg1P ∧ x2 = _arg2P ∧ 0 ≤ _arg1 − 1 ∧ −1 ≤ _arg1P − 1 ∧ −1 ≤ _arg2 − 1
  f161_0_main_LT	2	f212_0_main_LE:		x1 = _x ∧ x2 = _x1 ∧ x1 = _x2 ∧ x2 = _x3 ∧ 1 = _x3 ∧ _x = _x2 ∧ −1 ≤ _x − 1
  f212_0_main_LE	3	f161_0_main_LT:		x1 = _x4 ∧ x2 = _x5 ∧ x1 = _x6 ∧ x2 = _x7 ∧ _x4 − 1 = _x6 ∧ _x4 ≤ _x5
  f212_0_main_LE	4	f212_0_main_LE:		x1 = _x8 ∧ x2 = _x9 ∧ x1 = _x10 ∧ x2 = _x11 ∧ 2⋅_x9 = _x11 ∧ _x8 = _x10 ∧ _x9 ≤ _x8 − 1 ∧ 0 ≤ _x9 − 1
  __init	5	f1_0_main_Load:		x1 = _x12 ∧ x2 = _x13 ∧ x1 = _x14 ∧ x2 = _x15 ∧ 0 ≤ 0

Proof

1 Switch to Cooperation Termination Proof

2 SCC Decomposition

We consider subproblems for each of the 1 SCC(s) of the program graph.

2.1 SCC Subproblem 1/1

Here we consider the SCC { f212_0_main_LE, f161_0_main_LT }.

2.1.1 Transition Removal

We remove transition 2 using the following ranking functions, which are bounded by 0.

2.1.2 Transition Removal

We remove transition 3 using the following ranking functions, which are bounded by 0.

2.1.3 Transition Removal

We remove transition 4 using the following ranking functions, which are bounded by 0.

2.1.4 Trivial Cooperation Program

There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.

Tool configuration

AProVE

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