Consider the TRS R consisting of the rewrite rules

1: g(b) -> f(b)
2: f(a) -> g(a)
3: b -> a

There are 2 dependency pairs:

4: G(b) -> F(b)
5: F(a) -> G(a)

The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.