Undecidable/Decidable Language
No, because A TM has 3 possibilities: run forever, accept, or reject. So the language of a TM is recursively enumerable as the TM M either accepts some input x, which means x is in L(M), or otherwise rejects or runs forever.

A language can be non-recursively enumerable, but the language of a concrete TM is always recursively enumerable.