LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f229_0_random_ArrayAccess f229_0_random_ArrayAccess f229_0_random_ArrayAccess: x1 = x1x2 = x2x3 = x3
f194_0_createList_LE f194_0_createList_LE f194_0_createList_LE: x1 = x1x2 = x2x3 = x3
f169_0_createList_Return f169_0_createList_Return f169_0_createList_Return: x1 = x1x2 = x2x3 = x3
f298_0_appE_NONNULL f298_0_appE_NONNULL f298_0_appE_NONNULL: x1 = x1x2 = x2x3 = x3
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3
__init __init __init: x1 = x1x2 = x2x3 = 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 { f194_0_createList_LE }.

2.1.1 Transition Removal

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

f194_0_createList_LE: 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 { f298_0_appE_NONNULL }.

2.2.1 Transition Removal

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

f298_0_appE_NONNULL: −1 + x2

2.2.2 Transition Removal

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

f298_0_appE_NONNULL: −1 + x1

2.2.3 Trivial Cooperation Program

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

Tool configuration

AProVE