Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f2
      0: f300 -> f300 : A'=1+A, [ B>=1+A ], cost: 1
      1: f300 -> f1 : C'=free, [ A>=B ], cost: 1
      2: f2 -> f300 : [], cost: 1


Simplified the transitions:
  Start location: f2
      0: f300 -> f300 : A'=1+A, [ B>=1+A ], cost: 1
      2: f2 -> f300 : [], cost: 1

Eliminating 1 self-loops for location f300
  Self-Loop 0 has the metering function: B-A, resulting in the new transition 3.
  Removing the self-loops: 0.

Removed all Self-loops using metering functions (where possible):
  Start location: f2
      3: f300 -> [3] : A'=B, [ B>=1+A ], cost: B-A
      2: f2 -> f300 : [], cost: 1


Applied simple chaining:
  Start location: f2
      2: f2 -> [3] : A'=B, [ B>=1+A ], cost: 1+B-A


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


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 1+B-A
  and guard: B>=1+A:
  B: Pos, A: Pos, where: B > A

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


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

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