  Termination analysis of C programs is a challenging task. On the one hand,
the analysis needs to be precise enough to draw meaningful conclusions. On the
other hand, relevant programs in practice are large and require substantial
abstraction. It is this inherent trade-off that is the crux of the problem. In
this work, we present AProVE, a tool that uses symbolic execution to analyze
termination of memory-manipulating C programs. While traditionally, AProVE's
focus was on the preciseness of the analysis, we describe how we adapted our
approach towards a modular analysis. Due to this adaption, our approach can now
also handle recursive programs. Moreover, we present further performance
improvements which we developed to make AProVE scale to large programs.
