In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of boolean conflict analysis. This and other imprvements lead to significant performance gains in some classes of problems.