Trying to load file: main.koat

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


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

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

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


Applied simple chaining:
  Start location: f3
      0: f3 -> [3] : A'=0, [ A>=1 ], cost: 1+A


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


Computing complexity for remaining 1 transitions.

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

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


The final runtime is determined by this resulting transition:
  Final Guard: A>=1
  Final Cost:  1+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),?)