Trying to load file: main.koat Initial Control flow graph problem: Start location: f5 0: f4 -> f4 : A'=-B+A, [ A>=0 ], cost: 1 1: f4 -> f6 : C'=0, D'=0, E'=0, F'=0, G'=0, [ 0>=1+A ], cost: 1 2: f5 -> f4 : [ 0>=1+B ], cost: 1 3: f5 -> f6 : C'=0, D'=0, E'=0, F'=0, G'=0, [ B>=0 ], cost: 1 Simplified the transitions: Start location: f5 0: f4 -> f4 : A'=-B+A, [ A>=0 ], cost: 1 2: f5 -> f4 : [ 0>=1+B ], cost: 1 Eliminating 1 self-loops for location f4 Removing the self-loops: 0. Adding an epsilon transition (to model nonexecution of the loops): 5. Removed all Self-loops using metering functions (where possible): Start location: f5 4: f4 -> [3] : A'=-B+A, [ A>=0 ], cost: 1 5: f4 -> [3] : [], cost: 0 2: f5 -> f4 : [ 0>=1+B ], cost: 1 Applied chaining over branches and pruning: Start location: f5 Final control flow graph problem, now checking costs for infinitely many models: Start location: f5 Computing complexity for remaining 0 transitions. The final runtime is determined by this resulting transition: Final Guard: Final Cost: 1 Obtained the following complexity w.r.t. the length of the input n: Complexity class: const Complexity value: 0 WORST_CASE(Omega(1),?)