Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constraint qual- ications. A new strong sequential optimality condition is introduced in the present paper. A proof that a well established Augmented Lagrangian algorithm produces sequences whose limits satisfy the new condition is given. Practical consequences will be discussed.