LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
f319_0_main_GE f319_0_main_GE f319_0_main_GE: x1 = x1x2 = x2x3 = x3x4 = x4
f862_0_cos_GT f862_0_cos_GT f862_0_cos_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f861_0_sin_GT f861_0_sin_GT f861_0_sin_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f165_0_main_GE f165_0_main_GE f165_0_main_GE: x1 = x1x2 = x2x3 = x3x4 = x4
f862_0_cos_GT' f862_0_cos_GT' f862_0_cos_GT': x1 = x1x2 = x2x3 = x3x4 = x4
f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush f1_0_main_ConstantStackPush: x1 = x1x2 = x2x3 = x3x4 = x4
f1049_0_fact_Return' f1049_0_fact_Return' f1049_0_fact_Return': x1 = x1x2 = x2x3 = x3x4 = x4
f165_0_main_GE' f165_0_main_GE' f165_0_main_GE': x1 = x1x2 = x2x3 = x3x4 = x4
f544_0_exp_GT' f544_0_exp_GT' f544_0_exp_GT': x1 = x1x2 = x2x3 = x3x4 = x4
__init __init __init: x1 = x1x2 = x2x3 = x3x4 = x4
f1011_0_power_GT f1011_0_power_GT f1011_0_power_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f1048_0_fact_Return f1048_0_fact_Return f1048_0_fact_Return: x1 = x1x2 = x2x3 = x3x4 = x4
f765_0_fact_Return f765_0_fact_Return f765_0_fact_Return: x1 = x1x2 = x2x3 = x3x4 = x4
f544_0_exp_GT f544_0_exp_GT f544_0_exp_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f861_0_sin_GT' f861_0_sin_GT' f861_0_sin_GT': x1 = x1x2 = x2x3 = x3x4 = x4
f1113_0_fact_GT f1113_0_fact_GT f1113_0_fact_GT: x1 = x1x2 = x2x3 = x3x4 = x4
f1049_0_fact_Return f1049_0_fact_Return f1049_0_fact_Return: 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 { f319_0_main_GE, f165_0_main_GE, f165_0_main_GE' }.

2.1.1 Transition Removal

We remove transitions 2, 3, 6, 7, 8, 9, 10, 11, 23, 17, 12 using the following ranking functions, which are bounded by 0.

f165_0_main_GE: 1 − 2⋅x2 + 2⋅x3
f165_0_main_GE': −2⋅x2 + 2⋅x3
f319_0_main_GE: −1 − 2⋅x2 + 2⋅x4

2.1.2 Transition Removal

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

f319_0_main_GE: x4
f165_0_main_GE: −1 + x3

2.1.3 Transition Removal

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

f319_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 { f544_0_exp_GT, f544_0_exp_GT' }.

2.2.1 Transition Removal

We remove transitions 26, 27 using the following ranking functions, which are bounded by −1.

f544_0_exp_GT: 2⋅x3 − 2⋅x2
f544_0_exp_GT': −2⋅x2 + 2⋅x3 − 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/6

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

2.3.1 Transition Removal

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

f862_0_cos_GT: 1 − x1 + x2
f862_0_cos_GT': x1 + x2

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 { f861_0_sin_GT', f861_0_sin_GT }.

2.4.1 Transition Removal

We remove transitions 15, 16, 28 using the following ranking functions, which are bounded by 0.

f861_0_sin_GT: x1 + x2 + 1
f861_0_sin_GT': x1 + x2

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 { f1113_0_fact_GT }.

2.5.1 Transition Removal

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

f1113_0_fact_GT: x3 + x4

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 { f1011_0_power_GT }.

2.6.1 Transition Removal

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

f1011_0_power_GT: x1 + x2

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