// Author: Thomas Lang, heizmann@informatik.uni-freiburg.de
// Date: 2015-06-03

parseAutomata("../../PathologicalExamples.ats");

assert(loopComplexity(noInitialStates) == 0);
assert(loopComplexity(noFinalStates) == 0);
assert(loopComplexity(noStates) == 0);
assert(loopComplexity(unreachableStates) == 0);
assert(loopComplexity(totalOneStateAutomaton) == 1);
assert(loopComplexity(emptyAutomaton) == 0);
assert(loopComplexity(noTransitionAutomaton) == 0);


parseAutomata("../Misc_Divisibility.ats");

assert(loopComplexity(Amod2) == 2);
assert(loopComplexity(Amod3) == 2);


parseAutomata("../../LoopComplexity_Examples.ats");

assert(loopComplexity(LC0) == 0);
assert(loopComplexity(LC1) == 1);
assert(loopComplexity(LC2) == 2);
assert(loopComplexity(LC3) == 3);
assert(loopComplexity(LCTEST1) == 1);
assert(loopComplexity(Cycle) == 1);