For example if if there are server logs showing I downloaded illegal files, and there are people who testify that I talked about downloading illegal files, and there is non pre-installed software on my computer that is used for encryption then probably that sequence of random bits is an encrypted file.
Maybe you can't prove it mathematically, but you can prove it legally.
A doubt which you cannot reason away is reasonable, by definition. Therefore it is below the threshold of legal proof.
It is could even be possible, even likely, to create encryption schemes where several different encrypted volumes could share the exact same data blocks using something similar to homomorphic encryption. Which raises and obvious question: If the unlocked drive did not contain the data sought, can we hold someone in contempt after they did what we asked from them simply because we didn't find what we were looking for? Because we truly can't know if there is several encrypted volume in the same space without assumptions about information entropy and inaccessible configuration data.
Thankfully homomorphic encryption is not really practically viable today, so that particularly nasty can of worms is not imminent to solve, but we might be well served to let out decisions be informed by it, as it breaks most assumptions of what can be known, and what can't.