Zaslat SMS: The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata