MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. evalEx7start(A,B,C) -> evalEx7entryin(A,B,C) True (1,1) 1. evalEx7entryin(A,B,C) -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (?,1) 2. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && A >= 1 + C] (?,1) 3. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] (?,1) 4. evalEx7bb3in(A,B,C) -> evalEx7returnin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C = A] (?,1) 5. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,0) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1) 6. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,1 + C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && B >= C] (?,1) 7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C) [-1 + B + -1*C >= 0 (?,1) && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -1*A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] Signature: {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6},3->{5,6},4->{7},5->{2,3,4},6->{2,3,4},7->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalEx7start(A,B,C) -> evalEx7entryin(A,B,C) True (1,1) 1. evalEx7entryin(A,B,C) -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (1,1) 2. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && A >= 1 + C] (?,1) 3. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] (?,1) 4. evalEx7bb3in(A,B,C) -> evalEx7returnin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C = A] (1,1) 5. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,0) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1) 6. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,1 + C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && B >= C] (?,1) 7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C) [-1 + B + -1*C >= 0 (1,1) && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -1*A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] Signature: {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6},3->{5,6},4->{7},5->{2,3,4},6->{2,3,4},7->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(1,4),(2,5),(5,3),(5,4)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. evalEx7start(A,B,C) -> evalEx7entryin(A,B,C) True (1,1) 1. evalEx7entryin(A,B,C) -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (1,1) 2. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && A >= 1 + C] (?,1) 3. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] (?,1) 4. evalEx7bb3in(A,B,C) -> evalEx7returnin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C = A] (1,1) 5. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,0) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1) 6. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,1 + C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && B >= C] (?,1) 7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C) [-1 + B + -1*C >= 0 (1,1) && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -1*A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] Signature: {(evalEx7bb3in,3);(evalEx7bbin,3);(evalEx7entryin,3);(evalEx7returnin,3);(evalEx7start,3);(evalEx7stop,3)} Flow Graph: [0->{1},1->{3},2->{6},3->{5,6},4->{7},5->{2},6->{2,3,4},7->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. evalEx7start(A,B,C) -> evalEx7entryin(A,B,C) True (1,1) 1. evalEx7entryin(A,B,C) -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (?,1) 2. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && A >= 1 + C] (?,1) 3. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] (?,1) 4. evalEx7bb3in(A,B,C) -> evalEx7returnin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C = A] (?,1) 5. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,0) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1) 6. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,1 + C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && B >= C] (?,1) 7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C) [-1 + B + -1*C >= 0 (?,1) && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -1*A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 8. evalEx7returnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalEx7bb3in,3) ;(evalEx7bbin,3) ;(evalEx7entryin,3) ;(evalEx7returnin,3) ;(evalEx7start,3) ;(evalEx7stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6},3->{5,6},4->{7,8},5->{2,3,4},6->{2,3,4},7->{},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,2),(1,4),(2,5),(5,3),(5,4)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. evalEx7start(A,B,C) -> evalEx7entryin(A,B,C) True (1,1) 1. evalEx7entryin(A,B,C) -> evalEx7bb3in(A,B,1 + A) [A >= 1 && B >= 1 + A] (?,1) 2. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && A >= 1 + C] (?,1) 3. evalEx7bb3in(A,B,C) -> evalEx7bbin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + A] (?,1) 4. evalEx7bb3in(A,B,C) -> evalEx7returnin(A,B,C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C = A] (?,1) 5. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,0) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && C >= 1 + B] (?,1) 6. evalEx7bbin(A,B,C) -> evalEx7bb3in(A,B,1 + C) [-2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0 && B >= C] (?,1) 7. evalEx7returnin(A,B,C) -> evalEx7stop(A,B,C) [-1 + B + -1*C >= 0 (?,1) && A + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -2 + A + C >= 0 && -1*A + C >= 0 && -2 + B >= 0 && -3 + A + B >= 0 && -1 + -1*A + B >= 0 && -1 + A >= 0] 8. evalEx7returnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalEx7bb3in,3) ;(evalEx7bbin,3) ;(evalEx7entryin,3) ;(evalEx7returnin,3) ;(evalEx7start,3) ;(evalEx7stop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{3},2->{6},3->{5,6},4->{7,8},5->{2},6->{2,3,4},7->{},8->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8] | `- p:[3,6,2,5] c: [] MAYBE