Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: evalndecrstart
      0: evalndecrstart -> evalndecrentryin : [], cost: 1
      1: evalndecrentryin -> evalndecrbb1in : A'=-1+A, [], cost: 1
      2: evalndecrbb1in -> evalndecrbbin : [ A>=2 ], cost: 1
      3: evalndecrbb1in -> evalndecrreturnin : [ 1>=A ], cost: 1
      4: evalndecrbbin -> evalndecrbb1in : A'=-1+A, [], cost: 1
      5: evalndecrreturnin -> evalndecrstop : [], cost: 1


Simplified the transitions:
  Start location: evalndecrstart
      0: evalndecrstart -> evalndecrentryin : [], cost: 1
      1: evalndecrentryin -> evalndecrbb1in : A'=-1+A, [], cost: 1
      2: evalndecrbb1in -> evalndecrbbin : [ A>=2 ], cost: 1
      4: evalndecrbbin -> evalndecrbb1in : A'=-1+A, [], cost: 1


Applied simple chaining:
  Start location: evalndecrstart
      0: evalndecrstart -> evalndecrbb1in : A'=-1+A, [], cost: 2
      2: evalndecrbb1in -> evalndecrbb1in : A'=-1+A, [ A>=2 ], cost: 2

Eliminating 1 self-loops for location evalndecrbb1in
  Self-Loop 2 has the metering function: -1+A, resulting in the new transition 6.
  Removing the self-loops: 2.

Removed all Self-loops using metering functions (where possible):
  Start location: evalndecrstart
      0: evalndecrstart -> evalndecrbb1in : A'=-1+A, [], cost: 2
      6: evalndecrbb1in -> [6] : A'=1, [ A>=2 ], cost: -2+2*A


Applied simple chaining:
  Start location: evalndecrstart
      0: evalndecrstart -> [6] : A'=1, [ -1+A>=2 ], cost: -2+2*A


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


Computing complexity for remaining 1 transitions.

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

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


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