Consider the following automata and the string aabbb

b

a$.$ The PDA accepts the language $a^n{b}^n$

b$.$ At time $t=5,$ the PDA halts and the string aabbb is accepted

c$.$ PDA halts; stack empty

d$.$ PDA rejects the string because the number of a$\text{'}$s not equal to number of b$\text{'}$s