LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f566_0_sin_InvokeMethod f566_0_sin_InvokeMethod f566_0_sin_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4
f342_0_exp_GT f342_0_exp_GT f342_0_exp_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f638_0_exp_InvokeMethod f638_0_exp_InvokeMethod f638_0_exp_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4
f452_0_main_GE f452_0_main_GE f452_0_main_GE: x1 = x1x2 = x2x3 = x3x4 = x4
f276_0_sin_GT f276_0_sin_GT f276_0_sin_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f453_0_fact_GT f453_0_fact_GT f453_0_fact_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush: x1 = x1x2 = x2x3 = x3x4 = x4
f697_0_main_GE f697_0_main_GE f697_0_main_GE: x1 = x1x2 = x2x3 = x3x4 = x4
f342_0_exp_GT' f342_0_exp_GT' f342_0_exp_GT': x1 = x1x2 = x2x3 = x3x4 = x4
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4
f566_0_sin_InvokeMethod' f566_0_sin_InvokeMethod' f566_0_sin_InvokeMethod': x1 = x1x2 = x2x3 = x3x4 = x4
f552_0_cos_InvokeMethod f552_0_cos_InvokeMethod f552_0_cos_InvokeMethod: x1 = x1x2 = x2x3 = x3x4 = x4
f452_0_main_GE' f452_0_main_GE' f452_0_main_GE': x1 = x1x2 = x2x3 = x3x4 = x4
f552_0_cos_InvokeMethod' f552_0_cos_InvokeMethod' f552_0_cos_InvokeMethod': x1 = x1x2 = x2x3 = x3x4 = x4
f345_0_power_GT f345_0_power_GT f345_0_power_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f307_0_cos_GT f307_0_cos_GT f307_0_cos_GT: x1 = x1x2 = x2x3 = x3x4 = x4
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

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

2.1 SCC Subproblem 1/6

Here we consider the SCC { f452_0_main_GE, f452_0_main_GE', f697_0_main_GE }.

2.1.1 Transition Removal

We remove transitions 2, 11, 9, 4, 14, 6, 16, 8, 18, 17, 15, 13 using the following ranking functions, which are bounded by 0.

f452_0_main_GE: 1 − 2⋅x2 + 2⋅x3
f452_0_main_GE': −2⋅x2 + 2⋅x3
f697_0_main_GE: −1 − 2⋅x2 + 2⋅x4

2.1.2 Transition Removal

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

f697_0_main_GE: x4
f452_0_main_GE: −1 + x3

2.1.3 Transition Removal

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

f697_0_main_GE: 99 − x3

2.1.4 Trivial Cooperation Program

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

2.2 SCC Subproblem 2/6

Here we consider the SCC { f342_0_exp_GT, f638_0_exp_InvokeMethod, f342_0_exp_GT' }.

2.2.1 Transition Removal

We remove transitions 36, 32, 39, 37, 38 using the following ranking functions, which are bounded by 0.

f342_0_exp_GT: 2 + 3⋅x2
f342_0_exp_GT': 1 + 3⋅x2
f638_0_exp_InvokeMethod: 3⋅x1

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

Here we consider the SCC { f552_0_cos_InvokeMethod, f552_0_cos_InvokeMethod', f307_0_cos_GT }.

2.3.1 Transition Removal

We remove transitions 26, 30, 29 using the following ranking functions, which are bounded by 0.

f307_0_cos_GT: 3⋅x2 + 2
f552_0_cos_InvokeMethod: 3⋅x1 + 1
f552_0_cos_InvokeMethod': 3⋅x1

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

Here we consider the SCC { f566_0_sin_InvokeMethod, f276_0_sin_GT, f566_0_sin_InvokeMethod' }.

2.4.1 Transition Removal

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

f276_0_sin_GT: 3⋅x2 + 2
f566_0_sin_InvokeMethod: 3⋅x1 + 1
f566_0_sin_InvokeMethod': 3⋅x1

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

Here we consider the SCC { f453_0_fact_GT }.

2.5.1 Transition Removal

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

f453_0_fact_GT: x1

2.5.2 Trivial Cooperation Program

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

2.6 SCC Subproblem 6/6

Here we consider the SCC { f345_0_power_GT }.

2.6.1 Transition Removal

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

f345_0_power_GT: x1

2.6.2 Trivial Cooperation Program

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

Tool configuration

AProVE