LTS Termination Proof

by T2Cert

Input

• Initial Location: 5
• Transitions: (pre-variables and post-variables)

  0	0	1:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − arg2 ≤ 0 ∧ − arg4P ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ −5 − arg1 + arg2P ≤ 0 ∧ −3 − arg1 + arg3P ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 1 − arg1P ≤ 0 ∧ 6 − arg2P ≤ 0 ∧ 4 − arg3P ≤ 0 ∧ − arg5P ≤ 0 ∧ arg5P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  1	1	2:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ −1 + arg4 ≤ 0 ∧ 1 − arg5 ≤ 0 ∧ 1 + arg5 − x13 ≤ 0 ∧ 1 + arg5 − x14 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 5 − arg2 ≤ 0 ∧ 3 − arg3 ≤ 0 ∧ 5 − arg1P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0
  1	2	2:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ −6 + arg1P − arg1 ≤ 0 ∧ −1 + arg4 ≤ 0 ∧ −1 + arg1P − arg2 ≤ 0 ∧ −3 + arg1P − arg3 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 6 − arg2 ≤ 0 ∧ 4 − arg3 ≤ 0 ∧ 7 − arg1P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  1	3	1:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − arg5P + arg5 ≤ 0 ∧ 1 − arg5 ≤ 0 ∧ 2 − arg4 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ 4 + arg1P − arg2 ≤ 0 ∧ 2 + arg1P − arg3 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 5 − arg2 ≤ 0 ∧ 3 − arg3 ≤ 0 ∧ 1 − arg1P ≤ 0 ∧ 5 − arg2P ≤ 0 ∧ 3 − arg3P ≤ 0 ∧ −1 − arg4P + arg4 ≤ 0 ∧ 1 + arg4P − arg4 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  1	4	1:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ 2 − arg4 ≤ 0 ∧ 5 + arg1P − arg2 ≤ 0 ∧ 3 + arg1P − arg3 ≤ 0 ∧ −7 − arg1 + arg2P ≤ 0 ∧ −2 + arg2P − arg2 ≤ 0 ∧ −4 + arg2P − arg3 ≤ 0 ∧ −5 − arg1 + arg3P ≤ 0 ∧ − arg2 + arg3P ≤ 0 ∧ −2 + arg3P − arg3 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 6 − arg2 ≤ 0 ∧ 4 − arg3 ≤ 0 ∧ 1 − arg1P ≤ 0 ∧ 8 − arg2P ≤ 0 ∧ 6 − arg3P ≤ 0 ∧ −1 − arg4P + arg4 ≤ 0 ∧ 1 + arg4P − arg4 ≤ 0 ∧ 1 − arg5P ≤ 0 ∧ −1 + arg5P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  2	5	3:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ − arg2P ≤ 0 ∧ 1 + arg1P − arg1 ≤ 0 ∧ 5 − arg1 ≤ 0 ∧ 4 − arg1P ≤ 0 ∧ − arg3P ≤ 0 ∧ arg3P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  3	6	3:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 − arg3P + arg3 ≤ 0 ∧ 1 − arg3 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ 3 − arg1 ≤ 0 ∧ 3 − arg1P ≤ 0 ∧ −1 − arg2P + arg2 ≤ 0 ∧ 1 + arg2P − arg2 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  3	7	3:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ −2 + arg1P − arg1 ≤ 0 ∧ 2 − arg2 ≤ 0 ∧ 4 − arg1 ≤ 0 ∧ 6 − arg1P ≤ 0 ∧ −1 − arg2P + arg2 ≤ 0 ∧ 1 + arg2P − arg2 ≤ 0 ∧ 1 − arg3P ≤ 0 ∧ −1 + arg3P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  3	8	4:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 2 + arg1P − arg1 ≤ 0 ∧ −1 + arg2 ≤ 0 ∧ 3 − arg1 ≤ 0 ∧ 1 − arg1P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  4	9	4:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 1 + arg1P − arg1 ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ − arg1P ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0
  5	10	0:		0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ 0 ≤ 0 ∧ − arg1P + arg1 ≤ 0 ∧ arg1P − arg1 ≤ 0 ∧ − arg2P + arg2 ≤ 0 ∧ arg2P − arg2 ≤ 0 ∧ − arg3P + arg3 ≤ 0 ∧ arg3P − arg3 ≤ 0 ∧ − arg4P + arg4 ≤ 0 ∧ arg4P − arg4 ≤ 0 ∧ − arg5P + arg5 ≤ 0 ∧ arg5P − arg5 ≤ 0 ∧ − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0

Proof

1 Invariant Updates

The following invariants are asserted.

The invariants are proved as follows.

IMPACT Invariant Proof

• nodes (location) invariant:

  0		(0)		TRUE
  1		(1)		1 − arg1P ≤ 0 ∧ 1 − arg2P ≤ 0 ∧ 1 − arg3P ≤ 0 ∧ 1 − arg1 ≤ 0 ∧ 1 − arg2 ≤ 0 ∧ 1 − arg3 ≤ 0
  2		(2)		5 − arg1P ≤ 0 ∧ 5 − arg1 ≤ 0
  3		(3)		1 − arg1P ≤ 0 ∧ 1 − arg1 ≤ 0
  4		(4)		TRUE
  5		(5)		TRUE

• initial node: 5
• cover edges:
• transition edges:

  0	0 1
  1	1 2
  1	2 2
  1	3 1
  1	4 1
  2	5 3
  3	6 3
  3	7 3
  3	8 4
  4	9 4
  5	10 0

2 Switch to Cooperation Termination Proof

3 Transition Removal

We remove transitions 0, 1, 2, 5, 8, 10 using the following ranking functions, which are bounded by −21.

4 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

1* 14 1: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

5 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

1 12 1_var_snapshot: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

6 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

3* 21 3: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

7 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

3 19 3_var_snapshot: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

8 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4* 28 4: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

9 Location Addition

The following skip-transition is inserted and corresponding redirections w.r.t. the old location are performed.

4 26 4_var_snapshot: − x14 + x14 ≤ 0 ∧ x14 − x14 ≤ 0 ∧ − x13 + x13 ≤ 0 ∧ x13 − x13 ≤ 0 ∧ − arg5P + arg5P ≤ 0 ∧ arg5P − arg5P ≤ 0 ∧ − arg5 + arg5 ≤ 0 ∧ arg5 − arg5 ≤ 0 ∧ − arg4P + arg4P ≤ 0 ∧ arg4P − arg4P ≤ 0 ∧ − arg4 + arg4 ≤ 0 ∧ arg4 − arg4 ≤ 0 ∧ − arg3P + arg3P ≤ 0 ∧ arg3P − arg3P ≤ 0 ∧ − arg3 + arg3 ≤ 0 ∧ arg3 − arg3 ≤ 0 ∧ − arg2P + arg2P ≤ 0 ∧ arg2P − arg2P ≤ 0 ∧ − arg2 + arg2 ≤ 0 ∧ arg2 − arg2 ≤ 0 ∧ − arg1P + arg1P ≤ 0 ∧ arg1P − arg1P ≤ 0 ∧ − arg1 + arg1 ≤ 0 ∧ arg1 − arg1 ≤ 0

10 SCC Decomposition

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

10.1 SCC Subproblem 1/3

Here we consider the SCC { 4, 4_var_snapshot, 4* }.

10.1.1 Transition Removal

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

10.1.2 Transition Removal

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

10.1.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

10.1.3.1 Cut-Point Subproblem 1/1

10.1.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

10.2 SCC Subproblem 2/3

Here we consider the SCC { 3, 3_var_snapshot, 3* }.

10.2.1 Transition Removal

We remove transitions 6, 7 using the following ranking functions, which are bounded by 5.

10.2.2 Transition Removal

We remove transitions 19, 21 using the following ranking functions, which are bounded by −2.

10.2.3 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

10.2.3.1 Cut-Point Subproblem 1/1

10.2.3.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

10.3 SCC Subproblem 3/3

Here we consider the SCC { 1, 1_var_snapshot, 1* }.

10.3.1 Transition Removal

We remove transitions 3, 4 using the following ranking functions, which are bounded by 7.

10.3.2 Transition Removal

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

10.3.3 Transition Removal

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

10.3.4 Splitting Cut-Point Transitions

We consider 1 subproblems corresponding to sets of cut-point transitions as follows.

10.3.4.1 Cut-Point Subproblem 1/1

10.3.4.1.1 Splitting Cut-Point Transitions

There remain no cut-point transition to consider. Hence the cooperation termination is trivial.

Tool configuration

T2Cert

• version: 1.0