LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O2/tdv[P]boss/boss/include/common/file_stream.h
// Function: Boss::Private::IOFileStream<Boss::IIStream>::Read(Boss::IBuffer**)
virtual RetCode BOSS_CALL Read(IBuffer **buffer)
      {
        if (!buffer || *buffer)
          return Status::InvalidArgument;
        assert(!!File && "File not open.");
        if (!File)
          return Status::Fail;
        try
        {
          std::vector<char> Buffer;
          for (std::vector<char> Tmp(ReadBufSize) ; !std::feof(File) ; )
          {
            std::size_t Res = std::fread(&Tmp[0], 1, Tmp.size(), File);
            if (!Res || Res > Tmp.size())
              return Status::Fail;
            std::copy(std::begin(Tmp), std::end(Tmp), std::back_inserter(Buffer));
          }
          return Base<RawBuffer>::Create(Buffer.empty() ? nullptr : &Buffer[0], Buffer.size()).QueryInterface(buffer);
        }
        catch (...)
        {
        }
        return Status::Fail;
      }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x50, %rsp
pushq $0x5
popq %rbp
testq %rsi, %rsi
je 0x19033
movq %rsi, %rbx
cmpq $0x0, (%rsi)
jne 0x19033
movq %rdi, %r14
cmpq $0x0, 0x8(%rdi)
je 0x19042
xorps %xmm0, %xmm0
movaps %xmm0, 0x20(%rsp)
andq $0x0, 0x30(%rsp)
leaq 0x8(%rsp), %rdi
leaq 0x40(%rsp), %rdx
movl $0x2000, %esi           # imm = 0x2000
callq 0x19312
pushq $0x1
popq %r15
leaq 0x20(%rsp), %r12
movq 0x8(%r14), %rdi
callq 0x14530
testl %eax, %eax
jne 0x18fc9
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rdx
subq %rdi, %rdx
movq 0x8(%r14), %rcx
movq %r15, %rsi
callq 0x14470
testq %rax, %rax
je 0x18fba
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rsi
movq %rsi, %rcx
subq %rdi, %rcx
cmpq %rcx, %rax
ja 0x18fba
movq %r12, %rdx
callq 0x1981a
jmp 0x18f70
leaq 0x8(%rsp), %rdi
callq 0x19716
pushq $0x2
popq %rbp
jmp 0x19029
leaq 0x8(%rsp), %rdi
callq 0x19716
movq 0x20(%rsp), %rax
movq 0x28(%rsp), %rcx
xorl %edx, %edx
subq %rax, %rcx
cmovneq %rax, %rdx
leaq 0x40(%rsp), %rsi
movq %rdx, (%rsi)
leaq 0x48(%rsp), %rdx
movq %rcx, (%rdx)
leaq 0x8(%rsp), %rdi
callq 0x19364
movq 0x8(%rsp), %rdi
testq %rdi, %rdi
je 0x1901c
movq (%rdi), %rax
movl $0xaaa58dc, %esi        # imm = 0xAAA58DC
movq %rbx, %rdx
callq *0x28(%rax)
movl %eax, %ebp
jmp 0x1901f
pushq $0x2
popq %rbp
leaq 0x8(%rsp), %rdi
callq 0x19302
leaq 0x20(%rsp), %rdi
callq 0x19716
movl %ebp, %eax
addq $0x50, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
leaq 0xa5260(%rip), %rdi     # 0xbe2a9
leaq 0xa51a8(%rip), %rsi     # 0xbe1f8
leaq 0xa5307(%rip), %rcx     # 0xbe35e
pushq $0x54
popq %rdx
callq 0x14150
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x19302
jmp 0x19082
jmp 0x19070
movq %rax, %rbx
jmp 0x19082
movq %rax, %rbx
leaq 0x8(%rsp), %rdi
callq 0x19716
leaq 0x20(%rsp), %rdi
callq 0x19716
movq %rbx, %rdi
callq 0x1a650
callq 0x1a6c0
pushq $0x2
popq %rbp
jmp 0x19033
// File: /workspace/github_cpp_makefile_star2_O2/tdv[P]boss/boss/include/common/file_stream.h
// Function: Boss::Private::IOFileStream<Boss::IIStream>::Write(void const*, unsigned int)
virtual RetCode BOSS_CALL Write(void const *data, UInt bytes)
      {
        if (!data || !bytes)
          return Status::False;
        assert(!!File && "File not open.");
        if (!File)
          return Status::Fail;
        return std::fwrite(data, 1, bytes, File) == bytes ? Status::Ok : Status::Fail;;
      }

// Assembly:
pushq %rbx
testq %rsi, %rsi
sete %al
testl %edx, %edx
sete %cl
orb %al, %cl
jne 0x190d9
movq 0x8(%rdi), %rcx
testq %rcx, %rcx
je 0x190de
movl %edx, %ebx
pushq $0x1
popq %rax
movq %rsi, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x14600
movq %rax, %rcx
xorl %eax, %eax
cmpq %rbx, %rcx
setne %al
addl %eax, %eax
jmp 0x190dc
pushq $0x1
popq %rax
popq %rbx
retq
leaq 0xa51c4(%rip), %rdi     # 0xbe2a9
leaq 0xa510c(%rip), %rsi     # 0xbe1f8
leaq 0xa52e8(%rip), %rcx     # 0xbe3db
pushq $0x6d
popq %rdx
callq 0x14150
nop
// File: /workspace/github_cpp_makefile_star2_O2/tdv[P]boss/boss/include/common/buffer.h
// Function: Boss::RawBuffer::GetData(void const**) const
virtual RetCode BOSS_CALL GetData(void const **data) const
    {
      if (!data || *data)
        return  Status::InvalidArgument;
      *data = Buffer.empty() ? 0 : &Buffer[0];
      return Status::Ok;
    }

// Assembly:
pushq $0x5
popq %rax
testq %rsi, %rsi
je 0x194fa
cmpq $0x0, (%rsi)
je 0x194fb
retq
movq 0x18(%rdi), %rcx
xorl %eax, %eax
cmpq 0x20(%rdi), %rcx
movl $0x0, %edx
cmovneq %rcx, %rdx
movq %rdx, (%rsi)
retq
// File: /workspace/github_cpp_makefile_star2_O2/tdv[P]boss/boss/include/common/buffer.h
// Function: Boss::RawBuffer::RawBuffer(void const*, unsigned int)::'lambda'()::operator()() const
RawBuffer(void const *data, UInt bytes)
      : Buffer([&] ()
               {
                 return !bytes ? std::move(std::vector<char>()) :
                   std::move(std::vector<char>(reinterpret_cast<char const *>(data),
                                               reinterpret_cast<char const *>(data) + bytes)); 
               } ()
              )
    {
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x50, %rsp
movq %rdi, %rbx
movq (%rsi), %rax
movl (%rax), %r15d
testq %r15, %r15
je 0x19616
movq 0x8(%rsi), %rax
movq (%rax), %rsi
leaq (%rsi,%r15), %rdx
leaq 0x10(%rsp), %r14
leaq 0xf(%rsp), %rcx
movq %r14, %rdi
callq 0x1968c
movaps (%r14), %xmm0
movq 0x10(%r14), %rax
jmp 0x19629
xorps %xmm0, %xmm0
leaq 0x30(%rsp), %r14
movaps %xmm0, (%r14)
andq $0x0, 0x10(%r14)
xorl %eax, %eax
movups %xmm0, (%rbx)
andq $0x0, 0x10(%r14)
movq %rax, 0x10(%rbx)
xorps %xmm0, %xmm0
movups %xmm0, (%r14)
testq %r15, %r15
je 0x19648
leaq 0x10(%rsp), %rdi
jmp 0x1964d
leaq 0x30(%rsp), %rdi
callq 0x19716
movq %rbx, %rax
addq $0x50, %rsp
popq %rbx
popq %r14
popq %r15
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/tdv[P]boss/boss/include/plugin/module_holder.h
// Function: Boss::ModuleHolder::SetServiceLocator(Boss::IServiceLocator*)
void SetServiceLocator(IServiceLocator *locator)
    {
      typedef RetCode (*PFNBossSetServiceLocator)(IServiceLocator *);
      auto *BossSetServiceLocator = Dll.GetProc<PFNBossSetServiceLocator>("BossSetServiceLocator");
      RefObjPtr<IServiceLocator> Inst;
      if (BossSetServiceLocator(locator) != Status::Ok)
        throw ModuleHolderException("Failed to set ServiceLocator.");
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0xa4995(%rip), %rsi     # 0xbe4b5
leaq 0x10(%rsp), %rdi
leaq 0xf(%rsp), %rdx
callq 0x8fae0
leaq 0x10(%rsp), %rsi
movq %r14, %rdi
callq 0x19c56
movq %rax, %r14
leaq 0x10(%rsp), %r15
movq %r15, %rdi
callq 0x8d160
andq $0x0, (%r15)
movq %rbx, %rdi
callq *%r14
testl %eax, %eax
jne 0x19b6e
leaq 0x10(%rsp), %rdi
callq 0x177cc
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
pushq $0x10
popq %rdi
callq 0x1a4f0
movq %rax, %r14
leaq 0xa494b(%rip), %rsi     # 0xbe4cb
movq %rax, %rdi
callq 0x19d42
leaq 0xdbfd9(%rip), %rsi     # 0xf5b68
leaq 0xa59a(%rip), %rdx      # 0x24130
movq %r14, %rdi
callq 0x1b540
movq %rax, %rbx
movq %r14, %rdi
callq 0x1a550
jmp 0x19bc2
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x8d160
jmp 0x19bcc
movq %rax, %rbx
jmp 0x19bcc
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x177cc
movq %rbx, %rdi
callq 0xbaf20
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: main
int main() {
    
    PackedMemoryArray<int> pma(2);
    
    Timer t;
    t.start();
    for(int i = 3; i < 10000000; i++) {
        pma.insert_element(i);
    }
    double time_taken = t.stop();
    std::cout << "Head Inserts: " << time_taken/10000000.0 << std::endl;
    //pma.print();

}

// Assembly:
pushq %rbp
pushq %rbx
subq $0x88, %rsp
leaq 0x20(%rsp), %rbx
pushq $0x2
popq %rsi
movq %rbx, %rdi
callq 0x1356
leaq 0x10(%rsp), %rdi
callq 0x146e
pushq $0x3
popq %rbp
cmpl $0x989680, %ebp         # imm = 0x989680
je 0x12e8
movq %rbx, %rdi
movl %ebp, %esi
callq 0x1476
incl %ebp
jmp 0x12d2
leaq 0x10(%rsp), %rdi
callq 0x149e
movsd %xmm0, 0x8(%rsp)
movq 0x4cd9(%rip), %rdi      # 0x5fd8
leaq 0x1d4a(%rip), %rsi      # 0x3050
callq 0x10c0
movsd 0x8(%rsp), %xmm0
divsd 0x1cef(%rip), %xmm0     # 0x3008
movq %rax, %rdi
callq 0x1110
movq %rax, %rdi
callq 0x1060
leaq 0x20(%rsp), %rdi
callq 0x14f2
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %rbp
retq
jmp 0x1341
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0x14f2
movq %rbx, %rdi
callq 0x1160
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::PackedMemoryArray(int)
PackedMemoryArray<E>::PackedMemoryArray(E e) : t_0(VAL_T_0), t_l(VAL_T_L), c(VAL_C) {
    // Assert that c is a power of 2 and > 1
#ifndef OPTIMIZE
    assert(c > 1 && !(c & (c-1)));
#endif
    s = 0;
    // Get the new store
    store.resize(c*1);
    // Resize the bitmask as well
    exists.resize((size_t)ceil(c));
    insert_element_at(e, 0);
    
    // One liner log2 since c is a power of 2 :-P
    int log2n = __builtin_popcount(store.size()-1);
    if(log2n & (log2n-1)) {
        // log2n is not a power of 2, round it up to the nearest power of 2.
        segment_size = (int)floor(log2(1<<(log2n+1)));
    }
    else {
        // log2n is a power of 2, so, all is fine.
        segment_size = log2n;
    }
    l = log2n - log2(segment_size);

    // Now assert that the upper thresholds are sane, and you do not go out of balance the very first time.
#ifndef OPTIMIZE
    assert(!is_too_full());
#endif
    // And we have set this thing in motion. Pray!
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
andq $0x0, 0x28(%rdi)
movl %esi, %ebp
andl $0x0, 0x30(%rdi)
leaq 0x18(%rdi), %r14
andq $0x0, 0x38(%rdi)
xorps %xmm0, %xmm0
andl $0x0, 0x20(%rdi)
movups %xmm0, (%rdi)
movups %xmm0, 0x10(%rdi)
movapd 0x1c96(%rip), %xmm0     # 0x3020
movupd %xmm0, 0x40(%rdi)
movl $0x2, 0x50(%rdi)
andl $0x0, 0x58(%rdi)
pushq $0x2
popq %rsi
callq 0x1508
movl 0x50(%rbx), %esi
movq %r14, %rdi
xorl %edx, %edx
callq 0x153a
movq %rbx, %rdi
movl %ebp, %esi
xorl %edx, %edx
callq 0x15a8
movq 0x8(%rbx), %rax
subq (%rbx), %rax
shrq $0x2, %rax
decl %eax
movl %eax, %ecx
shrl %ecx
andl $0x55555555, %ecx       # imm = 0x55555555
subl %ecx, %eax
movl $0x33333333, %ecx       # imm = 0x33333333
movl %eax, %edx
andl %ecx, %edx
shrl $0x2, %eax
andl %ecx, %eax
addl %edx, %eax
movl %eax, %ecx
shrl $0x4, %ecx
addl %eax, %ecx
andl $0xf0f0f0f, %ecx        # imm = 0xF0F0F0F
imull $0x1010101, %ecx, %r14d # imm = 0x1010101
shrl $0x18, %r14d
leal -0x1(%r14), %ecx
movl %r14d, %eax
testl %ecx, %r14d
je 0x1422
pushq $0x2
popq %rax
movl %r14d, %ecx
shll %cl, %eax
cvtsi2sd %eax, %xmm0
callq 0x1170
callq 0x1150
cvttsd2si %xmm0, %eax
movl %eax, 0x5c(%rbx)
cvtsi2sd %r14d, %xmm0
movsd %xmm0, (%rsp)
cvtsi2sd %eax, %xmm0
callq 0x1170
movsd (%rsp), %xmm1
subsd %xmm0, %xmm1
cvttsd2si %xmm1, %eax
movl %eax, 0x54(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r15
movq %r14, %rdi
callq 0x15ca
movq %rbx, %rdi
callq 0x1e36
movq %r15, %rdi
callq 0x1160
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/./include/timer.hpp
// Function: Timer::stop()
double
    stop() {
        // time_t now = time(NULL);
        // time_t diff = now - begin;
        timeval now;
        gettimeofday(&now, NULL);
        double l = begin.tv_sec * 1000000.0 + begin.tv_usec;
        double r = now.tv_sec * 1000000.0 + now.tv_usec;
        double diff = r - l;
        return diff;
    }

// Assembly:
pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rdi, %rbx
leaq 0x8(%rsp), %r14
movq %r14, %rdi
xorl %esi, %esi
callq 0x1120
cvtsi2sdq (%rbx), %xmm1
cvtsi2sdq 0x8(%rbx), %xmm0
movsd 0x1b46(%rip), %xmm2     # 0x3010
mulsd %xmm2, %xmm1
addsd %xmm0, %xmm1
cvtsi2sdq (%r14), %xmm0
cvtsi2sdq 0x8(%r14), %xmm3
mulsd %xmm2, %xmm0
addsd %xmm3, %xmm0
subsd %xmm1, %xmm0
addq $0x18, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::upper_bound(int)
int PackedMemoryArray<E>::upper_bound(E e) {
    int l = 0, r = ((int)store.size())/segment_size, pos; 
    while(l != r) {
        int m = l + (r - l + 1)/2;
        pos = upper_bound_in_segment(e, m);
        if (pos == -1) 
            r = m-1;
        else
            l = m; 
    }
    pos = upper_bound_in_segment(e, l);
    return pos;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq 0x8(%rdi), %rax
subq (%rdi), %rax
shrq $0x2, %rax
cltd
idivl 0x5c(%rdi)
movl %eax, %ebp
movl %esi, %r14d
xorl %r13d, %r13d
cmpl %ebp, %r13d
je 0x1eb4
movl %ebp, %eax
subl %r13d, %eax
incl %eax
cltd
pushq $0x2
popq %rcx
idivl %ecx
movl %eax, %r15d
leal (%r15,%r13), %r12d
movq %rbx, %rdi
movl %r14d, %esi
movl %r12d, %edx
callq 0x1f56
cmpl $-0x1, %eax
leal -0x1(%r15,%r13), %eax
cmovel %eax, %ebp
cmovel %r13d, %r12d
movl %r12d, %r13d
jmp 0x1e79
movq %rbx, %rdi
movl %r14d, %esi
movl %ebp, %edx
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x1f56
nop
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::insert_element_after(int, int, int)
void PackedMemoryArray<E>::insert_element_after(E e, E after, int pos) {
    // Find where we can insert
    int loc;
    loc = pos;
#ifndef OPTIMIZE
    assert(loc != -1);
#endif
    int insert_at = ++loc;
    // Do we have space at the location we want to insert?
    if(insert_at < (int)store.size() && !ELEM_EXISTS_AT(insert_at)) {
        // Great! Now insert it there.
        insert_element_at(e, insert_at);
        return;
    }
    // The not so nice part begins here.
    int node_index, node_level;
    if(smallest_interval_in_balance(insert_at, &node_index, &node_level) == -1) {
        // No more space left in the PMA. Resize!
        expand_PMA(e);
    }
    else {
        // Rebalance one particular level
        rebalance(node_index, node_level, e);
    }
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
subq $0x10, %rsp
movl %ecx, %ebp
movl %esi, %ebx
movq %rdi, %r14
incl %ebp
movq 0x8(%rdi), %rax
subq (%rdi), %rax
shrq $0x2, %rax
cmpl %eax, %ebp
jge 0x1f01
leaq 0x18(%r14), %rdi
movslq %ebp, %rsi
callq 0x1e08
testq %rdx, (%rax)
je 0x1f41
leaq 0xc(%rsp), %rdx
leaq 0x8(%rsp), %rcx
movq %r14, %rdi
movl %ebp, %esi
callq 0x1fbe
cmpl $-0x1, %eax
je 0x1f2e
movl 0xc(%rsp), %esi
movl 0x8(%rsp), %edx
movq %r14, %rdi
movl %ebx, %ecx
callq 0x2308
jmp 0x1f38
movq %r14, %rdi
movl %ebx, %esi
callq 0x20d6
addq $0x10, %rsp
popq %rbx
popq %r14
popq %rbp
retq
movq %r14, %rdi
movl %ebx, %esi
movl %ebp, %edx
addq $0x10, %rsp
popq %rbx
popq %r14
popq %rbp
jmp 0x15a8
nop
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::upper_bound_in_segment(int, int)
int PackedMemoryArray<E>::upper_bound_in_segment(E e, int v) {
    int best = -1;
    for(int i = v*segment_size; i < (v+1)*segment_size; i++)
        if(ELEM_EXISTS_AT(i) && store[i] <= e) 
            return best = i;
    return best;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %edx, %ebx
movl %esi, %ebp
movq %rdi, %r14
movl 0x5c(%rdi), %eax
movl %eax, %ecx
imull %edx, %ecx
incl %ebx
leaq 0x18(%rdi), %r13
movslq %ecx, %r12
pushq $-0x1
popq %r15
imull %ebx, %eax
cltq
cmpq %rax, %r12
jge 0x1fac
movq %r13, %rdi
movq %r12, %rsi
callq 0x1e08
testq %rdx, (%rax)
je 0x1fa0
movq (%r14), %rax
cmpl %ebp, (%rax,%r12,4)
jle 0x1fa9
incq %r12
movl 0x5c(%r14), %eax
jmp 0x1f7d
movl %r12d, %r15d
movl %r15d, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::smallest_interval_in_balance(int, int*, int*) const
int PackedMemoryArray<E>::smallest_interval_in_balance(int index, int * node_index, int * node_level) const {
    // If we are trying to insert at the end of the PMA
    if (index == (int)store.size()) {
        index = (int)store.size() - 1;
    }

    int level = -1;
    int start = index;
    int end = index, count = 1;
    unsigned int sz = segment_size;
    bool found = false;
    do {
        // Get the boundaries of the next interval
        int left = start - (start % sz);
        int right = left + sz;

        // Count only the necessary parts
        for(int i = left; i < start; i++)
            if(ELEM_EXISTS_AT(i))
                count++;
        for(int i = end + 1; i <= right; i++)
            if(ELEM_EXISTS_AT(i))
                count++;
        
        start = left;
        end = right;

        ++level;
        bool is_balanced = !is_out_of_balance(count + 1, level);
        // std::cout << "Level: " << level << ", from " << left << " to " << right << ", having " << count+1 << ", elements, is balanced?: " << is_balanced << ", segment_size: " << smallest_window_size << std::endl;
        // Would be able to fit another element?
        if(is_balanced) {
            found = true;
            break;
        }
        sz <<= 1;
        
    } while(sz <= store.size());
    if(!found) {
        // We did not find a balanced interval
        *node_index = *node_level = -1;
        return -1;
    }

    *node_index = start;
    *node_level = level;
    return 1;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, 0x18(%rsp)
movq %rdx, 0x10(%rsp)
movq 0x8(%rdi), %rax
subq (%rdi), %rax
shrq $0x2, %rax
leal -0x1(%rax), %ecx
cmpl %esi, %eax
cmovnel %esi, %ecx
movl 0x5c(%rdi), %r14d
leaq 0x18(%rdi), %r13
pushq $-0x1
popq %rbp
pushq $0x1
popq %r15
movq %rcx, 0x8(%rsp)
movq %rdi, 0x20(%rsp)
movl %ecx, 0x4(%rsp)
movq 0x8(%rsp), %rcx
movl %ecx, %eax
xorl %edx, %edx
divl %r14d
movslq %ecx, %r12
subl %edx, %ecx
movq %rcx, 0x8(%rsp)
movslq %ecx, %rbx
cmpq %r12, %rbx
jge 0x203a
movq %r13, %rdi
movq %rbx, %rsi
callq 0x24c2
movzbl %al, %eax
addl %eax, %r15d
incq %rbx
jmp 0x201f
movq 0x8(%rsp), %rax
addl %r14d, %eax
movslq 0x4(%rsp), %rbx
movl %eax, 0x4(%rsp)
movslq %eax, %r12
cmpq %r12, %rbx
jge 0x2069
incq %rbx
movq %r13, %rdi
movq %rbx, %rsi
callq 0x24c2
movzbl %al, %eax
addl %eax, %r15d
jmp 0x204e
incl %ebp
leal 0x1(%r15), %esi
movq 0x20(%rsp), %rbx
movq %rbx, %rdi
movl %ebp, %edx
callq 0x24e0
testb %al, %al
je 0x20b1
movq 0x8(%rbx), %rax
subq (%rbx), %rax
addl %r14d, %r14d
sarq $0x2, %rax
movl 0x4(%rsp), %ecx
cmpq %r14, %rax
jae 0x2002
movq 0x18(%rsp), %rax
orl $-0x1, (%rax)
movq 0x10(%rsp), %rax
orl $-0x1, (%rax)
pushq $-0x1
jmp 0x20c6
movq 0x10(%rsp), %rax
movq 0x8(%rsp), %rcx
movl %ecx, (%rax)
movq 0x18(%rsp), %rax
movl %ebp, (%rax)
pushq $0x1
popq %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/reddragon[P]packed-memory-array/impl1.cpp
// Function: PackedMemoryArray<int>::rebalance(int, int)
void PackedMemoryArray<E>::rebalance(int index, int level) {
#ifndef OPTIMIZE 
    assert(level <= l);
#endif
    int c = CAPACITY_AT(level);
    // Move all the elements to one side
    int last = index + c - 1, count = 0;
    for(int i = last; i >= index; i--) {
        if(ELEM_EXISTS_AT(i)) {
            if(i != last) {
                // Copy the element to the leftmost position
                insert_element_at(store[i], last);
                // Delete the original copy of the element
                #ifndef OPTIMIZE
                    delete_element_at(i);
                #else
                    exists[i] = 0;
                #endif
               // Update the leftmost pointer, and count of elements moved
            }
            --last;
            count++;
        }
    }

    // Now copy
    double k = (c*1.0)/count, p = 0;
    int actual_index = last, correct_index;
    for(int i = 0; i < count; i++) {
        p += k;
        actual_index++;
        // Now insert the element at the right position
        correct_index = index + (int)p - 1;
        if (correct_index == actual_index)
            continue;
        if(actual_index != correct_index)
            insert_element_at(store[actual_index], correct_index);
        // Remove the left most copy
#ifndef OPTIMIZE
        delete_element_at(actual_index);
#else
        exists[actual_index] = 0;
#endif
    } 
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %edx, %ecx
movq %rdi, %rbx
movl 0x5c(%rdi), %edx
shll %cl, %edx
leal -0x1(%rsi), %eax
movl %eax, 0xc(%rsp)
movq %rdx, (%rsp)
leal -0x1(%rsi,%rdx), %ebp
leaq 0x18(%rdi), %r14
movslq %ebp, %r15
movslq %esi, %r12
xorl %r13d, %r13d
cmpq %r12, %r15
jl 0x2766
movq %r14, %rdi
movq %r15, %rsi
callq 0x1e08
testq %rdx, (%rax)
je 0x2761
cmpl %ebp, %r15d
je 0x275c
movq (%rbx), %rax
movl (%rax,%r15,4), %esi
movq %rbx, %rdi
movl %ebp, %edx
callq 0x15a8
movq %r14, %rdi
movq %r15, %rsi
callq 0x1e08
notq %rdx
andq %rdx, (%rax)
decl %ebp
incl %r13d
decq %r15
jmp 0x2720
cvtsi2sdl (%rsp), %xmm1
cvtsi2sd %r13d, %xmm0
divsd %xmm0, %xmm1
movslq %ebp, %r15
xorl %ebp, %ebp
testl %r13d, %r13d
cmovgl %r13d, %ebp
incq %r15
xorpd %xmm0, %xmm0
movl 0xc(%rsp), %r12d
movsd %xmm1, 0x10(%rsp)
subl $0x1, %ebp
jb 0x27dc
addsd %xmm1, %xmm0
cvttsd2si %xmm0, %edx
addl %r12d, %edx
cmpl %edx, %r15d
je 0x27d7
movq (%rbx), %rax
movl (%rax,%r15,4), %esi
movq %rbx, %rdi
movsd %xmm0, (%rsp)
callq 0x15a8
movq %r14, %rdi
movq %r15, %rsi
callq 0x1e08
movsd (%rsp), %xmm0
movsd 0x10(%rsp), %xmm1
notq %rdx
andq %rdx, (%rax)
incq %r15
jmp 0x2792
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/main.cpp
// Function: solves_rikudo(std::basic_ifstream<char, std::char_traits<char>>&, std::basic_ofstream<char, std::char_traits<char>>&)
void solves_rikudo(std::ifstream &ifile, std::ofstream &ofile)
{
    Graph graph(ifile);

    int begin, end;
    ifile >> begin >> end;

    graph.unique_sol(begin, end, ofile);
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r14
pushq %rbx
subq $0xb0, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq -0xc0(%rbp), %rdi
movq %r14, %rsi
callq 0x33b2
leaq -0x18(%rbp), %rsi
movq %r14, %rdi
callq 0x2150
leaq -0x14(%rbp), %rsi
movq %rax, %rdi
callq 0x2150
movl -0x18(%rbp), %esi
movl -0x14(%rbp), %edx
leaq -0xc0(%rbp), %rdi
movq %rbx, %rcx
callq 0x5628
leaq -0xc0(%rbp), %rdi
callq 0x2d62
addq $0xb0, %rsp
popq %rbx
popq %r14
popq %rbp
retq
movq %rax, %rbx
leaq -0xc0(%rbp), %rdi
callq 0x2d62
movq %rbx, %rdi
callq 0x2360
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::backtracking(int, int, int, bool)
bool Graph::backtracking(int v,
                         int n,
                         int last,
                         bool count)
{
    visited[v] = true;
    path[n] = v;

    if (n == n_vertices - 1)
    {
        visited[v] = false;
        if(v == last){
            paths.push_back(path);
            return true;
        }
        
        return false;
    }

    for (int neighbor : adj_list[v])
    {
        if (!visited[neighbor] && backtracking(neighbor, n + 1, last, count) && !count)
            return true;
    }

    visited[v] = false;
    return false;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl %r8d, -0x2c(%rbp)
movl %ecx, %r14d
movl %edx, %r15d
movq %rdi, %rbx
leaq 0x50(%rdi), %r12
movslq %esi, %r13
movq %r12, %rdi
movq %r13, %rsi
callq 0x5e02
orq %rdx, (%rax)
movslq %r15d, %rax
movq 0x90(%rbx), %rcx
movl %r13d, (%rcx,%rax,4)
movl (%rbx), %ecx
decl %ecx
cmpl %eax, %ecx
jne 0x32a2
movq %r12, %rdi
movq %r13, %rsi
callq 0x5e02
notq %rdx
andq %rdx, (%rax)
cmpl %r14d, %r13d
jne 0x331f
leaq 0x90(%rbx), %rsi
addq $0x78, %rbx
movq %rbx, %rdi
callq 0x5e46
movb $0x1, %al
jmp 0x3321
movl %r14d, -0x30(%rbp)
movq %rbx, -0x40(%rbp)
movq 0x38(%rbx), %rax
movq %r13, -0x38(%rbp)
imulq $0x18, %r13, %rcx
movq (%rax,%rcx), %r13
movq 0x8(%rax,%rcx), %rbx
incl %r15d
movzbl -0x2c(%rbp), %eax
movl %eax, -0x2c(%rbp)
cmpq %rbx, %r13
je 0x330d
movl (%r13), %r14d
movslq %r14d, %rsi
movq %r12, %rdi
callq 0x5e02
testq %rdx, (%rax)
jne 0x3307
movq -0x40(%rbp), %rdi
movl %r14d, %esi
movl %r15d, %edx
movl -0x30(%rbp), %ecx
movl -0x2c(%rbp), %r14d
movl %r14d, %r8d
callq 0x3228
xorb $0x1, %al
movl %r14d, %ecx
orb %al, %cl
cmpb $0x1, %cl
jne 0x329e
addq $0x4, %r13
jmp 0x32c9
movq %r12, %rdi
movq -0x38(%rbp), %rsi
callq 0x5e02
notq %rdx
andq %rdx, (%rax)
xorl %eax, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::valid(std::vector<int, std::allocator<int>> const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>> const&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>> const&)
bool Graph::valid(const std::vector<int> &candidate,
                  const std::vector< std::pair<int,int> >& map,
                  const std::vector< std::pair<int,int> >& diamonds)
{    
    for(auto pair : map){
        int ith = pair.first;
        int vertex = pair.second;
        if(candidate[ith] != vertex)    return false;
    }

    for(auto pair : diamonds){
        int u = pair.first;
        int v = pair.second;
        for(int ith = 0; ith < candidate.size(); ith++)
            if(candidate[ith] == u){
                if(ith > 0 && candidate[ith-1] == v)    continue;
                if(ith < candidate.size() - 1 && candidate[ith+1] == v) continue;
                return false;
            }
    }

    return true;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
movq (%rdx), %rdi
movq 0x8(%rdx), %rdx
movq (%rsi), %rax
cmpq %rdx, %rdi
je 0x335b
movslq (%rdi), %r8
movl (%rax,%r8,4), %r8d
leaq 0x8(%rdi), %r9
cmpl 0x4(%rdi), %r8d
movq %r9, %rdi
je 0x333e
xorl %eax, %eax
popq %rbp
retq
movq (%rcx), %rdx
movq 0x8(%rcx), %rcx
movq 0x8(%rsi), %rsi
subq %rax, %rsi
sarq $0x2, %rsi
leaq -0x1(%rsi), %rdi
cmpq %rcx, %rdx
je 0x33ae
movl (%rdx), %r8d
movl 0x4(%rdx), %r9d
xorl %r10d, %r10d
cmpq %r10, %rsi
je 0x33a8
cmpl %r8d, (%rax,%r10,4)
jne 0x33a3
testq %r10, %r10
je 0x3397
cmpl %r9d, -0x4(%rax,%r10,4)
je 0x33a3
cmpq %r10, %rdi
jbe 0x3357
cmpl %r9d, 0x4(%rax,%r10,4)
jne 0x3357
incq %r10
jmp 0x3380
addq $0x8, %rdx
jmp 0x3371
movb $0x1, %al
jmp 0x3359
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::Graph(std::basic_ifstream<char, std::char_traits<char>>&)
Graph::Graph(std::ifstream &file)
{
    int n_vertices;
    file >> n_vertices;

    if(n_vertices <= 0)
        throw "Number of vertices should be a positive integer.";

    this->n_vertices = n_vertices;
    adj_list.assign(static_cast<unsigned long>(n_vertices), std::vector<int>());

    while (true)
    {
        int a, b;
        file >> a;
        if (a < 0)
            break;
        file >> b;

        if(a >= n_vertices || b < 0 || b >= n_vertices)
            throw "Invalid vertex index";

        adj_list[a].push_back(b);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdi, %rbx
andq $0x0, 0x60(%rdi)
movq %rsi, %r15
andl $0x0, 0x68(%rdi)
leaq 0x38(%rdi), %r14
xorps %xmm0, %xmm0
movups %xmm0, 0x8(%rdi)
movups %xmm0, 0x18(%rdi)
movups %xmm0, 0x28(%rdi)
andl $0x0, 0x58(%rdi)
movups %xmm0, 0x38(%rdi)
movups %xmm0, 0x48(%rdi)
movups %xmm0, 0x70(%rdi)
movups %xmm0, 0x80(%rdi)
movups %xmm0, 0x90(%rdi)
andq $0x0, 0xa0(%rdi)
leaq -0x2c(%rbp), %rsi
movq %r15, %rdi
callq 0x2150
movslq -0x2c(%rbp), %rsi
testq %rsi, %rsi
jle 0x34c4
movl %esi, (%rbx)
xorps %xmm0, %xmm0
leaq -0x60(%rbp), %rdx
movaps %xmm0, (%rdx)
andq $0x0, 0x10(%rdx)
movq %r14, %rdi
callq 0x66e8
leaq -0x60(%rbp), %r12
movq %r12, %rdi
callq 0x2e04
leaq -0x3c(%rbp), %r13
movq %r15, %rdi
movq %r12, %rsi
callq 0x2150
cmpl $0x0, -0x60(%rbp)
js 0x3490
movq %r15, %rdi
movq %r13, %rsi
callq 0x2150
movslq -0x60(%rbp), %rax
movl -0x2c(%rbp), %ecx
cmpl %ecx, %eax
jge 0x349f
movl -0x3c(%rbp), %edx
testl %edx, %edx
js 0x349f
cmpl %ecx, %edx
jge 0x349f
imulq $0x18, %rax, %rdi
addq (%r14), %rdi
movq %r13, %rsi
callq 0x5e82
jmp 0x344d
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
pushq $0x8
popq %rdi
callq 0x2120
leaq 0x4c61(%rip), %rcx      # 0x810f
movq %rcx, (%rax)
movq 0x8b08(%rip), %rsi      # 0xbfc0
movq %rax, %rdi
xorl %edx, %edx
callq 0x2340
jmp 0x34e7
pushq $0x8
popq %rdi
callq 0x2120
leaq 0x4c0b(%rip), %rcx      # 0x80de
movq %rcx, (%rax)
movq 0x8ae3(%rip), %rsi      # 0xbfc0
movq %rax, %rdi
xorl %edx, %edx
callq 0x2340
movq %rax, -0x38(%rbp)
leaq -0x60(%rbp), %rdi
callq 0x2e04
jmp 0x34fe
jmp 0x34fa
jmp 0x34fa
movq %rax, -0x38(%rbp)
leaq 0x8(%rbx), %r12
leaq 0x90(%rbx), %rdi
leaq 0x78(%rbx), %r13
leaq 0x50(%rbx), %r15
addq $0x20, %rbx
callq 0x2e04
movq %r13, %rdi
callq 0x2d36
movq %r15, %rdi
callq 0x2dae
movq %r14, %rdi
callq 0x2d36
movq %rbx, %rdi
callq 0x2e04
movq %r12, %rdi
callq 0x2e04
movq -0x38(%rbp), %rdi
callq 0x2360
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition1(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition1(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;

     // every vertex visited
    for(int i = 0; i < n_vertices; i++){
        clause.clear();
        for(int j = 0; j < n_vertices; j++){
            int id = encode(j, i);
            clause.push_back(id);
        }
        clauses.push_back(clause);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, -0x58(%rbp)
movq %rdi, %r14
leaq -0x50(%rbp), %r15
andq $0x0, 0x10(%r15)
xorps %xmm0, %xmm0
movaps %xmm0, (%r15)
xorl %r13d, %r13d
leaq -0x2c(%rbp), %r12
movl (%r14), %eax
cmpl %eax, %r13d
jge 0x36b9
movq -0x50(%rbp), %rcx
cmpq %rcx, -0x48(%rbp)
je 0x3687
movq %rcx, -0x48(%rbp)
incl %r13d
xorl %ebx, %ebx
cmpl %eax, %ebx
jge 0x36ab
imull %ebx, %eax
addl %r13d, %eax
movl %eax, -0x2c(%rbp)
movq %r15, %rdi
movq %r12, %rsi
callq 0x5e82
incl %ebx
movl (%r14), %eax
jmp 0x368c
movq -0x58(%rbp), %rdi
movq %r15, %rsi
callq 0x5e46
jmp 0x3671
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x36d3
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition2(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition2(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;
    for(int i = 0; i < n_vertices; i++){
        for(int j = 0; j < n_vertices; j++){
            for(int k = j + 1; k < n_vertices; k++){
                clause.clear();
                int id_1 = -encode(j, i);
                int id_2 = -encode(k, i);
                clause.push_back(id_1);
                clause.push_back(id_2);
                clauses.push_back(clause);                
            }
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, -0x58(%rbp)
movq %rdi, %r14
xorps %xmm0, %xmm0
leaq -0x50(%rbp), %r15
movaps %xmm0, (%r15)
andq $0x0, 0x10(%r15)
movl (%rdi), %eax
xorl %r12d, %r12d
cmpl %eax, %r12d
jge 0x379e
movl %r12d, -0x2c(%rbp)
notl %r12d
xorl %r13d, %r13d
cmpl %eax, %r13d
jge 0x3792
leal 0x1(%r13), %ebx
movl %ebx, -0x30(%rbp)
cmpl %eax, %ebx
jge 0x378a
movq -0x50(%rbp), %rcx
cmpq %rcx, -0x48(%rbp)
je 0x3746
movq %rcx, -0x48(%rbp)
movl %eax, %ecx
imull %r13d, %ecx
movl %r12d, %edx
subl %ecx, %edx
movl %edx, -0x38(%rbp)
imull %ebx, %eax
movl %r12d, %ecx
subl %eax, %ecx
movl %ecx, -0x34(%rbp)
movq %r15, %rdi
leaq -0x38(%rbp), %rsi
callq 0x5e82
movq %r15, %rdi
leaq -0x34(%rbp), %rsi
callq 0x5e82
movq -0x58(%rbp), %rdi
movq %r15, %rsi
callq 0x5e46
incl %ebx
movl (%r14), %eax
jmp 0x3734
movl -0x30(%rbp), %ecx
movl %ecx, %r13d
jmp 0x3728
movl -0x2c(%rbp), %r12d
incl %r12d
jmp 0x3715
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition3(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition3(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;

    for(int i = 0; i < n_vertices; i++){
        clause.clear();
        for(int j = 0; j < n_vertices; j++){
            int id = encode(i, j);
            clause.push_back(id);
        }
        clauses.push_back(clause);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, -0x58(%rbp)
movq %rdi, %r14
xorps %xmm0, %xmm0
leaq -0x50(%rbp), %r15
andq $0x0, 0x10(%r15)
movaps %xmm0, (%r15)
xorl %r13d, %r13d
leaq -0x2c(%rbp), %r12
movl (%r14), %eax
cmpl %eax, %r13d
jge 0x3847
movq -0x50(%rbp), %rcx
cmpq %rcx, -0x48(%rbp)
je 0x380f
movq %rcx, -0x48(%rbp)
pushq $0x1
popq %rcx
movl %ecx, %ebx
leal -0x1(%rbx), %ecx
cmpl %eax, %ecx
jge 0x3836
imull %r13d, %eax
addl %ebx, %eax
movl %eax, -0x2c(%rbp)
movq %r15, %rdi
movq %r12, %rsi
callq 0x5e82
movl (%r14), %eax
incl %ebx
jmp 0x3814
movq -0x58(%rbp), %rdi
movq %r15, %rsi
callq 0x5e46
incl %r13d
jmp 0x37f9
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x3861
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition4(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition4(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;
    for(int i = 0; i < n_vertices; i++){
        for(int j = 0; j < n_vertices; j++){
            for(int k = j+1; k < n_vertices; k++){
                clause.clear();
                int id_1 = -encode(i, j);
                int id_2 = -encode(i, k);
                clause.push_back(id_1);
                clause.push_back(id_2);
                clauses.push_back(clause); 
            }
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, -0x70(%rbp)
leaq -0x60(%rbp), %r15
andq $0x0, 0x10(%r15)
xorps %xmm0, %xmm0
movaps %xmm0, (%r15)
movq %rdi, -0x68(%rbp)
movl (%rdi), %eax
movl $0x0, -0x2c(%rbp)
xorl %r13d, %r13d
cmpl %eax, %r13d
jge 0x3944
xorl %r12d, %r12d
pushq $-0x2
popq %r14
cmpl %eax, %r12d
jge 0x3939
movl %r12d, %ebx
notl %ebx
incl %r12d
movl %r14d, -0x30(%rbp)
movl %r12d, -0x34(%rbp)
cmpl %eax, %r12d
jge 0x392c
movq -0x60(%rbp), %rcx
cmpq %rcx, -0x58(%rbp)
je 0x38e3
movq %rcx, -0x58(%rbp)
movl -0x2c(%rbp), %ecx
imull %eax, %ecx
imull %r13d, %eax
movl %ebx, %edx
subl %eax, %edx
movl %edx, -0x3c(%rbp)
addl %r14d, %ecx
movl %ecx, -0x38(%rbp)
movq %r15, %rdi
leaq -0x3c(%rbp), %rsi
callq 0x5e82
movq %r15, %rdi
leaq -0x38(%rbp), %rsi
callq 0x5e82
movq -0x70(%rbp), %rdi
movq %r15, %rsi
callq 0x5e46
movq -0x68(%rbp), %rax
movl (%rax), %eax
decl %r14d
incl %r12d
jmp 0x38d0
movl -0x30(%rbp), %r14d
decl %r14d
movl -0x34(%rbp), %r12d
jmp 0x38bb
incl %r13d
decl -0x2c(%rbp)
jmp 0x38ab
leaq -0x60(%rbp), %rdi
callq 0x2e04
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq -0x60(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition5(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition5(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;
    for (int ith = 0; ith < n_vertices - 1; ith++)
    {
        for (int vertex = 0; vertex < n_vertices; vertex++)
        {
            int var_id = encode(ith, vertex);
            clause.clear();
            clause.push_back(-var_id);
            for (int neighbor : adj_list[vertex])
            {
                int neighbor_id = encode(ith + 1, neighbor);
                clause.push_back(neighbor_id);
            }
            clauses.push_back(clause);
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, -0x58(%rbp)
movq %rdi, %r14
xorps %xmm0, %xmm0
leaq -0x50(%rbp), %rax
andq $0x0, 0x10(%rax)
movq %rax, %r12
movaps %xmm0, (%rax)
movl (%rdi), %eax
xorl %r15d, %r15d
decl %eax
cmpl %eax, %r15d
jge 0x3a4a
leal 0x1(%r15), %ebx
xorl %r13d, %r13d
movq %r15, -0x60(%rbp)
movslq (%r14), %rax
cmpq %rax, %r13
jge 0x3a42
movq -0x50(%rbp), %rcx
cmpq %rcx, -0x48(%rbp)
je 0x39cf
movq %rcx, -0x48(%rbp)
imull %r15d, %eax
movl %r13d, %ecx
notl %ecx
subl %eax, %ecx
movl %ecx, -0x2c(%rbp)
movq %r12, %rdi
leaq -0x2c(%rbp), %rsi
callq 0x3044
movq 0x38(%r14), %rax
imulq $0x18, %r13, %rcx
incq %r13
movq %r13, -0x68(%rbp)
movq (%rax,%rcx), %r13
movq 0x8(%rax,%rcx), %r15
cmpq %r15, %r13
je 0x3a29
movl (%r13), %eax
movl (%r14), %ecx
imull %ebx, %ecx
addl %ecx, %eax
incl %eax
movl %eax, -0x2c(%rbp)
movq %r12, %rdi
leaq -0x2c(%rbp), %rsi
callq 0x5e82
addq $0x4, %r13
jmp 0x3a01
movq -0x58(%rbp), %rdi
movq %r12, %rsi
callq 0x5e46
movq -0x60(%rbp), %r15
movq -0x68(%rbp), %r13
jmp 0x39b5
movl %ebx, %r15d
jmp 0x399f
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x3a66
jmp 0x3a66
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition6(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>> const&)
void Graph::condition6(std::vector< std::vector<int> >& clauses,
    const std::vector< std::pair<int,int> >& map)
{
    std::vector<int> clause;
    for(auto ith_vertex : map){
        clause.clear();
        int var_id = encode(ith_vertex.first, ith_vertex.second);
        clauses.push_back(clause);
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x20, %rsp
movq %rsi, %rbx
leaq -0x40(%rbp), %r14
andq $0x0, 0x10(%r14)
xorps %xmm0, %xmm0
movaps %xmm0, (%r14)
movq (%rdx), %r15
movq 0x8(%rdx), %r12
cmpq %r12, %r15
je 0x3ac7
movq -0x40(%rbp), %rax
cmpq %rax, -0x38(%rbp)
je 0x3ab6
movq %rax, -0x38(%rbp)
movq %rbx, %rdi
movq %r14, %rsi
callq 0x5e46
addq $0x8, %r15
jmp 0x3aa3
leaq -0x40(%rbp), %rdi
callq 0x2e04
addq $0x20, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq -0x40(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition7(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>> const&)
void Graph::condition7(std::vector< std::vector<int> >& clauses,
    const std::vector< std::pair<int,int> >& diamonds)
{
    std::vector<int> clause;
    for(auto vi_vj : diamonds){
        for(int ith = 0; ith < n_vertices; ith++){
            clause.clear();

            int vi_id = encode(ith, vi_vj.first);
            clause.push_back(-vi_id);
            if(ith > 0){
                int vj_id = encode(ith-1, vi_vj.second);
                clause.push_back(vj_id);
            }
            if(ith < n_vertices-1){
                int vj_id = encode(ith+1, vi_vj.second);
                clause.push_back(vj_id);
            }
            clauses.push_back(clause);
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, -0x68(%rbp)
movq %rdi, %r14
xorps %xmm0, %xmm0
leaq -0x50(%rbp), %r15
andq $0x0, 0x10(%r15)
movaps %xmm0, (%r15)
movq (%rdx), %rax
movq 0x8(%rdx), %rcx
movq %rcx, -0x58(%rbp)
cmpq -0x58(%rbp), %rax
je 0x3bd3
movl (%rax), %r13d
movq %rax, -0x60(%rbp)
movl 0x4(%rax), %ebx
notl %r13d
incl %ebx
xorl %r12d, %r12d
movl (%r14), %eax
cmpl %eax, %r12d
jge 0x3bc6
movq -0x50(%rbp), %rcx
cmpq %rcx, -0x48(%rbp)
je 0x3b57
movq %rcx, -0x48(%rbp)
imull %r12d, %eax
movl %r13d, %ecx
subl %eax, %ecx
movl %ecx, -0x2c(%rbp)
movq %r15, %rdi
leaq -0x2c(%rbp), %rsi
callq 0x3044
testl %r12d, %r12d
je 0x3b8e
leal -0x1(%r12), %eax
imull (%r14), %eax
addl %ebx, %eax
movl %eax, -0x2c(%rbp)
movq %r15, %rdi
leaq -0x2c(%rbp), %rsi
callq 0x5e82
movl (%r14), %eax
leal -0x1(%rax), %ecx
cmpl %ecx, %r12d
jge 0x3bb2
leal 0x1(%r12), %ecx
imull %ecx, %eax
addl %ebx, %eax
movl %eax, -0x2c(%rbp)
movq %r15, %rdi
leaq -0x2c(%rbp), %rsi
callq 0x5e82
movq -0x68(%rbp), %rdi
movq %r15, %rsi
callq 0x5e46
incl %r12d
jmp 0x3b41
movq -0x60(%rbp), %rax
addq $0x8, %rax
jmp 0x3b25
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x3bf1
jmp 0x3bf1
jmp 0x3bf1
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
nop
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition8(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition8(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;
    for(int i = 0; i < n_vertices; i++){
        for(int j = 0; j < n_vertices; j++){
            for(int k = 0; k < n_vertices; k++){
                if(i == j || i == k || j == k)    continue;
                int v1 = -encode(i, j, true);
                int v2 = -encode(j, k, true);
                int v3 = encode(i, k, true);
                clause.clear();
                clause.push_back(v1);
                clause.push_back(v2);
                clause.push_back(v3);
                clauses.push_back(clause);
            }
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, -0x70(%rbp)
leaq -0x60(%rbp), %r13
andq $0x0, 0x10(%r13)
xorps %xmm0, %xmm0
movaps %xmm0, (%r13)
movq %rdi, -0x68(%rbp)
movl (%rdi), %eax
movq $0x0, -0x30(%rbp)
xorl %r12d, %r12d
cmpl %eax, %r12d
jge 0x3d1e
xorl %ebx, %ebx
xorl %r14d, %r14d
cmpl %eax, %r14d
jge 0x3d0c
movl %r14d, %ecx
notl %ecx
movl %ecx, -0x34(%rbp)
xorl %r15d, %r15d
incl %r15d
leal -0x1(%r15), %ecx
cmpl %eax, %ecx
jge 0x3d02
leal (%rbx,%r15), %ecx
cmpl $0x1, %ecx
je 0x3c5f
cmpl %r14d, %r12d
je 0x3c5f
movq -0x30(%rbp), %rcx
addl %r15d, %ecx
cmpl $0x1, %ecx
je 0x3c5f
movl %eax, %ecx
imull %r12d, %ecx
movl %eax, %edx
imull %eax, %edx
addl %ecx, %edx
movl -0x34(%rbp), %ecx
subl %edx, %ecx
movl %ecx, -0x40(%rbp)
leal (%r14,%rax), %ecx
imull %eax, %ecx
addl %r15d, %ecx
negl %ecx
movl %ecx, -0x3c(%rbp)
leal (%r12,%rax), %ecx
imull %eax, %ecx
addl %r15d, %ecx
movl %ecx, -0x38(%rbp)
movq -0x60(%rbp), %rax
cmpq %rax, -0x58(%rbp)
je 0x3cc7
movq %rax, -0x58(%rbp)
movq %r13, %rdi
leaq -0x40(%rbp), %rsi
callq 0x5e82
movq %r13, %rdi
leaq -0x3c(%rbp), %rsi
callq 0x5e82
movq %r13, %rdi
leaq -0x38(%rbp), %rsi
callq 0x5e82
movq -0x70(%rbp), %rdi
movq %r13, %rsi
callq 0x5e46
movq -0x68(%rbp), %rax
movl (%rax), %eax
jmp 0x3c5f
incl %r14d
decl %ebx
jmp 0x3c4b
incl %r12d
movq -0x30(%rbp), %rcx
decl %ecx
movq %rcx, -0x30(%rbp)
jmp 0x3c3d
leaq -0x60(%rbp), %rdi
callq 0x2e04
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
leaq -0x60(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360
// File: /workspace/github_cpp_makefile_star2_O2/cauimsouza[P]rikudo-solver/src/rikudo_solver/graph.cpp
// Function: Graph::condition9(std::vector<std::vector<int, std::allocator<int>>, std::allocator<std::vector<int, std::allocator<int>>>>&)
void Graph::condition9(std::vector< std::vector<int> >& clauses){
    std::vector<int> clause;
    for(int i = 0; i < n_vertices; i++){
        for(int j = 0; j < n_vertices; j++){
            if(i == j)  continue;
            int v1 = encode(i, j, true);
            int v2 = encode(j, i, true);
            clause.clear();
            clause.push_back(v1);
            clause.push_back(v2);
            clauses.push_back(clause);
            clause.clear();
            clause.push_back(-v1);
            clause.push_back(-v2);
            clauses.push_back(clause);
        }
    }
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, -0x58(%rbp)
leaq -0x50(%rbp), %r12
andq $0x0, 0x10(%r12)
xorps %xmm0, %xmm0
movaps %xmm0, (%r12)
movq %rdi, -0x60(%rbp)
movl (%rdi), %eax
xorl %r13d, %r13d
xorl %r14d, %r14d
cmpl %eax, %r14d
jge 0x3e50
leal 0x1(%r14), %ecx
movl %ecx, -0x2c(%rbp)
xorl %ebx, %ebx
incl %ebx
leal -0x1(%rbx), %ecx
cmpl %eax, %ecx
jge 0x3e42
leal (%rbx,%r13), %edx
cmpl $0x1, %edx
je 0x3d8f
movl %eax, %edx
imull %eax, %edx
leal (%r14,%rax), %esi
imull %eax, %esi
addl %ebx, %esi
movl %esi, -0x38(%rbp)
imull %eax, %ecx
addl -0x2c(%rbp), %edx
addl %ecx, %edx
movl %edx, -0x34(%rbp)
movq -0x50(%rbp), %rax
cmpq %rax, -0x48(%rbp)
je 0x3dcf
movq %rax, -0x48(%rbp)
movq %r12, %rdi
leaq -0x38(%rbp), %rsi
callq 0x5e82
movq %r12, %rdi
leaq -0x34(%rbp), %rsi
callq 0x5e82
movq -0x58(%rbp), %rdi
movq %r12, %rsi
callq 0x5e46
movq -0x50(%rbp), %rax
cmpq %rax, -0x48(%rbp)
je 0x3e01
movq %rax, -0x48(%rbp)
xorl %eax, %eax
subl -0x38(%rbp), %eax
movl %eax, -0x30(%rbp)
movq %r12, %rdi
leaq -0x30(%rbp), %r15
movq %r15, %rsi
callq 0x3044
xorl %eax, %eax
subl -0x34(%rbp), %eax
movl %eax, -0x30(%rbp)
movq %r12, %rdi
movq %r15, %rsi
callq 0x3044
movq -0x58(%rbp), %rdi
movq %r12, %rsi
callq 0x5e46
movq -0x60(%rbp), %rax
movl (%rax), %eax
jmp 0x3d8f
decl %r13d
movl -0x2c(%rbp), %ecx
movl %ecx, %r14d
jmp 0x3d7d
leaq -0x50(%rbp), %rdi
callq 0x2e04
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x3e6c
jmp 0x3e6c
movq %rax, %rbx
leaq -0x50(%rbp), %rdi
callq 0x2e04
movq %rbx, %rdi
callq 0x2360