Yes, the _presentation axiom_ ($\mathbf{PAx}$), which implies dependent choice and so also countable choice holds in realizability models. Hence it is consistent with Church's Thesis (all functions are computable) and we have conservativity for some formulas (in particular all $\Pi^0_1$ sentences). Also there is a very weak axiom, $\mathbf{AC}_{\omega, \omega}$ for which we get conservativity for all arithmetical sentences (see Chen, _Independence and conservativity results for intuitionistic set theory_, chapter 8).