Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start
      0: eval -> eval : A'=-1+A, [ A>=1+B ], cost: 1
      1: eval -> eval : A'=-1+A, [ C>=1+B && A>=1+B ], cost: 1
      2: eval -> eval : C'=-1+C, [ A>=1+B && B>=A && C>=1+B ], cost: 1
      3: eval -> eval : C'=-1+C, [ C>=1+B && B>=A ], cost: 1
      4: eval -> eval : [ A>=1+B && B>=A && B>=C ], cost: 1
      5: eval -> eval : [ C>=1+B && B>=A && B>=C ], cost: 1
      6: start -> eval : [], cost: 1

Eliminating 6 self-loops for location eval
  Self-Loop 0 has the metering function: -B+A, resulting in the new transition 7.
  Self-Loop 1 has the metering function: -B+A, resulting in the new transition 8.
  Self-Loop 2 has unbounded runtime, resulting in the new transition 9.
  Self-Loop 3 has the metering function: -B+C, resulting in the new transition 10.
  Self-Loop 4 has unbounded runtime, resulting in the new transition 11.
  Self-Loop 5 has unbounded runtime, resulting in the new transition 12.
  Found this metering function when nesting loops: -1-B+A,
  Found this metering function when nesting loops: -1-B+A,
  Removing the self-loops: 0 1 2 3 4 5.

Removed all Self-loops using metering functions (where possible):
  Start location: start
      7: eval -> [2] : A'=B, [ A>=1+B ], cost: -B+A
      8: eval -> [2] : A'=B, [ C>=1+B && A>=1+B ], cost: -B+A
      9: eval -> [2] : [ A>=1+B && B>=A && C>=1+B ], cost: INF
     10: eval -> [2] : C'=B, [ C>=1+B && B>=A ], cost: -B+C
     11: eval -> [2] : [ A>=1+B && B>=A && B>=C ], cost: INF
     12: eval -> [2] : [ C>=1+B && B>=A && B>=C ], cost: INF
      6: start -> eval : [], cost: 1


Applied chaining over branches and pruning:
  Start location: start
     13: start -> [2] : A'=B, [ A>=1+B ], cost: 1-B+A
     14: start -> [2] : A'=B, [ C>=1+B && A>=1+B ], cost: 1-B+A
     15: start -> [2] : C'=B, [ C>=1+B && B>=A ], cost: 1-B+C


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


Computing complexity for remaining 3 transitions.

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

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


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