Abnormal memory requirements for a query with string filter


Appeared fresh after upgrade to 21.3.2.5 

The table is not big - 480 mb compressed

Getting an error
```
SQL Error [241]: ClickHouse exception, code: 241, host: localhost, port: 8123; Code: 241, e.displayText() = DB::Exception: Memory limit (for query) exceeded: would use 1.00 EiB (attempt to allocate chunk of 1152921504606554384 bytes), maximum: 101.47 GiB: While executing ConvertingAggregatedToChunksTransform (version 21.3.2.5 (official build))

The query is quite plain
SELECT 
       FirstScreen,
       "SessionResult" AS "SessionResult",
       count(*) AS count
FROM
  (SELECT FirstScreen,
          SessionResult,
          LastResponse,
          toDate(LastResponseDateTime),
          WasEligible,
          WasSessionSuccessfull,
          COUNT (*)
   FROM MPTUSSDSESSIONS
   GROUP by FirstScreen,
            SessionResult,
            LastResponse,
            toDate(LastResponseDateTime),
            WasEligible,
            WasSessionSuccessfull) AS expr_qry
WHERE  "SessionResult" NOT IN ('unknown result')
  AND "WasSessionSuccessfull" ='Y'
GROUP BY FirstScreen,  "SessionResult"
ORDER BY count DESC
LIMIT 10000;
```

Most interesting - when line  `AND "WasSessionSuccessfull" ='Y' ` is removed from the query it completes ok.
bool needed_by_split_node = false;
        bool visited = false;
        bool used_in_result = false;
        
        
        Node * to_second = nullptr;
        Node * to_first = nullptr;
    };
    std::stack<Frame> stack;
    std::unordered_map<const Node *, Data> data;
    for (const auto & node : index)
        data[node].used_in_result = true;
    
    for (const auto & node : nodes)
    {
        if (split_nodes.count(&node) == 0)
            continue;
        auto & cur_data = data[&node];
        if (cur_data.needed_by_split_node)
            continue;
        cur_data.needed_by_split_node = true;
        stack.push({.node = &node});
        while (!stack.empty())
        {
            auto & cur_node = stack.top().node;
            stack.pop();
            for (const auto * child : cur_node->children)
            {
                auto & child_data = data[child];
                if (!child_data.needed_by_split_node)