Yes. From the point of view of the resolver, “uninstalled” is essentially like any other possible version that a package can be in, except that it is the preferred one if available (so that it doesn’t install unnecessary packages).

The way to read those messages is as follows. All packages start with all their possible versions (including “uninstalled”) available. Then those are progressively trimmed. First, by explicit requirements (e.g. you add FreeTypeAbstraction and that removes the “uninstalled” version from the available ones). Then, by julia compatibility. Then, by compatibility restrictions (e.g. it may find that all the remaining versions of some package A are incompatible with some version X.Y.Z of another package B, then that version X.Y.Z is removed from the possible ones of package B).

The issue with reporting this last part of the process is that it walks a complicated dependency graph, and keeps trimming down versions of all packages until nothing changes any more, after which the actual resolving takes place on the surviving versions. So the way that the process is presented is that for each package A it shows each step of the trimming down process, and for any dependency or dependant B that has had an effect on A it creates a sub-list showing what happened with package B’s versions and how it arrived at the result. This is recursive, of course, since package B is undergoing the same process in the meantime.

One issue which is especially hard to report is how exactly the compatibility restrictions were determined. In this case, it is easy: FreeTypeAbstractions depends on version 0.6.0 of ColorVectorSpace, which is unavailable due to another requirement fixing the version to 0.7.0. However, in general it may be a lot more complicated: the compatibility between versions of two packages is represented as a binary matrix, and the solver is taking sub-matrices and determining whether there are entire rows or columns that are all-zero. It is thus hard to figure out how to make that decision human-readable except in the simplest cases.