Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked whether the extension of Propositional Dynamic Logic with k-MVPAs still leads to a decidable logic. This question is answered negatively here. Key words: Propositional Dynamic Logic, Visibly Pushdown Automata, Multi-Stack Visibly Pushdown Automata, Decidability, Satisfiability