MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) Signature: {(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2,3,4,5},4->{1,2,3,4,5},5->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (1,1) Signature: {(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2,3,4,5},4->{1,2,3,4,5},5->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,5),(3,3),(3,4),(3,5),(4,3),(4,4),(4,5)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (1,1) Signature: {(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{1,2},4->{1,2},5->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) 6. f1(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,5,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{1,2,3,4,5,6},4->{1,2,3,4,5,6},5->{},6->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,5),(3,3),(3,4),(3,5),(4,3),(4,4),(4,5)] * Step 5: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) 6. f1(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{1,2,6},4->{1,2,6},5->{},6->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[1,2,3,4] c: [4] | `- p:[1,2,3] c: [3] | `- p:[1,2] c: [2] | `- p:[1] c: [1] * Step 6: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f0(A,B,C,D,E) -> f1(F,1,0,D,E) True (1,1) 1. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,C,D,E) [C >= 0 && B >= 1 && A >= 101] (?,1) 2. f1(A,B,C,D,E) -> f1(11 + A,1 + B,C,D,E) [C >= 0 && B >= 1 && 100 >= A] (?,1) 3. f1(A,B,C,D,E) -> f1(-10 + A,-1 + B,1,A,B) [C >= 0 && A >= 101 && 0 >= C && B >= 1] (?,1) 4. f1(A,B,C,D,E) -> f1(11 + A,1 + B,1,A,B) [C >= 0 && 100 >= A && 0 >= C && B >= 1] (?,1) 5. f1(A,B,C,D,E) -> f2(A,B,C,D,E) [C >= 0 && D >= A && C >= 1 && B >= E] (?,1) 6. f1(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(exitus616,5);(f0,5);(f1,5);(f2,5)} Flow Graph: [0->{1,2,3,4,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{1,2,6},4->{1,2,6},5->{},6->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6] | `- p:[1,2,3,4] c: [4] | `- p:[1,2,3] c: [3] | `- p:[1,2] c: [2] | `- p:[1] c: [1]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] f0 ~> f1 [A <= unknown, B <= K, C <= 0*K, D <= D, E <= E] f1 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= A, B <= B, C <= K, D <= A, E <= B] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] f1 ~> f2 [A <= A, B <= B, C <= C, D <= D, E <= E] f1 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= 91*K + A + 10*B] f1 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= A, B <= B, C <= K, D <= A, E <= B] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= K, D <= A, E <= B] + Loop: [0.0.0 <= K + C] f1 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= A, B <= B, C <= K, D <= A, E <= B] + Loop: [0.0.0.0 <= 91*K + A + 10*B] f1 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E] f1 ~> f1 [A <= 11*K + A, B <= K + B, C <= C, D <= D, E <= E] + Loop: [0.0.0.0.0 <= B] f1 ~> f1 [A <= A, B <= B, C <= C, D <= D, E <= E] + Applied Processor: FlowAbstraction + Details: () * Step 8: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] f0 ~> f1 [K ~=> B,K ~=> C,huge ~=> A] f1 ~> f1 [] f1 ~> f1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1 ~> f1 [A ~=> D,B ~=> E,K ~=> C] f1 ~> f1 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1 ~> f2 [] f1 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~*> 0.0,K ~*> 0.0] f1 ~> f1 [] f1 ~> f1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1 ~> f1 [A ~=> D,B ~=> E,K ~=> C] f1 ~> f1 [A ~=> D,B ~=> E,K ~=> C,A ~+> A,B ~+> B,K ~+> B,K ~*> A] + Loop: [C ~+> 0.0.0,K ~+> 0.0.0] f1 ~> f1 [] f1 ~> f1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] f1 ~> f1 [A ~=> D,B ~=> E,K ~=> C] + Loop: [A ~+> 0.0.0.0,B ~*> 0.0.0.0,K ~*> 0.0.0.0] f1 ~> f1 [] f1 ~> f1 [A ~+> A,B ~+> B,K ~+> B,K ~*> A] + Loop: [B ~=> 0.0.0.0.0] f1 ~> f1 [] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE