Trying to load file: main.koat

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

Eliminating 3 self-loops for location eval
  Self-Loop 1 has the metering function: B-C+A, resulting in the new transition 5.
  Self-Loop 2 has unbounded runtime, resulting in the new transition 6.
  Found this metering function when nesting loops: -1+A,
  Removing the self-loops: 0 1 2.
Adding an epsilon transition (to model nonexecution of the loops): 7.

Removed all Self-loops using metering functions (where possible):
  Start location: start
      4: eval -> [2] : A'=-1+A, [ B+A>=1+C && C>=0 && A>=1 ], cost: 1
      5: eval -> [2] : B'=C-A, [ B+A>=1+C && C>=0 && 0>=A && B>=1 ], cost: B-C+A
      6: eval -> [2] : [ B+A>=1+C && C>=0 && 0>=A && 0>=B ], cost: INF
      7: eval -> [2] : [], cost: 0
      3: start -> eval : [], cost: 1


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


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


Computing complexity for remaining 1 transitions.


The final runtime is determined by this resulting transition:
  Final Guard: 
  Final Cost:  1

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)