Trying to load file: main.koat

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


Applied chaining over branches and pruning:
  Start location: start
      5: eval1 -> eval1 : B'=1+B, [ A>=1+B && A>=1+C ], cost: 2
      6: eval1 -> eval1 : C'=1+C, [ A>=1+B && A>=1+C ], cost: 2
      7: eval1 -> eval1 : A'=-1+A, [ A>=1+B && C>=A ], cost: 2
      4: start -> eval1 : [], cost: 1

Eliminating 3 self-loops for location eval1
  Self-Loop 5 has the metering function: -B+A, resulting in the new transition 8.
  Self-Loop 6 has the metering function: -C+A, resulting in the new transition 9.
  Self-Loop 7 has the metering function: -B+A, resulting in the new transition 10.
  Removing the self-loops: 5 6 7.

Removed all Self-loops using metering functions (where possible):
  Start location: start
      8: eval1 -> [3] : B'=A, [ A>=1+B && A>=1+C ], cost: -2*B+2*A
      9: eval1 -> [3] : C'=A, [ A>=1+B && A>=1+C ], cost: -2*C+2*A
     10: eval1 -> [3] : A'=B, [ A>=1+B && C>=A ], cost: -2*B+2*A
      4: start -> eval1 : [], cost: 1


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


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


Computing complexity for remaining 3 transitions.

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

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


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