Trying to load file: main.koat Initial Control flow graph problem: Start location: f0 0: f11 -> f54 : C'=B+A, [ A>=B ], cost: 1 1: f11 -> f54 : C'=B-A, [ B>=1+A ], cost: 1 2: f38 -> f11 : A'=free, F'=D, G'=D, [ D>=1+E ], cost: 1 3: f38 -> f11 : A'=free_1, F'=D, G'=D, H'=free_2, [ E>=D ], cost: 1 4: f0 -> f38 : A'=1, B'=2, D'=1, E'=10, Q'=10, J'=2, K'=free_3, [], cost: 1 Simplified the transitions: Start location: f0 Final control flow graph problem, now checking costs for infinitely many models: Start location: f0 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),?)