MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. eval_catmouse_start(v_m,v_n,v_x_0) -> eval_catmouse_bb0_in(v_m,v_n,v_x_0) True (1,1) 1. eval_catmouse_bb0_in(v_m,v_n,v_x_0) -> eval_catmouse_0(v_m,v_n,v_x_0) True (?,1) 2. eval_catmouse_0(v_m,v_n,v_x_0) -> eval_catmouse_1(v_m,v_n,v_x_0) True (?,1) 3. eval_catmouse_1(v_m,v_n,v_x_0) -> eval_catmouse_2(v_m,v_n,v_x_0) True (?,1) 4. eval_catmouse_2(v_m,v_n,v_x_0) -> eval_catmouse_3(v_m,v_n,v_x_0) True (?,1) 5. eval_catmouse_3(v_m,v_n,v_x_0) -> eval_catmouse_4(v_m,v_n,v_x_0) True (?,1) 6. eval_catmouse_4(v_m,v_n,v_x_0) -> eval_catmouse_5(v_m,v_n,v_x_0) True (?,1) 7. eval_catmouse_5(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,0) True (?,1) 8. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb2_in(v_m,v_n,v_x_0) [v_n >= v_x_0] (?,1) 9. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb3_in(v_m,v_n,v_x_0) [-1 + v_x_0 >= v_n] (?,1) 10. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,1 + v_x_0) [v_n + -1*v_x_0 >= 0 && v_m >= v_x_0] (?,1) 11. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,-1 + v_x_0) [v_n + -1*v_x_0 >= 0 && -1 + v_x_0 >= v_m] (?,1) 12. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> eval_catmouse_stop(v_m,v_n,v_x_0) [-1 + -1*v_n + v_x_0 >= 0] (?,1) Signature: {(eval_catmouse_0,3) ;(eval_catmouse_1,3) ;(eval_catmouse_2,3) ;(eval_catmouse_3,3) ;(eval_catmouse_4,3) ;(eval_catmouse_5,3) ;(eval_catmouse_bb0_in,3) ;(eval_catmouse_bb1_in,3) ;(eval_catmouse_bb2_in,3) ;(eval_catmouse_bb3_in,3) ;(eval_catmouse_start,3) ;(eval_catmouse_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11},9->{12},10->{8,9},11->{8,9},12->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. eval_catmouse_start(v_m,v_n,v_x_0) -> eval_catmouse_bb0_in(v_m,v_n,v_x_0) True (1,1) 1. eval_catmouse_bb0_in(v_m,v_n,v_x_0) -> eval_catmouse_0(v_m,v_n,v_x_0) True (1,1) 2. eval_catmouse_0(v_m,v_n,v_x_0) -> eval_catmouse_1(v_m,v_n,v_x_0) True (1,1) 3. eval_catmouse_1(v_m,v_n,v_x_0) -> eval_catmouse_2(v_m,v_n,v_x_0) True (1,1) 4. eval_catmouse_2(v_m,v_n,v_x_0) -> eval_catmouse_3(v_m,v_n,v_x_0) True (1,1) 5. eval_catmouse_3(v_m,v_n,v_x_0) -> eval_catmouse_4(v_m,v_n,v_x_0) True (1,1) 6. eval_catmouse_4(v_m,v_n,v_x_0) -> eval_catmouse_5(v_m,v_n,v_x_0) True (1,1) 7. eval_catmouse_5(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,0) True (1,1) 8. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb2_in(v_m,v_n,v_x_0) [v_n >= v_x_0] (?,1) 9. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb3_in(v_m,v_n,v_x_0) [-1 + v_x_0 >= v_n] (1,1) 10. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,1 + v_x_0) [v_n + -1*v_x_0 >= 0 && v_m >= v_x_0] (?,1) 11. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,-1 + v_x_0) [v_n + -1*v_x_0 >= 0 && -1 + v_x_0 >= v_m] (?,1) 12. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> eval_catmouse_stop(v_m,v_n,v_x_0) [-1 + -1*v_n + v_x_0 >= 0] (1,1) Signature: {(eval_catmouse_0,3) ;(eval_catmouse_1,3) ;(eval_catmouse_2,3) ;(eval_catmouse_3,3) ;(eval_catmouse_4,3) ;(eval_catmouse_5,3) ;(eval_catmouse_bb0_in,3) ;(eval_catmouse_bb1_in,3) ;(eval_catmouse_bb2_in,3) ;(eval_catmouse_bb3_in,3) ;(eval_catmouse_start,3) ;(eval_catmouse_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11},9->{12},10->{8,9},11->{8,9},12->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(11,9)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. eval_catmouse_start(v_m,v_n,v_x_0) -> eval_catmouse_bb0_in(v_m,v_n,v_x_0) True (1,1) 1. eval_catmouse_bb0_in(v_m,v_n,v_x_0) -> eval_catmouse_0(v_m,v_n,v_x_0) True (1,1) 2. eval_catmouse_0(v_m,v_n,v_x_0) -> eval_catmouse_1(v_m,v_n,v_x_0) True (1,1) 3. eval_catmouse_1(v_m,v_n,v_x_0) -> eval_catmouse_2(v_m,v_n,v_x_0) True (1,1) 4. eval_catmouse_2(v_m,v_n,v_x_0) -> eval_catmouse_3(v_m,v_n,v_x_0) True (1,1) 5. eval_catmouse_3(v_m,v_n,v_x_0) -> eval_catmouse_4(v_m,v_n,v_x_0) True (1,1) 6. eval_catmouse_4(v_m,v_n,v_x_0) -> eval_catmouse_5(v_m,v_n,v_x_0) True (1,1) 7. eval_catmouse_5(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,0) True (1,1) 8. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb2_in(v_m,v_n,v_x_0) [v_n >= v_x_0] (?,1) 9. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb3_in(v_m,v_n,v_x_0) [-1 + v_x_0 >= v_n] (1,1) 10. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,1 + v_x_0) [v_n + -1*v_x_0 >= 0 && v_m >= v_x_0] (?,1) 11. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,-1 + v_x_0) [v_n + -1*v_x_0 >= 0 && -1 + v_x_0 >= v_m] (?,1) 12. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> eval_catmouse_stop(v_m,v_n,v_x_0) [-1 + -1*v_n + v_x_0 >= 0] (1,1) Signature: {(eval_catmouse_0,3) ;(eval_catmouse_1,3) ;(eval_catmouse_2,3) ;(eval_catmouse_3,3) ;(eval_catmouse_4,3) ;(eval_catmouse_5,3) ;(eval_catmouse_bb0_in,3) ;(eval_catmouse_bb1_in,3) ;(eval_catmouse_bb2_in,3) ;(eval_catmouse_bb3_in,3) ;(eval_catmouse_start,3) ;(eval_catmouse_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11},9->{12},10->{8,9},11->{8},12->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. eval_catmouse_start(v_m,v_n,v_x_0) -> eval_catmouse_bb0_in(v_m,v_n,v_x_0) True (1,1) 1. eval_catmouse_bb0_in(v_m,v_n,v_x_0) -> eval_catmouse_0(v_m,v_n,v_x_0) True (?,1) 2. eval_catmouse_0(v_m,v_n,v_x_0) -> eval_catmouse_1(v_m,v_n,v_x_0) True (?,1) 3. eval_catmouse_1(v_m,v_n,v_x_0) -> eval_catmouse_2(v_m,v_n,v_x_0) True (?,1) 4. eval_catmouse_2(v_m,v_n,v_x_0) -> eval_catmouse_3(v_m,v_n,v_x_0) True (?,1) 5. eval_catmouse_3(v_m,v_n,v_x_0) -> eval_catmouse_4(v_m,v_n,v_x_0) True (?,1) 6. eval_catmouse_4(v_m,v_n,v_x_0) -> eval_catmouse_5(v_m,v_n,v_x_0) True (?,1) 7. eval_catmouse_5(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,0) True (?,1) 8. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb2_in(v_m,v_n,v_x_0) [v_n >= v_x_0] (?,1) 9. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb3_in(v_m,v_n,v_x_0) [-1 + v_x_0 >= v_n] (?,1) 10. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,1 + v_x_0) [v_n + -1*v_x_0 >= 0 && v_m >= v_x_0] (?,1) 11. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,-1 + v_x_0) [v_n + -1*v_x_0 >= 0 && -1 + v_x_0 >= v_m] (?,1) 12. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> eval_catmouse_stop(v_m,v_n,v_x_0) [-1 + -1*v_n + v_x_0 >= 0] (?,1) 13. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> exitus616(v_m,v_n,v_x_0) True (?,1) Signature: {(eval_catmouse_0,3) ;(eval_catmouse_1,3) ;(eval_catmouse_2,3) ;(eval_catmouse_3,3) ;(eval_catmouse_4,3) ;(eval_catmouse_5,3) ;(eval_catmouse_bb0_in,3) ;(eval_catmouse_bb1_in,3) ;(eval_catmouse_bb2_in,3) ;(eval_catmouse_bb3_in,3) ;(eval_catmouse_start,3) ;(eval_catmouse_stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11},9->{12,13},10->{8,9},11->{8,9} ,12->{},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(11,9)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. eval_catmouse_start(v_m,v_n,v_x_0) -> eval_catmouse_bb0_in(v_m,v_n,v_x_0) True (1,1) 1. eval_catmouse_bb0_in(v_m,v_n,v_x_0) -> eval_catmouse_0(v_m,v_n,v_x_0) True (?,1) 2. eval_catmouse_0(v_m,v_n,v_x_0) -> eval_catmouse_1(v_m,v_n,v_x_0) True (?,1) 3. eval_catmouse_1(v_m,v_n,v_x_0) -> eval_catmouse_2(v_m,v_n,v_x_0) True (?,1) 4. eval_catmouse_2(v_m,v_n,v_x_0) -> eval_catmouse_3(v_m,v_n,v_x_0) True (?,1) 5. eval_catmouse_3(v_m,v_n,v_x_0) -> eval_catmouse_4(v_m,v_n,v_x_0) True (?,1) 6. eval_catmouse_4(v_m,v_n,v_x_0) -> eval_catmouse_5(v_m,v_n,v_x_0) True (?,1) 7. eval_catmouse_5(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,0) True (?,1) 8. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb2_in(v_m,v_n,v_x_0) [v_n >= v_x_0] (?,1) 9. eval_catmouse_bb1_in(v_m,v_n,v_x_0) -> eval_catmouse_bb3_in(v_m,v_n,v_x_0) [-1 + v_x_0 >= v_n] (?,1) 10. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,1 + v_x_0) [v_n + -1*v_x_0 >= 0 && v_m >= v_x_0] (?,1) 11. eval_catmouse_bb2_in(v_m,v_n,v_x_0) -> eval_catmouse_bb1_in(v_m,v_n,-1 + v_x_0) [v_n + -1*v_x_0 >= 0 && -1 + v_x_0 >= v_m] (?,1) 12. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> eval_catmouse_stop(v_m,v_n,v_x_0) [-1 + -1*v_n + v_x_0 >= 0] (?,1) 13. eval_catmouse_bb3_in(v_m,v_n,v_x_0) -> exitus616(v_m,v_n,v_x_0) True (?,1) Signature: {(eval_catmouse_0,3) ;(eval_catmouse_1,3) ;(eval_catmouse_2,3) ;(eval_catmouse_3,3) ;(eval_catmouse_4,3) ;(eval_catmouse_5,3) ;(eval_catmouse_bb0_in,3) ;(eval_catmouse_bb1_in,3) ;(eval_catmouse_bb2_in,3) ;(eval_catmouse_bb3_in,3) ;(eval_catmouse_start,3) ;(eval_catmouse_stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7},7->{8,9},8->{10,11},9->{12,13},10->{8,9},11->{8},12->{} ,13->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13] | `- p:[8,10,11] c: [] MAYBE