Nonsingularity of the information matrix plays a key role in model identification and the asymptotic theory of statistics. For many statistical models, however, this condition seems virtually impossible to verify. An example of such models is a class of mixture models associated with multipath change-point problems (MCPs). The question then arises as to how often this assumption fails to hold. Using the subimmersion theorem and upper semicontinuity of the spectrum, we show that the set of singularities of the information matrix is a nowhere dense set, i.e., geometrically negligible, if the model is identifiable and some mild smoothness conditions hold. Under further smoothness conditions we show that the set is also of measure zero, i.e., both geometrically and analytically negligible. In view of our main results, we further study a flexible class of MCP models, thus paving the way for establishing asymptotic normality of the maximum likelihood estimates (MLEs) and statistical inference of the unknown parameters in such models.