Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      0: f2 -> f3 : A'=-1+A, B'=free, [ A>=0 ], cost: 1
      1: f2 -> f3 : B'=free_1, [ 0>=1+A ], cost: 1


Simplified the transitions:
  Start location: f2
    <empty>


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f2
    <empty>


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),?)