MAYBE Initial complexity problem: 1: T: (1, 1) f0(a) -> f1(a) (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a) with all transitions in problem 1, the following new transition is obtained: f0(a) -> f1(a + 1) [ a >= 200 ] We thus obtain the following problem: 2: T: (1, 2) f0(a) -> f1(a + 1) [ a >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 1) [ a >= 200 ] with all transitions in problem 2, the following new transition is obtained: f0(a) -> f1(a + 2) [ a >= 200 /\ a + 1 >= 200 ] We thus obtain the following problem: 3: T: (1, 3) f0(a) -> f1(a + 2) [ a >= 200 /\ a + 1 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 2) [ a >= 200 /\ a + 1 >= 200 ] with all transitions in problem 3, the following new transition is obtained: f0(a) -> f1(a + 3) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 ] We thus obtain the following problem: 4: T: (1, 4) f0(a) -> f1(a + 3) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 3) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 ] with all transitions in problem 4, the following new transition is obtained: f0(a) -> f1(a + 4) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 ] We thus obtain the following problem: 5: T: (1, 5) f0(a) -> f1(a + 4) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 4) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 ] with all transitions in problem 5, the following new transition is obtained: f0(a) -> f1(a + 5) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 ] We thus obtain the following problem: 6: T: (1, 6) f0(a) -> f1(a + 5) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 5) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 ] with all transitions in problem 6, the following new transition is obtained: f0(a) -> f1(a + 6) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 ] We thus obtain the following problem: 7: T: (1, 7) f0(a) -> f1(a + 6) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 6) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 ] with all transitions in problem 7, the following new transition is obtained: f0(a) -> f1(a + 7) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 ] We thus obtain the following problem: 8: T: (1, 8) f0(a) -> f1(a + 7) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 7) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 ] with all transitions in problem 8, the following new transition is obtained: f0(a) -> f1(a + 8) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 ] We thus obtain the following problem: 9: T: (1, 9) f0(a) -> f1(a + 8) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 8) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 ] with all transitions in problem 9, the following new transition is obtained: f0(a) -> f1(a + 9) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 ] We thus obtain the following problem: 10: T: (1, 10) f0(a) -> f1(a + 9) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 9) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 ] with all transitions in problem 10, the following new transition is obtained: f0(a) -> f1(a + 10) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 ] We thus obtain the following problem: 11: T: (1, 11) f0(a) -> f1(a + 10) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 10) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 ] with all transitions in problem 11, the following new transition is obtained: f0(a) -> f1(a + 11) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 ] We thus obtain the following problem: 12: T: (1, 12) f0(a) -> f1(a + 11) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 11) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 ] with all transitions in problem 12, the following new transition is obtained: f0(a) -> f1(a + 12) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 ] We thus obtain the following problem: 13: T: (1, 13) f0(a) -> f1(a + 12) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 12) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 ] with all transitions in problem 13, the following new transition is obtained: f0(a) -> f1(a + 13) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 ] We thus obtain the following problem: 14: T: (1, 14) f0(a) -> f1(a + 13) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 13) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 ] with all transitions in problem 14, the following new transition is obtained: f0(a) -> f1(a + 14) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 /\ a + 13 >= 200 ] We thus obtain the following problem: 15: T: (1, 15) f0(a) -> f1(a + 14) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 /\ a + 13 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 By chaining the transition f0(a) -> f1(a + 14) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 /\ a + 13 >= 200 ] with all transitions in problem 15, the following new transition is obtained: f0(a) -> f1(a + 15) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 /\ a + 13 >= 200 /\ a + 14 >= 200 ] We thus obtain the following problem: 16: T: (1, 16) f0(a) -> f1(a + 15) [ a >= 200 /\ a + 1 >= 200 /\ a + 2 >= 200 /\ a + 3 >= 200 /\ a + 4 >= 200 /\ a + 5 >= 200 /\ a + 6 >= 200 /\ a + 7 >= 200 /\ a + 8 >= 200 /\ a + 9 >= 200 /\ a + 10 >= 200 /\ a + 11 >= 200 /\ a + 12 >= 200 /\ a + 13 >= 200 /\ a + 14 >= 200 ] (?, 1) f1(a) -> f1(a + 1) [ a >= 200 ] start location: f0 leaf cost: 0 Complexity upper bound ? Time: 0.771 sec (SMT: 0.721 sec)