The last rule's pattern matches any word and so the lemmatizer cannot fail to produce output.
to the DAG, the tree implements negation: if the N th sibling of a row of children fires, it not only means that the pattern of the N th rule matches the word, it also means that the patterns of the N-1 preceding siblings do not match the word.