A double-sided shadow minimization problem in the Boolean cube layer is investigated in this paper. The problem is to minimize the size of the union of the lower and upper shadows of a k-uniform family of subsets of [n]. It is shown that if 3 ⋜ k ⋜ n−3, there is no total order such that all its initial segments have minimal double-sided shadow.