Write a program which will eventually, given enough time, print all possible permutations of ASCII characters (both printable and non-printable) less than or equal to its length, except itself. The text of the program must not appear anywhere in its output.
For example, if your program is abc
, then part of your output could look like:
(many lines omitted)
ab0
ab1
ab2
...
abb
abd
(many lines omitted)
or
...[some character other than a]bcabacba5804g715^^*#0...
If your language requires characters that are not printable ASCII (e.g. Jelly or APL), print all combinations of characters in its code page.
The strings need not be separate from each other; a single character can be counted as part of multiple strings. You could try to create a superpermutation, which would be at least \$95! + 94! + 93! + 95 − 3 = 1.04 × 10^{148}\$ characters long.
Standard quine rules apply (no reading the program's source code) but this is also code golf.