The snitch name eating bug is directly related to auto-update detection failing. It may have to do with the ordering of the vector used to store snitches, or the sort function used. I will be investigating. Seeing that a good, natural, non-overlapping compare function is in use, leveraging TreeSet could avoid the need to continually resort on new snitch add, and lead to O(ln) direct indexing of snitches. Might be simpler than the memory datastructure I was working on.
I'll notate progress here.