LTS Termination Proof

by AProVE

Input

Integer Transition System

Proof

1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
l5 l5 l5: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l22 l22 l22: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l13 l13 l13: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l18 l18 l18: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l17 l17 l17: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l21 l21 l21: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l14 l14 l14: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l9 l9 l9: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l25 l25 l25: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l6 l6 l6: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l8 l8 l8: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l27 l27 l27: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l0 l0 l0: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l12 l12 l12: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l19 l19 l19: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l26 l26 l26: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l7 l7 l7: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l24 l24 l24: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l11 l11 l11: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l3 l3 l3: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l20 l20 l20: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l2 l2 l2: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l23 l23 l23: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l4 l4 l4: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l10 l10 l10: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l15 l15 l15: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
l16 l16 l16: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11
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 { l8, l9 }.

2.1.1 Transition Removal

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

l8: 2⋅x4 − 2⋅x5 + 1
l9: 2⋅x4 − 2⋅x5

2.1.2 Transition Removal

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

l8: 0
l9: −1

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 { l5, l22, l7, l24, l11, l13, l20, l18, l17, l21, l14, l23, l25, l10, l6, l16, l15, l12, l19 }.

2.2.1 Transition Removal

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

l5: −2 + x4x5
l6: −2 + x4x5
l20: −2 + x4x5
l7: −2 + x4x5
l13: −2 + x4x5
l12: −2 + x4x5
l11: −2 + x4x5
l10: −2 + x4x5
l14: −2 + x4x5
l17: −2 + x4x5
l16: −2 + x4x5
l15: −2 + x4x5
l21: −2 + x4x5
l22: −2 + x4x5
l25: −2 + x4x5
l24: −2 + x4x5
l23: −2 + x4x5
l19: −1 + x4x5
l18: −1 + x4x5

2.2.2 Transition Removal

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

l5: −2 + x4x6
l6: −1 + x4x6
l20: −2 + x4x6
l7: −2 + x4x6
l13: −2 + x4x6
l12: −2 + x4x6
l11: −2 + x4x6
l10: −2 + x4x6
l14: −2 + x4x6
l17: −2 + x4x6
l16: −2 + x4x6
l15: −2 + x4x6
l21: −1 + x4x6
l22: −1 + x4
l25: −1 + x4
l24: −1 + x4
l23: −1 + x4
l18: −1 + x4x6
l19: −1 + x4x6

2.2.3 Transition Removal

We remove transitions 9, 28, 10, 17, 15, 13, 12, 14, 16, 19, 18, 20, 24, 23, 21, 22, 26, 25, 30, 29, 36, 33, 39, 37, 35, 34, 38, 41, 40, 27, 31 using the following ranking functions, which are bounded by 0.

l5: 3
l6: 2
l20: 13
l7: 4
l13: 8
l12: 7
l11: 6
l10: 5
l14: 9
l17: 12
l16: 11
l15: 10
l21: 1
l22: 3
l25: 6
l24: 5
l23: 4
l18: 0
l19: −1

2.2.4 Trivial Cooperation Program

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

Tool configuration

AProVE