AUTParser only adds states with outgoing transitions

[ericcccsliu]

Given the following AUT input:

des(0,4,3)  
(0,input,1)
(0,output,2)
(1,input,2)
(1,output,0)

the current AUT parser creates a SimpleAutomaton with only two states, 0 and 1. State 2 is omitted.

In general, states with no outgoing transitions are ignored by the AUT parser—in InternalAutParser.java the following lines of code are responsible for adding states to the outputted automaton, but only states that correspond to keys in the transitionMap (i.e. states that have outgoing transitions) are iterated over.

final CompactNFA<I> result = new CompactNFA<>(alphabet, transitionMap.size());

for (int i = 0; i < transitionMap.size(); i++) {
    result.addState();
}