I think, the challenge Sigaba2 is not solvable because there is not only a problem with the reversed rotors but also with the not reversed rotors.
The function simulator first initializes the arrays CipherRotors and computes then with the functions generateCipherOffsets and generateControlOffsets the corresponding offsets CipherRotorsOffsets and ControlRotorsOffsets from the arrays CipherRotors and ControlRotors. These offsets belongs to the initial position "A" for every rotor.
After this the arrays CipherRotorsOffsets and ControlRotorsOffsets will be adapted to the given initial settings for the cipher and control rotors (function setPosition).
Until now there is no problem. But now comes the critical part. For every reversed rotor the function reverse will be called. For the rotor to be reversed this function computes the reversed Permutation in the corresponding array CipherRotors or ControlRotors, depending on the data in the arrays CipherRotorsOffsets or ControlRotorsOffsets. Because the latter data has been already previously changed due to the corresponding initial setting, the data in the array CipherRotors or ControlRotors depend on the initial setting of this rotor.
After this the corresponding array CipherRotorsOffsets or ControlRotorsOffsets has to be updated with a call to the function generateCipherOffsets or generateControlOffsets. And this is the problem because these two functions generate not only the offset for the actual reversed rotor but also for all other not reversed rotors (this two function should update the offsets only for the actual reversed rotor). Because this two functions uses the data given in the arrays CipherRotors or ControlRotors, which belongs to the initial position "A", all not reversed rotors will be set back to initial position "A".
As a summary we can say, that the reversed rotor(s) depend on the initial setting but for all not reversed rotors every initial setting will be mapped to "A". If for instance rotor 5 of the cipher rotors has been reversed (00001) and the initial setting for the cipher rotors has been ABCDE, then all other initial settings xxxxE will also do the job (x stands for an arbitrary letter A..Z).
Because the initial setting is part of the solution and I cannot decide, which of all possible initial settings the author of this challenge has used, the challenge seems to me unsolvable with the given source code (I have only 5 trys).
The challenge Sigaba1 is not affected by this problem, because the initial setting is already given and is not part of the solution.