Stack overflow с тернарным оператором

unsigned long Ly(const string &s) { ... }
unsigned long Rs(const string &s) { ... }
 
unsigned long(*F[])(const string &)={Ly, Rs};
char N = sizeof(F)/sizeof(F[0]); // Кол-во функций до 127 вкл-но
 
bool ffffffff(false); // 0xffffffff
bitset<ULONG_MAX> *BoolHash = new bitset<ULONG_MAX>();
map<unsigned long, unsigned short> count;
void main()
{
//  for(char i(-128); ++i != 127;)
//      cout << "123" << i << "456\n";
 
//  TestBitHash();
    string S("1234");
    for(char i(-1); ++i != N;)
    {
        for(unsigned long l(ULONG_MAX); ++l != ULONG_MAX;)
        {
            for(char c(-1); ++c != S._Mysize; S[c] = (unsigned char) (l >> (24 - c*8)) );
            if(F[i](S) == 0xffffffff)
                ((*BoolHash)[F[i](S)])?((*BoolHash).set(F[i](S))/*++count[F[i](S)]*/):((*BoolHash).set(F[i](S)));
            else
                (ffffffff)?(ffffffff = true/*++count[0xffffffff]*/):(ffffffff = true);
        }
    }
}

bitset<ULONG_MAX> *BoolHash = new bitset<ULONG_MAX>();

bitset<1> *BoolHash = new bitset<1>();

    map<string, string> mapp;
    cout << sizeof(mapp) << endl;

#include <iostream>
#include <bitset>
#include <limits>
 
using namespace std;
 
 
int main()
{
    const auto gb = 1024ul * 1024 * 1024;
    const auto sizeofBitset = sizeof(std::bitset<std::numeric_limits<unsigned long>::max()>);
    std::cout << "unsigned long max = " << std::numeric_limits<unsigned long>::max() << std::endl;
    std::cout << "size of bitset    = " << sizeofBitset << std::endl;
    std::cout << "size of bitset    = " << sizeofBitset/gb << " Gb" << std::endl;
    return 0;
}

output:
unsigned long max = 18446744073709551615
size of bitset    = 2305843009213693952
size of bitset    = 2147483648 Gb

((*BoolHash)[F[i](S)])?((*BoolHash).set(F[i](S))/*++count[F[i](S)]*/):((*BoolHash).set(F[i](S)));

((*BoolHash)[F[i](S)])?(++count[F[i](S)]):((*BoolHash).set(F[i](S)));