Trying to load file: main.koat

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


Simplified the transitions:
  Start location: start
      1: sumto -> sumto : A'=1+A, [ B>=A ], cost: 1
      2: start -> sumto : [], cost: 1

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

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


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


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


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+B-A
  and guard: B>=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>=A
  Final Cost:  2+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),?)