Run Forester, Run Backwards! - (Competition Contribution)

This paper briefly describes the Forester tree automata-based shape analyser and its participation in the SV-COMP'16 competition on software verification. In particular, it summarizes the verification approach used by Forester, its architecture and setup for the competition, as well as its strengths and weaknesses observed in the competition run. The paper highlights the newly added counterexample validation and use of refinable predicate language abstraction.