A counter-example to the minimal coverability tree algorithm

In [1], an algorithm to compute a minimal coverability tree for Petri nets has been presented. This document demonstrates, thanks to a simple counter-example, that this algorithm may compute an under-approximation of a coverability tree, i.e. a tree whose set of nodes is not su#cient to cover all the reachable markings