  Concolic testing mixes symbolic and concrete execution to generate test cases
covering paths effectively. Its benefits have been demonstrated for more than
15 years to test imperative programs. Other programming paradigms, like logic
programming, have received less attention. In this paper, we present a
concolic-based test generation method for logic programs. Our approach exploits
SMT-solving for constraint resolution. We then describe the implementation of a
concolic testing tool for Prolog and validate it on some selected benchmarks.
