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 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l7 l7 l7: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l11 l11 l11: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l1 l1 l1: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l13 l13 l13: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l2 l2 l2: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l9 l9 l9: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l14 l14 l14: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l4 l4 l4: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l6 l6 l6: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l10 l10 l10: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l8 l8 l8: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l0 l0 l0: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
l12 l12 l12: x1 = x1x2 = x2x3 = x3x4 = x4x5 = x5x6 = x6x7 = x7x8 = x8x9 = x9x10 = x10x11 = x11x12 = x12x13 = x13x14 = x14x15 = x15x16 = x16x17 = x17x18 = x18x19 = x19x20 = x20x21 = x21x22 = x22x23 = x23x24 = x24x25 = x25x26 = x26x27 = x27x28 = x28x29 = x29x30 = x30x31 = x31x32 = x32x33 = x33x34 = x34x35 = x35x36 = x36x37 = x37x38 = x38x39 = x39
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

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

2.1 SCC Subproblem 1/3

Here we consider the SCC { l8, l13 }.

2.1.1 Transition Removal

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

l8: −1 − x14 + x18
l13: −1 − x14 + x18

2.1.2 Transition Removal

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

l13: 0
l8: −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/3

Here we consider the SCC { l10, l9 }.

2.2.1 Transition Removal

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

l9: x2
l10: x2

2.2.2 Transition Removal

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

l10: 0
l9: −1

2.2.3 Trivial Cooperation Program

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

2.3 SCC Subproblem 3/3

Here we consider the SCC { l4, l2 }.

2.3.1 Transition Removal

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

l2: x5 + 2⋅x39
l4: x5 + 2⋅x39

2.3.2 Transition Removal

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

l4: 0
l2: −1

2.3.3 Trivial Cooperation Program

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

Tool configuration

AProVE