A \(\Psi \) -space \(\Psi ({\mathscr {A}})\) is a Tychonoff space of the form \({\omega }\cup {\mathscr {A}}\) , where \(\omega \) is a countable open discrete subspace, \(\mathscr {A}\) is an almost disjoint family in \(\omega \) which becomes an uncountable closed discrete subspace in \(\Psi ({\mathscr {A}})\) topologized by the finest topology which makes \(\omega \) open and discrete and each \(A \in {\mathscr {A}}\) is a sequence in \(\omega \) converging to the point \(A \in \Psi (\mathscr {A})\) . The modification of a \(\Psi \) -space replacing the points of \(\omega \) with certain “building blocks” is called fat \(\Psi \) -space. Recently, Bonanzinga and Giacopello introduced a “ machine” that associates with a zero-dimensional space having a “bad” family of open sets another zero-dimensional space having an open cover exhibiting similarly “bad” properties, while preserving some of the “good” characteristics of the original space. The construction of the machine is a specific type of fat \(\Psi \) -space construction. In this paper, we prove that the machine offers a simple and efficient method to distinguish several well-known covering properties and give a partial negative answer to a question posed in 2000 by Bonanzinga and Matveev.