MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f1(A,B,C) -> f3(A,D,C) [A >= 500] (?,1) 1. f1(A,B,C) -> f1(1 + A,B,C) [499 >= A] (?,1) 2. f2(A,B,C) -> f3(E,D,E) [E >= 500] (1,1) 3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D] (1,1) Signature: {(f1,3);(f2,3);(f3,3)} Flow Graph: [0->{},1->{0,1},2->{},3->{0,1}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. f1(A,B,C) -> f3(A,D,C) [A >= 500] (1,1) 1. f1(A,B,C) -> f1(1 + A,B,C) [499 >= A] (?,1) 2. f2(A,B,C) -> f3(E,D,E) [E >= 500] (1,1) 3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D] (1,1) Signature: {(f1,3);(f2,3);(f3,3)} Flow Graph: [0->{},1->{0,1},2->{},3->{0,1}] + Applied Processor: AddSinks + Details: () * Step 3: LooptreeTransformer MAYBE + Considered Problem: Rules: 0. f1(A,B,C) -> f3(A,D,C) [A >= 500] (?,1) 1. f1(A,B,C) -> f1(1 + A,B,C) [499 >= A] (?,1) 2. f2(A,B,C) -> f3(E,D,E) [E >= 500] (1,1) 3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D] (1,1) 4. f1(A,B,C) -> exitus616(A,B,C) True (?,1) 5. f2(A,B,C) -> exitus616(A,B,C) True (1,1) Signature: {(exitus616,3);(f1,3);(f2,3);(f3,3)} Flow Graph: [0->{},1->{0,1,4},2->{},3->{0,1,4},4->{},5->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5] | `- p:[1] c: [1] * Step 4: SizeAbstraction MAYBE + Considered Problem: (Rules: 0. f1(A,B,C) -> f3(A,D,C) [A >= 500] (?,1) 1. f1(A,B,C) -> f1(1 + A,B,C) [499 >= A] (?,1) 2. f2(A,B,C) -> f3(E,D,E) [E >= 500] (1,1) 3. f2(A,B,C) -> f1(1 + D,B,D) [499 >= D] (1,1) 4. f1(A,B,C) -> exitus616(A,B,C) True (?,1) 5. f2(A,B,C) -> exitus616(A,B,C) True (1,1) Signature: {(exitus616,3);(f1,3);(f2,3);(f3,3)} Flow Graph: [0->{},1->{0,1,4},2->{},3->{0,1,4},4->{},5->{}] ,We construct a looptree: P: [0,1,2,3,4,5] | `- p:[1] c: [1]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 5: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,0.0] f1 ~> f3 [A <= A, B <= unknown, C <= C] f1 ~> f1 [A <= K + A, B <= B, C <= C] f2 ~> f3 [A <= unknown, B <= unknown, C <= unknown] f2 ~> f1 [A <= unknown, B <= B, C <= unknown] f1 ~> exitus616 [A <= A, B <= B, C <= C] f2 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= 500*K + A] f1 ~> f1 [A <= K + A, B <= B, C <= C] + Applied Processor: FlowAbstraction + Details: () * Step 6: Failure MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0] f1 ~> f3 [huge ~=> B] f1 ~> f1 [A ~+> A,K ~+> A] f2 ~> f3 [huge ~=> A,huge ~=> B,huge ~=> C] f2 ~> f1 [huge ~=> A,huge ~=> C] f1 ~> exitus616 [] f2 ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] f1 ~> f1 [A ~+> A,K ~+> A] + Applied Processor: LareProcessor + Details: Unknown bound. MAYBE