Summary: It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for constrained Horn clauses (or CHC solvers) based on predicate abstraction are sometimes unable to verify satisfiability because they look for models that are definable in a given class \(\mathcal{A}\) of constraints, called \(\mathcal{A}\)-definable models. We introduce a transformation technique, called Predicate Pairing, which is able, in many interesting cases, to transform a set of clauses into an equisatisfiable set whose satisfiability can be proved by finding an \(\mathcal{A}\)-definable model, and hence can be effectively verified by a state-of-the-art CHC solver. In particular, we prove that, under very general conditions on \(\mathcal{A}\), the unfold/fold transformation rules preserve the existence of an \(\mathcal{A}\)-definable model, that is, if the original clauses have an \(\mathcal{A}\)-definable model, then the transformed clauses have an \(\mathcal{A}\)-definable model. The converse does not hold in general, and we provide suitable conditions under which the transformed clauses have an \(\mathcal{A}\)-definable model if and only if the original ones have an \(\mathcal{A}\)-definable model. Then, we present a strategy, called Predicate Pairing, which guides the application of the transformation rules with the objective of deriving a set of clauses whose satisfiability problem can be solved by looking for \(\mathcal{A}\)-definable models. The Predicate Pairing (PP) strategy introduces a new predicate defined by the conjunction of two predicates occurring in the original set of clauses, together with a conjunction of constraints. We will show through some examples that an \(\mathcal{A}\)-definable model may exist for the new predicate even if it does not exist for its defining atomic conjuncts. We will also present some case studies showing that Predicate Pairing plays a crucial role in the verification of relational properties of programs, that is, properties relating two programs (such as program equivalence) or two executions of the same program (such as non-interference). Finally, we perform an experimental evaluation of the proposed techniques to assess the effectiveness of Predicate Pairing in increasing the power of CHC solving.