autfilt --split-edges
We need an algorithm twa_graph_ptr split_edges(const_twa_graph_ptr in)
that splits all edges of the automaton so that they are all transitions (i.e., labeled by an assignment of each atomic proposition). After such transformation, the labels can easily be interpreted as letters.