LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f507_0_sort_GE f507_0_sort_GE f507_0_sort_GE: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f229_0_main_GE f229_0_main_GE f229_0_main_GE: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f507_0_sort_GE' f507_0_sort_GE' f507_0_sort_GE': x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f1503_0_sort_InvokeMethod f1503_0_sort_InvokeMethod f1503_0_sort_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f757_0_merge_GT f757_0_merge_GT f757_0_merge_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f1440_0_merge_GT f1440_0_merge_GT f1440_0_merge_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f1_0_main_Load f1_0_main_Load f1_0_main_Load: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
f774_0_merge_GT f774_0_merge_GT f774_0_merge_GT: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

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

2.1 SCC Subproblem 1/5

Here we consider the SCC { f229_0_main_GE }.

2.1.1 Transition Removal

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

f229_0_main_GE: x2 + x3

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/5

Here we consider the SCC { f507_0_sort_GE, f507_0_sort_GE' }.

2.2.1 Transition Removal

We remove transitions 4, 5, 6, 7, 8, 9, 16, 14, 12, 10 using the following ranking functions, which are bounded by 0.

f507_0_sort_GE: −2⋅x3 + 2⋅x4
f507_0_sort_GE': −2⋅x3 + 2⋅x4 − 1

2.2.2 Trivial Cooperation Program

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

2.3 SCC Subproblem 3/5

Here we consider the SCC { f757_0_merge_GT }.

2.3.1 Transition Removal

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

f757_0_merge_GT: x5 + x6

2.3.2 Trivial Cooperation Program

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

2.4 SCC Subproblem 4/5

Here we consider the SCC { f774_0_merge_GT }.

2.4.1 Transition Removal

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

f774_0_merge_GT: x4 + x5

2.4.2 Trivial Cooperation Program

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

2.5 SCC Subproblem 5/5

Here we consider the SCC { f1440_0_merge_GT }.

2.5.1 Transition Removal

We remove transitions 23, 24 using the following ranking functions, which are bounded by 0.

f1440_0_merge_GT: x5 + x7

2.5.2 Trivial Cooperation Program

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

Tool configuration

AProVE