MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True (1,1) 1. evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True (?,1) 2. evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [B >= 1] (?,1) 3. evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [0 >= B] (?,1) 4. evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [A >= 1] (?,1) 5. evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [0 >= A] (?,1) 6. evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) True (?,1) 7. evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) True (?,1) 8. evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) True (?,1) Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True (1,1) 1. evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True (1,1) 2. evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [B >= 1] (?,1) 3. evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [0 >= B] (1,1) 4. evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [A >= 1] (?,1) 5. evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [0 >= A] (?,1) 6. evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) True (?,1) 7. evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) True (?,1) 8. evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) True (1,1) Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: 0. evalcousot9start(A,B,C) -> evalcousot9entryin(A,B,C) True (1,1) 1. evalcousot9entryin(A,B,C) -> evalcousot9bb3in(D,C,C) True (?,1) 2. evalcousot9bb3in(A,B,C) -> evalcousot9bbin(A,B,C) [B >= 1] (?,1) 3. evalcousot9bb3in(A,B,C) -> evalcousot9returnin(A,B,C) [0 >= B] (?,1) 4. evalcousot9bbin(A,B,C) -> evalcousot9bb1in(A,B,C) [A >= 1] (?,1) 5. evalcousot9bbin(A,B,C) -> evalcousot9bb2in(A,B,C) [0 >= A] (?,1) 6. evalcousot9bb1in(A,B,C) -> evalcousot9bb3in(-1 + A,B,C) True (?,1) 7. evalcousot9bb2in(A,B,C) -> evalcousot9bb3in(C,-1 + B,C) True (?,1) 8. evalcousot9returnin(A,B,C) -> evalcousot9stop(A,B,C) True (?,1) 9. evalcousot9returnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalcousot9bb1in,3) ;(evalcousot9bb2in,3) ;(evalcousot9bb3in,3) ;(evalcousot9bbin,3) ;(evalcousot9entryin,3) ;(evalcousot9returnin,3) ;(evalcousot9start,3) ;(evalcousot9stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8,9},4->{6},5->{7},6->{2,3},7->{2,3},8->{},9->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[2,6,4,7,5] c: [] MAYBE