LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f1220_0_create_Return f1220_0_create_Return f1220_0_create_Return: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
f2992_0_collectVariables_NULL f2992_0_collectVariables_NULL f2992_0_collectVariables_NULL: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
f2072_0_create_GE f2072_0_create_GE f2072_0_create_GE: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
f804_0_create_GT f804_0_create_GT f804_0_create_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
f2311_0_getVariables_InvokeMethod f2311_0_getVariables_InvokeMethod f2311_0_getVariables_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5
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 { f2072_0_create_GE, f804_0_create_GT }.

2.1.1 Transition Removal

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

f804_0_create_GT: 1 + 2⋅x1
f2072_0_create_GE: 2⋅x1

2.1.2 Transition Removal

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

f2072_0_create_GE: x2 + x3

2.1.3 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 { f2992_0_collectVariables_NULL }.

2.2.1 Transition Removal

We remove transitions 8, 9, 10 using the following ranking functions, which are bounded by 0.

f2992_0_collectVariables_NULL: x2

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