In a phylogenetic tree, branch saturation is the occurrence of too many mutations along a branch as to provide information about the branch location and length. Since branch saturation leads to unreliable reconstructed trees, testing all branches for saturation is a necessary step in any accurate reconstruction protocol. The core of this work is the software implementation of the asymptotic test for branch saturation. After presenting three examples using different trees, the concept of saturation and its causes are analysed.