LTS Termination Proof

Input

Integer Transition System

Initial Location: f571_0_sumList_NONNULL, f302_0_createList_GE, f502_0_main_InvokeMethod, f1_0_main_Load, __init

Transitions: (pre-variables and post-variables)

f1_0_main_Load	1	f302_0_createList_GE:	x1 = _arg1 ∧ x2 = _arg2 ∧ x3 = _arg3 ∧ x1 = _arg1P ∧ x2 = _arg2P ∧ x3 = _arg3P ∧ 1 = _arg3P ∧ _arg2 = _arg2P ∧ 0 ≤ _arg1 − 1 ∧ 0 ≤ _arg2 − 1 ∧ −1 ≤ _arg1P − 1
f1_0_main_Load	2	f502_0_main_InvokeMethod:	x1 = _x ∧ x2 = _x1 ∧ x3 = _x2 ∧ x1 = _x3 ∧ x2 = _x4 ∧ x3 = _x5 ∧ −1 ≤ _x6 − 1 ∧ 0 ≤ _x1 − 1 ∧ _x3 ≤ _x ∧ 0 ≤ _x − 1 ∧ 0 ≤ _x3 − 1 ∧ 2 ≤ _x4 − 1
f1_0_main_Load	3	f502_0_main_InvokeMethod:	x1 = _x7 ∧ x2 = _x9 ∧ x3 = _x10 ∧ x1 = _x11 ∧ x2 = _x12 ∧ x3 = _x13 ∧ −1 ≤ _x15 − 1 ∧ 0 ≤ _x9 − 1 ∧ _x11 ≤ _x7 ∧ _x12 − 1 ≤ _x7 ∧ 0 ≤ _x7 − 1 ∧ 0 ≤ _x11 − 1 ∧ 1 ≤ _x12 − 1
f302_0_createList_GE	4	f302_0_createList_GE:	x1 = _x16 ∧ x2 = _x17 ∧ x3 = _x19 ∧ x1 = _x20 ∧ x2 = _x21 ∧ x3 = _x22 ∧ _x19 + 1 = _x22 ∧ _x17 = _x21 ∧ _x16 − 1 = _x20 ∧ _x19 ≤ _x17 − 1 ∧ _x16 − 1 ≤ _x16 − 1 ∧ 0 ≤ _x19 − 1 ∧ −1 ≤ _x17 − 1 ∧ −1 ≤ _x16 − 1
f502_0_main_InvokeMethod	5	f571_0_sumList_NONNULL:	x1 = _x23 ∧ x2 = _x24 ∧ x3 = _x25 ∧ x1 = _x26 ∧ x2 = _x27 ∧ x3 = _x28 ∧ 0 ≤ _x29 − 1 ∧ 1 ≤ _x25 − 1 ∧ _x26 ≤ _x24 ∧ _x27 + 1 ≤ _x24 ∧ 0 ≤ _x23 − 1 ∧ 0 ≤ _x24 − 1 ∧ 0 ≤ _x26 − 1 ∧ −1 ≤ _x27 − 1 ∧ _x25 = _x28
f571_0_sumList_NONNULL	6	f571_0_sumList_NONNULL:	x1 = _x30 ∧ x2 = _x31 ∧ x3 = _x32 ∧ x1 = _x33 ∧ x2 = _x34 ∧ x3 = _x35 ∧ _x32 = _x35 ∧ −1 ≤ _x34 − 1 ∧ 0 ≤ _x33 − 1 ∧ 0 ≤ _x31 − 1 ∧ 2 ≤ _x30 − 1 ∧ _x34 + 1 ≤ _x31 ∧ _x34 + 3 ≤ _x30 ∧ _x33 ≤ _x31 ∧ 1 ≤ _x32 − 1 ∧ _x33 + 2 ≤ _x30
__init	7	f1_0_main_Load:	x1 = _x36 ∧ x2 = _x37 ∧ x3 = _x38 ∧ x1 = _x39 ∧ x2 = _x40 ∧ x3 = _x41 ∧ 0 ≤ 0

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:

f571_0_sumList_NONNULL	f571_0_sumList_NONNULL	f571_0_sumList_NONNULL:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
f302_0_createList_GE	f302_0_createList_GE	f302_0_createList_GE:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
f502_0_main_InvokeMethod	f502_0_main_InvokeMethod	f502_0_main_InvokeMethod:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
f1_0_main_Load	f1_0_main_Load	f1_0_main_Load:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3
__init	__init	__init:	x1 = x1 ∧ x2 = x2 ∧ x3 = x3

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

2 SCC Decomposition

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

2.1 SCC Subproblem 1/2

Here we consider the SCC { f571_0_sumList_NONNULL }.

2.1.1 Transition Removal

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

f571_0_sumList_NONNULL:

x2 + x1

2.1.2 Trivial Cooperation Program

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

2.2 SCC Subproblem 2/2

Here we consider the SCC { f302_0_createList_GE }.

2.2.1 Transition Removal

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

f302_0_createList_GE:

2.2.2 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 % (6 real / 0 unknown / 0 assumptions / 6 total proof steps)