Before revision:  We show that the computational complexity of verifying such a URLanizing multi-agent system remains close to the domain of standard ATL .
After revision:  We show that the computational complexity of verifying such a URLanizing multi-agent system is in exponential time .