 
                     //inner probing scheme (linear probing with group)
                     for (index_t lvl2 = 0;
-                                 group_is_active
-                                 && (lvl2 < config.lvl2_max);
+                                 group_is_active && (lvl2 < config.lvl2_max);
                                  ++lvl2)
                     {
+
+                        printf("%llu %u %u\n", data_index, group.thread_rank(), threadIdx.x);
 
                         index_t lvl2_offset = lvl2 * group.size()
                                             + group.thread_rank();

                            //update+retrieve
                            if (table_elem.get_key() == data_elem.get_key())
                            {
                                if(group.thread_rank() == leader_rank())
                                {



                //outer probing scheme (random hashing)
                for (index_t lvl1 = 0;
                             group_is_active && (lvl1 < config.lvl1_max);
                             ++lvl1)
                {

