The L1 solver uses PBVI and Symbolic Perseus. These are approximate solvers and convergence is not always guaranteed. This is evident while solving the tiger problem for greater time steps with a limited horizon belief expansion. However, the solver does oscillate between a few values of bellman error. This can be used a criteria to declare approximate convergence.