Prove that a langauge is in NP-Complete


I am stuck on how to prove this question in NP-complete.

Ver = {(p, x, 1^t) : there exists a string y of length t such that program p on input (x, y) stops and outputs 1 within t time steps}