Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start
      0: eval -> eval : A'=-1+A, B'=1+B, [ A>=1+B ], cost: 1
      1: start -> eval : [], cost: 1

Eliminating 1 self-loops for location eval
  Self-Loop 0 has the metering function: meter, resulting in the new transition 2.
  Removing the self-loops: 0.

Removed all Self-loops using metering functions (where possible):
  Start location: start
      2: eval -> [2] : A'=-meter+A, B'=B+meter, [ A>=1+B && 2*meter==-B+A ], cost: meter
      1: start -> eval : [], cost: 1


Applied simple chaining:
  Start location: start
      1: start -> [2] : A'=-meter+A, B'=B+meter, [ A>=1+B && 2*meter==-B+A ], cost: 1+meter


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: start
      1: start -> [2] : A'=-meter+A, B'=B+meter, [ A>=1+B && 2*meter==-B+A ], cost: 1+meter


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 1+meter
  and guard: A>=1+B && 2*meter==-B+A:
  B: Both, meter: Pos, A: Both

Found new complexity n^1, because: Found infinity configuration.


The final runtime is determined by this resulting transition:
  Final Guard: A>=1+B && 2*meter==-B+A
  Final Cost:  1+meter

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: n^1
  Complexity value: 1

WORST_CASE(Omega(n^1),?)