LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: bool Graph::gatherNeighborsWithRemoved<std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int>>, std::vector<unsigned int, std::allocator<unsigned int>>>(unsigned int const&, std::set<unsigned int, std::less<unsigned int>, std::allocator<unsigned int>>&, std::vector<unsigned int, std::allocator<unsigned int>>&) const
bool gatherNeighborsWithRemoved(const uint32_t &node, Container &neighbors, ContainerRemoved &removedNeighbors) const {
        uint32_t pos = (!mapping ? node : idToPos->at(node));
        uint32_t nextNodeOffset = (pos == nodeIndex.size()-1 ? edgeBuffer->size() : nodeIndex[pos+1].offset);
        for (uint32_t offset = nodeIndex[pos].offset ; offset < nextNodeOffset ; offset++) {
            uint32_t nPos = (!mapping ? (*edgeBuffer)[offset] : idToPos->at((*edgeBuffer)[offset]));
            if (!nodeIndex[nPos].removed) {
                neighbors.insert(neighbors.end(), (*edgeBuffer)[offset]);
            } else {
                removedNeighbors.insert(removedNeighbors.end(), (*edgeBuffer)[offset]);
            }
        }
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rcx, %rbx
movq %rdx, %r14
movq %rdi, %r15
cmpb $0x1, 0x3c(%rdi)
jne 0xcbc4
movq 0x40(%r15), %rdi
callq 0xda16
movq %rax, %rsi
movl (%rsi), %eax
movq (%r15), %rcx
leaq (%rax,%rax,2), %rax
movl (%rcx,%rax,4), %ebp
leaq 0x8(%r14), %r12
shlq $0x2, %rbp
movq %rsp, %r13
cmpb $0x0, 0x3c(%r15)
je 0xcbf7
movq 0x18(%r15), %rax
movq 0x40(%r15), %rdi
movq (%rax), %rsi
addq %rbp, %rsi
callq 0xda16
jmp 0xcc01
movq 0x18(%r15), %rax
movq (%rax), %rax
addq %rbp, %rax
movl (%rax), %eax
movq (%r15), %rcx
leaq (%rax,%rax,2), %rax
cmpb $0x0, 0x8(%rcx,%rax,4)
je 0xcc29
movq 0x8(%rbx), %rsi
movq 0x18(%r15), %rax
movq (%rax), %rdx
addq %rbp, %rdx
movq %rbx, %rdi
callq 0xe49a
jmp 0xcc45
movq 0x18(%r15), %rax
movq (%rax), %rdx
addq %rbp, %rdx
movq %r14, (%rsp)
movq %r14, %rdi
movq %r12, %rsi
movq %r13, %rcx
callq 0xd32e
addq $0x4, %rbp
jmp 0xcbdb
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: Graph::getFirstValidNeighborOffset(unsigned int const&) const
uint32_t getFirstValidNeighborOffset(const uint32_t &pos) const {
        bool validNeighbor = false;
        uint32_t offset = nodeIndex[pos].offset;
        uint32_t nextNodeOffset = (pos == nodeIndex.size()-1 ? edgeBuffer->size() : nodeIndex[pos+1].offset);
        for ( ; offset < nextNodeOffset ; offset++) {
            uint32_t nPos = (!mapping ? (*edgeBuffer)[offset] : idToPos->at((*edgeBuffer)[offset]));
            if (!nodeIndex[nPos].removed) {
                validNeighbor = true;
                break;
            }
        }
        return (validNeighbor ? offset : NONE);
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdi, %rbx
movl (%rsi), %eax
movq (%rdi), %rcx
movq 0x8(%rdi), %rdx
leaq (%rax,%rax,2), %rsi
movl (%rcx,%rsi,4), %r14d
subq %rcx, %rdx
sarq $0x2, %rdx
movabsq $-0x5555555555555555, %rsi # imm = 0xAAAAAAAAAAAAAAAB
imulq %rdx, %rsi
decq %rsi
cmpq %rax, %rsi
jne 0xcf24
movq 0x18(%rbx), %rax
movq 0x8(%rax), %rcx
subq (%rax), %rcx
shrq $0x2, %rcx
jmp 0xcf2d
incl %eax
leaq (%rax,%rax,2), %rax
movl (%rcx,%rax,4), %ecx
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmpl %ecx, %r14d
jae 0xcfa5
movl %ecx, %r15d
leaq (,%r14,4), %r12
xorl %ebp, %ebp
cmpb $0x0, 0x3c(%rbx)
je 0xcf5f
movq 0x18(%rbx), %rax
movq 0x40(%rbx), %rdi
movq (%rax), %rsi
addq %r12, %rsi
callq 0xda16
jmp 0xcf69
movq 0x18(%rbx), %rax
movq (%rax), %rax
addq %r12, %rax
movl (%rax), %eax
movq (%rbx), %rcx
leaq (%rax,%rax,2), %rax
movb 0x8(%rcx,%rax,4), %al
testb %al, %al
jne 0xcf81
movl $0x1, %ebp
jmp 0xcf85
movzbl %bpl, %ebp
cmpb $0x1, %al
jne 0xcf98
incq %r14
addq $0x4, %r12
cmpq %r14, %r15
jne 0xcf44
movl %r15d, %r14d
testb $0x1, %bpl
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
cmovnel %r14d, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::run(unsigned int const&)
void Reductions::run(const uint32_t &theta) {
    if (!graph.nodeIndex.size()) {
        return;
    }
    switch(theta) {
        case 8:
        case 7:
        case 6:
            reduce6(theta);
            break;
        case 5:
            reduce5(theta);
            break;
        case 4:
            reduce4(theta);
            break;
        case 3:
            reduce3(theta);
            break;
        default:
            assert(false);
    }
}

// Assembly:
pushq %rax
movq (%rdi), %rax
movq 0x8(%rax), %rcx
cmpq (%rax), %rcx
je 0xfced
movl (%rsi), %eax
leal -0x6(%rax), %ecx
cmpl $0x3, %ecx
jae 0xfcef
popq %rax
jmp 0xfd2e
popq %rax
retq
cmpl $0x5, %eax
jne 0xfcfa
popq %rax
jmp 0xfe4c
cmpl $0x3, %eax
je 0xfd09
cmpl $0x4, %eax
jne 0xfd0e
callq 0xff84
callq 0x10034
leaq 0xabb6(%rip), %rdi      # 0x1a8cb
leaq 0xabb5(%rip), %rsi      # 0x1a8d1
leaq 0xabc1(%rip), %rcx      # 0x1a8e4
movl $0x21, %edx
callq 0x2110
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce6(unsigned int const&)
void Reductions::reduce6(const uint32_t &theta) {
    bool firstTime = true;
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        removeUnconfinedNodes();
    } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
xorl %r12d, %r12d
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movl $0x1, %r13d
movq %r13, 0x8(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %r12
movq %rax, (%r12)
leaq 0x7(%rsp), %r13
movq %rbx, %rdi
callq 0x100b8
movb $0x0, 0x7(%rsp)
movq %rbx, %rdi
movq %r14, %rsi
movq %r15, %rdx
movq %r12, %rcx
movq %r13, %r8
callq 0x100f6
testb %al, %al
jne 0xfdc2
movq 0x10(%rsp), %r15
testq %r15, %r15
je 0xfe01
movq %r15, %rdi
callq 0xcff8
movq %r15, %rdi
callq 0x21a0
movq 0x8(%rsp), %r15
testq %r15, %r15
je 0xfe1b
movq %r15, %rdi
callq 0xcff8
movq %r15, %rdi
callq 0x21a0
movq %rbx, %rdi
callq 0x101a6
movq %rbx, %rdi
movq %r14, %rsi
callq 0x104bc
movq (%rbx), %rdi
addq $0x10, %rbx
movq %rbx, %rsi
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2fa4
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce5(unsigned int const&)
void Reductions::reduce5(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            removeUnconfinedNodes();
        } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
    } while (removeShortFunnels(theta));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
xorl %r12d, %r12d
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movl $0x1, %r13d
movq %r13, 0x8(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %r12
movq %rax, (%r12)
leaq 0x7(%rsp), %r13
movq %rbx, %rdi
callq 0x100b8
movb $0x0, 0x7(%rsp)
movq %rbx, %rdi
movq %r14, %rsi
movq %r15, %rdx
movq %r12, %rcx
movq %r13, %r8
callq 0x100f6
testb %al, %al
jne 0xfee0
movq %rbx, %rdi
movq %r14, %rsi
callq 0x10898
testb %al, %al
jne 0xfee0
movq 0x10(%rsp), %r15
testq %r15, %r15
je 0xff2e
movq %r15, %rdi
callq 0xcff8
movq %r15, %rdi
callq 0x21a0
movq 0x8(%rsp), %r15
testq %r15, %r15
je 0xff48
movq %r15, %rdi
callq 0xcff8
movq %r15, %rdi
callq 0x21a0
movq %rbx, %rdi
callq 0x101a6
movq %rbx, %rdi
movq %r14, %rsi
callq 0x10fe0
movq %rbx, %rdi
movq %r14, %rsi
callq 0x104bc
movq (%rbx), %rdi
addq $0x10, %rbx
movq %rbx, %rsi
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x2fa4
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce4(unsigned int const&)
void Reductions::reduce4(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            do {
                do {
                    foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes);
                } while (removeDominatedNodes(theta));
            } while (removeUnconfinedNodes());
        } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes, true));
    } while (removeShortFunnels(theta));
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, %rbx
movq %rdi, %r14
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
xorl %r12d, %r12d
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movl $0x1, %r13d
movq %r13, 0x8(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x10(%rsp), %r15
movq %rax, (%r15)
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
movq %r12, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r13, 0x8(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
leaq 0x8(%rsp), %rcx
movq %rax, (%rcx)
leaq 0x7(%rsp), %r8
movb $0x0, (%r8)
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x100f6
movq %r14, %rdi
movq %rbx, %rsi
callq 0x11838
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::reduce3(unsigned int const&)
void Reductions::reduce3(const uint32_t &theta) {
    unordered_set<uint32_t> *oldCandidateNodes = new unordered_set<uint32_t>();
    unordered_set<uint32_t> *newCandidateNodes = new unordered_set<uint32_t>();
    do {
        do {
            do {
                do {
                    do {
                        removeDominatedNodes(theta);
                    } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes));
                } while (removeUnconfinedNodes());
            } while (foldCompleteKIndependentSets(theta, &oldCandidateNodes, &newCandidateNodes, true));
        } while (removeShortFunnels(theta));
    } while (removeDesks());
    delete oldCandidateNodes;
    delete newCandidateNodes;
    buildCC();
    removeEasyInstances(theta);
    removeLineGraphs(theta);
    graph.rebuild(reduceInfo);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
xorl %r15d, %r15d
movq %r15, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movl $0x1, %r12d
movq %r12, 0x8(%rax)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
movl $0x38, %edi
callq 0x21e0
xorps %xmm0, %xmm0
movaps %xmm0, (%rax)
movaps %xmm0, 0x20(%rax)
movq %r15, 0x30(%rax)
movaps %xmm0, 0x10(%rax)
leaq 0x30(%rax), %rcx
movq %rcx, (%rax)
movq %r12, 0x8(%rax)
movl %ebp, 0x20(%rax)
movups %xmm0, 0x28(%rax)
movq %r14, %rdi
movq %rbx, %rsi
callq 0x11838
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeUnconfinedNodes()
bool Reductions::removeUnconfinedNodes() {
    //cout << "\n**Performing unconfined nodes reduction**" << endl;
    ReduceInfo old = reduceInfo;
    removeUnconfinedNodes2();
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        return false;
    }
    do {
        old = reduceInfo;
        removeUnconfinedNodes2();
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl 0x10(%rdi), %ebp
callq 0x1250a
movl 0x10(%rbx), %r14d
cmpl %r14d, %ebp
je 0x100e5
movl 0x10(%rbx), %r15d
movq %rbx, %rdi
callq 0x1250a
cmpl 0x10(%rbx), %r15d
jne 0x100d3
cmpl %r14d, %ebp
setne %al
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::foldCompleteKIndependentSets(unsigned int const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>**, bool const&)
bool Reductions::foldCompleteKIndependentSets(const uint32_t &theta, unordered_set<uint32_t> **oldCandidateNodes, unordered_set<uint32_t> **newCandidateNodes, const bool &theta4) {
    //cout << "\n**Performing K-Independent set folding reduction**" << endl;
    (*oldCandidateNodes)->clear();
    ReduceInfo old = reduceInfo;
    foldCompleteKIndependentSets2(theta, true, **oldCandidateNodes, **newCandidateNodes, theta4);
    swap(oldCandidateNodes, newCandidateNodes);
    if (old.nodesRemoved == reduceInfo.nodesRemoved) {
        return false;
    }
    do {
        old = reduceInfo;
        foldCompleteKIndependentSets2(theta, false, **oldCandidateNodes, **newCandidateNodes, theta4);
        swap(oldCandidateNodes, newCandidateNodes);
    } while (old.nodesRemoved != reduceInfo.nodesRemoved);
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r12
movq %rdi, %r13
movq (%rdx), %rdi
callq 0xd016
movl 0x10(%r13), %ebp
leaq 0xf(%rsp), %rdx
movb $0x1, (%rdx)
movq (%r15), %rcx
movq (%r14), %r8
movq %r13, %rdi
movq %r12, %rsi
movq %rbx, %r9
callq 0x12040
movq (%r15), %rax
movq (%r14), %rcx
movq %rcx, (%r15)
movq %rax, (%r14)
movl 0x10(%r13), %eax
movl %ebp, 0x14(%rsp)
movl %eax, 0x10(%rsp)
cmpl %eax, %ebp
je 0x1018b
movl 0x10(%r13), %ebp
movb $0x0, 0xe(%rsp)
movq (%r15), %rcx
movq (%r14), %r8
movq %r13, %rdi
movq %r12, %rsi
leaq 0xe(%rsp), %rdx
movq %rbx, %r9
callq 0x12040
movq (%r15), %rax
movq (%r14), %rcx
movq %rcx, (%r15)
movq %rax, (%r14)
cmpl 0x10(%r13), %ebp
jne 0x10157
movl 0x10(%rsp), %eax
cmpl %eax, 0x14(%rsp)
setne %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeEasyInstances(unsigned int const&)
void Reductions::removeEasyInstances(const uint32_t &theta) {
    vector<unordered_map<uint32_t, vector<uint32_t>* >::iterator> removedCCs;
    for (auto it = ccToNodes.begin() ; it != ccToNodes.end() ; it++) {
        vector<uint32_t> *cc = it->second;
            if (theta == 5 && cc->size() <= 28 || theta == 4 && cc->size() <= 23 || theta == 3 && cc->size() <= 20) {
                //cout << "Removing easy instance component " << it->first << "\n";
                findMis(*cc);
                graph.remove(*cc, reduceInfo, true);
                removedCCs.push_back(it);
            }
        }
    if (removedCCs.empty()) {
        //cout << "No nodes removed" << endl;
    } else {
        for (auto cc : removedCCs) {
            delete cc->second;
            ccToNodes.erase(cc);
        }
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rdi, %rbx
xorps %xmm0, %xmm0
movaps %xmm0, 0x10(%rsp)
movq $0x0, 0x20(%rsp)
movq 0x28(%rdi), %rax
movq %rax, 0x8(%rsp)
testq %rax, %rax
je 0x110e5
movq %rsi, %r14
leaq 0x10(%rbx), %r15
leaq 0x7(%rsp), %r12
leaq 0x6(%rsp), %r13
movq 0x10(%rax), %rbp
movl (%r14), %eax
cmpl $0x3, %eax
je 0x1106a
cmpl $0x4, %eax
je 0x11057
cmpl $0x5, %eax
jne 0x110cf
movq 0x8(%rbp), %rcx
subq (%rbp), %rcx
cmpq $0x74, %rcx
jb 0x11078
cmpl $0x3, %eax
je 0x1106a
cmpl $0x4, %eax
jne 0x110cf
movq 0x8(%rbp), %rcx
subq (%rbp), %rcx
cmpq $0x60, %rcx
jb 0x11078
cmpl $0x3, %eax
jne 0x110cf
movq 0x8(%rbp), %rax
subq (%rbp), %rax
cmpq $0x53, %rax
ja 0x110cf
movq %rbx, %rdi
movq %rbp, %rsi
callq 0x11a44
movq (%rbx), %rdi
movb $0x1, 0x7(%rsp)
movb $0x0, 0x6(%rsp)
movq %rbp, %rsi
movq %r15, %rdx
movq %r12, %rcx
xorl %r8d, %r8d
movq %r13, %r9
callq 0xc16e
movq 0x18(%rsp), %rsi
cmpq 0x20(%rsp), %rsi
je 0x110c0
movq 0x8(%rsp), %rax
movq %rax, (%rsi)
addq $0x8, 0x18(%rsp)
jmp 0x110cf
leaq 0x10(%rsp), %rdi
leaq 0x8(%rsp), %rdx
callq 0x133d8
movq 0x8(%rsp), %rax
movq (%rax), %rax
movq %rax, 0x8(%rsp)
testq %rax, %rax
jne 0x11025
movq 0x10(%rsp), %r12
movq 0x18(%rsp), %r13
cmpq %r13, %r12
je 0x1112e
addq $0x18, %rbx
movq (%r12), %r14
movq 0x10(%r14), %r15
testq %r15, %r15
je 0x1111a
movq (%r15), %rdi
testq %rdi, %rdi
je 0x11112
callq 0x21a0
movq %r15, %rdi
callq 0x21a0
movq %rbx, %rdi
movq %r14, %rsi
callq 0x13516
addq $0x8, %r12
cmpq %r13, %r12
jne 0x110f8
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x1113d
callq 0x21a0
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x11150
jmp 0x11150
movq %rax, %rbx
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x11162
callq 0x21a0
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::removeUnconfinedNodes2()
void Reductions::removeUnconfinedNodes2() {
    Graph::GraphTraversal graphTraversal(graph);
    while (graphTraversal.curNode != NONE) {
        bool isUnconfined = false;
        unordered_set<uint32_t> extendedGrandchildren;
        graph.getExtendedGrandchildren(graphTraversal, extendedGrandchildren, &isUnconfined);
        if (isUnconfined || !graph.isIndependentSet(extendedGrandchildren)) {
            graph.remove(graphTraversal.curNode, reduceInfo);
        }
        graph.getNextNode(graphTraversal);
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rdi, %rbx
movq (%rdi), %rsi
leaq 0x10(%rsp), %r14
movq %r14, %rdi
callq 0x29d8
cmpl $-0x1, (%r14)
je 0x125e8
leaq 0x50(%rsp), %r13
leaq 0x10(%rbx), %rax
movq %rax, 0x18(%rsp)
xorl %r14d, %r14d
leaq 0x10(%rsp), %r15
leaq 0x20(%rsp), %r12
leaq 0xe(%rsp), %rbp
movb %r14b, 0xf(%rsp)
movq %r13, 0x20(%rsp)
movq $0x1, 0x28(%rsp)
xorps %xmm0, %xmm0
movups %xmm0, -0x20(%r13)
movl $0x3f800000, 0x40(%rsp) # imm = 0x3F800000
movups %xmm0, -0x8(%r13)
movq (%rbx), %rdi
movb %r14b, 0xe(%rsp)
movq %r15, %rsi
movq %r12, %rdx
leaq 0xf(%rsp), %rcx
movq %rbp, %r8
callq 0x3f60
cmpb $0x0, 0xf(%rsp)
jne 0x125b2
movq (%rbx), %rdi
movq %r12, %rsi
xorl %edx, %edx
xorl %ecx, %ecx
callq 0x12e5e
testb %al, %al
jne 0x125ca
movq (%rbx), %rdi
movb $0x0, 0xe(%rsp)
movq %r15, %rsi
movq 0x18(%rsp), %rdx
movq %rbp, %rcx
callq 0x2f00
movq (%rbx), %rdi
movq %r15, %rsi
callq 0xc034
movq %r12, %rdi
callq 0xcff8
cmpl $-0x1, 0x10(%rsp)
jne 0x12555
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x125fb
jmp 0x125fb
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xcff8
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: bool Graph::isIndependentSet<std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>>(std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>> const&, unsigned int*, unsigned int*) const
bool isIndependentSet(const Container &set, uint32_t *node1 = NULL, uint32_t *node2 = NULL) const {
        for (auto i = set.begin() ; i != set.end() ; i++) {
            for (auto j = std::next(i, 1) ; j != set.end() ; j++) {
                if (edgeExists(*i, *j)) {
                    if (node1 != NULL && node2 != NULL) {
                        *node1 = *i;
                        *node2 = *j;
                    }
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq 0x10(%rsi), %rbx
testq %rbx, %rbx
sete 0x6(%rsp)
je 0x12f02
movq %rdi, %r15
movq %rdx, 0x8(%rsp)
testq %rdx, %rdx
setne %al
movq %rcx, 0x10(%rsp)
testq %rcx, %rcx
setne %cl
andb %al, %cl
movb %cl, 0x7(%rsp)
movq (%rbx), %rbp
testq %rbp, %rbp
sete %r14b
je 0x12ef5
leaq 0x8(%rbx), %r12
leaq 0x8(%rbp), %r13
movq %r15, %rdi
movq %r12, %rsi
movq %r13, %rdx
callq 0xc5e2
cmpl $-0x1, %eax
jne 0x12ed3
movq (%rbp), %rbp
testq %rbp, %rbp
sete %r14b
jne 0x12ead
jmp 0x12ef5
cmpb $0x0, 0x7(%rsp)
je 0x12ef0
movl (%r12), %eax
movq 0x8(%rsp), %rcx
movl %eax, (%rcx)
movl (%r13), %eax
movq 0x10(%rsp), %rcx
movl %eax, (%rcx)
testb %r14b, %r14b
je 0x12f02
movq (%rbx), %rbx
testq %rbx, %rbx
sete 0x6(%rsp)
jne 0x12e9d
movb 0x6(%rsp), %al
andb $0x1, %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.hpp
// Function: Reductions::isSubsetOfNeighbors(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>> const&, unsigned int const&, Graph const&)
static bool isSubsetOfNeighbors(const std::vector<Graph::GraphTraversal> &subset, const uint32_t &node, const Graph &graph) {
        uint32_t pos = graph.getPos(node);
        uint32_t count = subset.size();
        uint32_t nextNodeOffset = (pos == graph.nodeIndex.size()-1 ? graph.edgeBuffer->size() : graph.nodeIndex[pos+1].offset);
        for (uint32_t offset = graph.nodeIndex[pos].offset ; count && offset < nextNodeOffset ; offset++) {
            if (find((*graph.edgeBuffer)[offset], subset)) {
                count--;
            }
        }
        return !count;
    }

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rdi, %r14
cmpb $0x1, 0x3c(%rdx)
jne 0x13046
movq 0x40(%rbx), %rdi
callq 0xda16
movq %rax, %rsi
movl (%rsi), %edi
movq (%r14), %rcx
movq 0x8(%r14), %rdx
movq %rdx, %rsi
subq %rcx, %rsi
sarq $0x3, %rsi
movq (%rbx), %r8
movq 0x8(%rbx), %rax
subq %r8, %rax
sarq $0x2, %rax
movabsq $-0x5555555555555555, %r9 # imm = 0xAAAAAAAAAAAAAAAB
imulq %rax, %r9
decq %r9
cmpq %rdi, %r9
jne 0x1308e
movq 0x18(%rbx), %rax
movq 0x8(%rax), %r10
subq (%rax), %r10
shrq $0x2, %r10
jmp 0x13099
leal 0x1(%rdi), %eax
leaq (%rax,%rax,2), %rax
movl (%r8,%rax,4), %r10d
testl %esi, %esi
setne %al
je 0x130ff
leaq (%rdi,%rdi,2), %rdi
movl (%r8,%rdi,4), %edi
cmpl %r10d, %edi
jae 0x130ff
cmpq %rcx, %rdx
setne %r8b
movq 0x18(%rbx), %r9
movl %r10d, %r10d
movl %esi, %r11d
movl %r8d, %ebx
cmpq %rcx, %rdx
je 0x130ec
movq (%r9), %rax
movl (%rax,%rdi,4), %eax
movb $0x1, %bl
cmpl %eax, (%rcx)
je 0x130ec
movl $0x1, %ebp
movl %ebp, %r14d
cmpq %r14, %rsi
seta %bl
jbe 0x130ec
leal 0x1(%r14), %ebp
cmpl %eax, (%rcx,%r14,8)
jne 0x130d7
movzbl %bl, %eax
subl %eax, %r11d
setne %al
je 0x130ff
incq %rdi
cmpq %r10, %rdi
jb 0x130be
xorb $0x1, %al
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: Graph::advance(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, Graph::GraphTraversal&, Graph const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>*)
static bool advance(std::vector<Graph::GraphTraversal> &frontier, Graph::GraphTraversal &graphTraversal, const Graph &graph, std::unordered_set<uint32_t> *set = NULL) {
        bool validNeighbor = false;
        while(!validNeighbor) {
            graphTraversal = frontier.back();
            graph.getNextEdge(graphTraversal);
            frontier.back() = graphTraversal;
            if (graphTraversal.curEdgeOffset != NONE) {
                validNeighbor = true;
            } else {
                graphTraversal = frontier.back();
                if (set != NULL) {
                    set->erase(graphTraversal.curNode);
                }
                frontier.pop_back();
                if (frontier.empty()) {
                    return false;
                }
            }
        }
        return true;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
xorl %ebp, %ebp
xorl %r13d, %r13d
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
movq %r14, %rdi
movq %r15, %rsi
callq 0xc4d8
movq 0x8(%r12), %rax
movq (%r15), %rcx
movq %rcx, -0x8(%rax)
movb $0x1, %al
cmpl $-0x1, 0x4(%r15)
jne 0x13184
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
testq %rbx, %rbx
je 0x1316a
movq %rbx, %rdi
movq %r15, %rsi
callq 0xda9e
movq (%r12), %rcx
movq 0x8(%r12), %rdx
addq $-0x8, %rdx
movq %rdx, 0x8(%r12)
movl %r13d, %eax
cmpq %rdx, %rcx
je 0x1318d
movl %eax, %ebp
movl %eax, %r13d
testb $0x1, %al
je 0x13122
andb $0x1, %bpl
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.cpp
// Function: Alg::SearchNode::handleCuts()
bool Alg::SearchNode::handleCuts() {
    bool connected;
    if (graph.getArticulationPoints(cut, c1, c2, actualComponent1, connected) || connected && (graph.getSeparatingPairs(cut, c1, c2, actualComponent1) || graph.getSeparatingTriplets(cut, c1, c2, actualComponent1))) {
        branchingRule.type = BranchingRule::Type::CUT;
        hasCut = true;
        return true;
    } else {
        return false;
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
leaq 0x30(%rdi), %r14
leaq 0x130(%rdi), %r15
leaq 0x168(%rdi), %r12
leaq 0x180(%rdi), %r13
leaq 0x198(%rdi), %rbp
leaq 0x7(%rsp), %r9
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x70a8
testb %al, %al
je 0x146a7
movl $0x8, 0x8(%rbx)
movb $0x1, 0x128(%rbx)
movb $0x1, %al
jmp 0x146e0
cmpb $0x1, 0x7(%rsp)
jne 0x146de
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x8346
testb %al, %al
jne 0x14695
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0xac02
testb %al, %al
jne 0x14695
xorl %eax, %eax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::SearchNode::SearchNode(std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const&, bool const&)
SearchNode(const std::string &inputFile, const bool &checkIndependentSet) : id(NONE), graph(inputFile, checkIndependentSet), reductions(new Reductions(graph, mis)), parent(NONE), leftChild(NONE), rightChild(NONE), finalMis(NULL), hasCut(false), cutIsDone(false) {
            uint32_t maxDegreeNode;
            graph.getMaxNodeDegree(maxDegreeNode, theta);
            if (theta > 8) {
                theta = 8;
            } else if (theta < 3) {
                theta = 3;
            }
        }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
movl %eax, (%rdi)
movabsq $-0x100000000, %rcx     # imm = 0xFFFFFFFF00000000
movq %rcx, 0x8(%rdi)
movl %eax, 0x10(%rdi)
xorps %xmm0, %xmm0
movups %xmm0, 0x18(%rdi)
movq $0x0, 0x28(%rdi)
leaq 0x30(%rdi), %r14
movq %r14, %rdi
callq 0xb422
leaq 0x80(%rbx), %r15
xorps %xmm0, %xmm0
movups %xmm0, 0x80(%rbx)
movq $0x0, 0x90(%rbx)
leaq 0xc8(%rbx), %rax
movq %rax, 0x98(%rbx)
movl $0x1, %r12d
movq %r12, 0xa0(%rbx)
movups %xmm0, 0xa8(%rbx)
movl $0x3f800000, %ebp       # imm = 0x3F800000
movl %ebp, 0xb8(%rbx)
movups %xmm0, 0xc0(%rbx)
leaq 0x100(%rbx), %rax
movq %rax, 0xd0(%rbx)
movq %r12, 0xd8(%rbx)
movups %xmm0, 0xe0(%rbx)
movl %ebp, 0xf0(%rbx)
movups %xmm0, 0xf8(%rbx)
movl $0x50, %edi
callq 0x21e0
movq %r14, (%rax)
movq %r15, 0x8(%rax)
movl $0x0, 0x10(%rax)
movq %rax, %rcx
addq $0x48, %rcx
movq %rcx, 0x18(%rax)
movq %r12, 0x20(%rax)
xorps %xmm0, %xmm0
movups %xmm0, 0x28(%rax)
movl %ebp, 0x38(%rax)
movups %xmm0, 0x40(%rax)
movq %rax, 0x108(%rbx)
movq $-0x1, 0x110(%rbx)
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
movl %eax, 0x118(%rbx)
movq $0x0, 0x120(%rbx)
xorl %ecx, %ecx
movb %cl, 0x128(%rbx)
leaq 0x130(%rbx), %r13
leaq 0x160(%rbx), %rdx
movq %rdx, 0x130(%rbx)
movq %r12, 0x138(%rbx)
movups %xmm0, 0x140(%rbx)
movl %ebp, 0x150(%rbx)
movb %cl, 0x199(%rbx)
movups %xmm0, 0x158(%rbx)
movups %xmm0, 0x168(%rbx)
movups %xmm0, 0x178(%rbx)
movups %xmm0, 0x188(%rbx)
leaq 0x4(%rbx), %r12
movq %rsp, %rcx
movl %eax, (%rcx)
leaq 0x4(%rsp), %rsi
movq %r14, %rdi
movq %r12, %rdx
callq 0x2a00
movl (%r12), %ecx
movl $0x8, %eax
cmpl $0x8, %ecx
ja 0x14c37
movl $0x3, %eax
cmpl $0x2, %ecx
ja 0x14c3b
movl %eax, (%r12)
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %r12
movq 0x180(%rbx), %rdi
testq %rdi, %rdi
je 0x14c5e
callq 0x21a0
movq 0x168(%rbx), %rdi
testq %rdi, %rdi
je 0x14c6f
callq 0x21a0
movq %r13, %rdi
callq 0xcff8
jmp 0x14c7c
movq %rax, %r12
movq %r15, %rdi
callq 0x14caa
movq %r14, %rdi
callq 0x2950
jmp 0x14c91
movq %rax, %r12
addq $0x18, %rbx
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x14ca2
callq 0x21a0
movq %r12, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::chooseCutBranch(Alg::SearchNode*)
void chooseCutBranch(SearchNode *parent) {
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        if (leftChild->finalMis->size() == rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_1;
        } else { //if (leftChild->finalMis->size() > rightChild->finalMis->size()) {
            parent->branchingRule.type = BranchingRule::Type::CUT_RIGHT_2;
        }/* else {
            assert(false);
        }*/
        delete rightChild->finalMis;
        delete searchTree.back();
        searchTree.pop_back();
        parent->cutIsDone = true;
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rsi
cmpq %rcx, %rsi
jne 0x1513d
movl 0x114(%rbx), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x1513d
movq %rdi, %r14
movq (%rax,%rcx,8), %rcx
movq (%rax,%rsi,8), %rax
movq 0x120(%rax), %rax
movq 0x8(%rax), %rdx
subq (%rax), %rdx
movq 0x120(%rcx), %r15
movq (%r15), %rdi
movq 0x8(%r15), %rax
subq %rdi, %rax
xorl %ecx, %ecx
cmpq %rax, %rdx
setne %cl
addl $0x9, %ecx
movl %ecx, 0x8(%rbx)
testq %rdi, %rdi
je 0x15106
callq 0x21a0
movq %r15, %rdi
callq 0x21a0
movq 0x8(%r14), %rax
movq -0x8(%rax), %r15
testq %r15, %r15
je 0x1512b
movq %r15, %rdi
callq 0x141c6
movq %r15, %rdi
callq 0x21a0
addq $-0x8, 0x8(%r14)
movb $0x1, 0x199(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x5a37(%rip), %rdi      # 0x1ab7b
leaq 0x597e(%rip), %rsi      # 0x1aac9
leaq 0x5a83(%rip), %rcx      # 0x1abd5
movl $0x15e, %edx            # imm = 0x15E
callq 0x2110
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::concatMis(Alg::SearchNode*)
void concatMis(SearchNode *parent) {
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        for (auto i: *leftChild->finalMis) {
            for (auto j: *rightChild->finalMis) {
                if (i == j) {
                    assert(0);
                }
            }
        }
        parent->finalMis = leftChild->finalMis;
        parent->finalMis->insert(parent->finalMis->end(), rightChild->finalMis->begin(), rightChild->finalMis->end());
        parent->graph.collectZeroDegreeNodes();
        parent->mis.unfoldHypernodes(parent->graph.zeroDegreeNodes, *(parent->finalMis));

        delete rightChild->finalMis;
        delete searchTree.back();
        searchTree.pop_back();
        delete searchTree.back();
        searchTree.pop_back();
    }

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %r14
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rsi
cmpq %rcx, %rsi
jne 0x152b9
movl 0x114(%r14), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x152b9
movq %rdi, %rbx
movq (%rax,%rcx,8), %r15
movq (%rax,%rsi,8), %rax
movq 0x120(%rax), %rdi
movq (%rdi), %rax
movq 0x8(%rdi), %rcx
cmpq %rcx, %rax
je 0x151eb
movq 0x120(%r15), %rsi
movq (%rsi), %rdx
movq 0x8(%rsi), %rsi
cmpq %rsi, %rdx
je 0x151e2
movl (%rax), %r8d
movq %rdx, %r9
cmpl (%r9), %r8d
je 0x1529a
addq $0x4, %r9
cmpq %rsi, %r9
jne 0x151d0
addq $0x4, %rax
cmpq %rcx, %rax
jne 0x151c5
movq %rdi, 0x120(%r14)
movq 0x8(%rdi), %rsi
movq 0x120(%r15), %rax
movq (%rax), %rdx
movq 0x8(%rax), %rcx
callq 0xeb0c
leaq 0x30(%r14), %rdi
callq 0x6fca
leaq 0x80(%r14), %rdi
movq 0x120(%r14), %rdx
addq $0x50, %r14
movq %r14, %rsi
callq 0x1787a
movq 0x120(%r15), %r14
testq %r14, %r14
je 0x1524d
movq (%r14), %rdi
testq %rdi, %rdi
je 0x15245
callq 0x21a0
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x1526a
movq %r14, %rdi
callq 0x141c6
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
leaq -0x8(%rax), %rcx
movq %rcx, 0x8(%rbx)
movq -0x10(%rax), %r14
testq %r14, %r14
je 0x1528f
movq %r14, %rdi
callq 0x141c6
movq %r14, %rdi
callq 0x21a0
addq $-0x8, 0x8(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x4de3(%rip), %rdi      # 0x1a084
leaq 0x5821(%rip), %rsi      # 0x1aac9
leaq 0x594e(%rip), %rcx      # 0x1abfd
movl $0x14b, %edx            # imm = 0x14B
callq 0x2110
leaq 0x58bb(%rip), %rdi      # 0x1ab7b
leaq 0x5802(%rip), %rsi      # 0x1aac9
leaq 0x592f(%rip), %rcx      # 0x1abfd
movl $0x147, %edx            # imm = 0x147
callq 0x2110
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::chooseMaxMis(Alg::SearchNode*)
void chooseMaxMis(SearchNode *parent) {
        //std::cout << "no next child" << std::endl;
        SearchNode *leftChild = searchTree[parent->leftChild];
        SearchNode *rightChild = searchTree[parent->rightChild];
        assert(parent->rightChild == searchTree.size() - 1 && parent->leftChild == searchTree.size() - 2);
        parent->id = leftChild->id;
        parent->finalMis = leftChild->finalMis;
        std::vector<uint32_t> *min = rightChild->finalMis;
        if (rightChild->finalMis->size() > parent->finalMis->size()) {
            parent->id = rightChild->id;
            parent->finalMis = rightChild->finalMis;
            min = leftChild->finalMis;
        }
        delete min;
        delete searchTree.back();
        searchTree.pop_back();
        delete searchTree.back();
        searchTree.pop_back();
    }

// Assembly:
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %rbx
movl 0x118(%rsi), %ecx
movq (%rdi), %rax
movq 0x8(%rdi), %rdx
subq %rax, %rdx
sarq $0x3, %rdx
leaq -0x1(%rdx), %rdi
cmpq %rcx, %rdi
jne 0x153c2
movl 0x114(%rsi), %edi
addq $-0x2, %rdx
cmpq %rdi, %rdx
jne 0x153c2
movq (%rax,%rcx,8), %rcx
movq (%rax,%rdi,8), %rax
movl (%rax), %edx
movl %edx, (%rsi)
movq 0x120(%rax), %rdx
movq %rdx, 0x120(%rsi)
movq 0x120(%rcx), %r14
movq 0x8(%r14), %rdi
subq (%r14), %rdi
movq 0x8(%rdx), %r8
subq (%rdx), %r8
cmpq %r8, %rdi
jbe 0x15359
movl (%rcx), %ecx
movl %ecx, (%rsi)
movq %r14, 0x120(%rsi)
movq 0x120(%rax), %r14
testq %r14, %r14
je 0x15373
movq (%r14), %rdi
testq %rdi, %rdi
je 0x1536b
callq 0x21a0
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x15390
movq %r14, %rdi
callq 0x141c6
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
leaq -0x8(%rax), %rcx
movq %rcx, 0x8(%rbx)
movq -0x10(%rax), %r14
testq %r14, %r14
je 0x153b5
movq %r14, %rdi
callq 0x141c6
movq %r14, %rdi
callq 0x21a0
addq $-0x8, 0x8(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
leaq 0x57b2(%rip), %rdi      # 0x1ab7b
leaq 0x56f9(%rip), %rsi      # 0x1aac9
leaq 0x5848(%rip), %rcx      # 0x1ac1f
movl $0x134, %edx            # imm = 0x134
callq 0x2110
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Alg.hpp
// Function: Alg::BranchingRule::getMeasure(Graph const&, unsigned int const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>*)
static uint32_t getMeasure(const Graph &graph, const uint32_t &node, std::unordered_set<uint32_t> *neighborsAtDistance2Ptr = NULL) {
            std::vector<uint32_t> neighbors;
            graph.gatherNeighbors(node, neighbors);
            neighbors.push_back(node);
            std::unordered_set<uint32_t> neighborsAtDistance2;
            if (neighborsAtDistance2Ptr == NULL) {
                graph.getNeighborsAtDistance2(node, neighborsAtDistance2);
                neighborsAtDistance2Ptr = &neighborsAtDistance2;
            }
            uint32_t f = graph.getNumberOfEdgesBetweenSets(neighbors, *neighborsAtDistance2Ptr);
            return 2 * f - neighborsAtDistance2Ptr->size();
        }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x58, %rsp
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
xorps %xmm0, %xmm0
movq %rsp, %rdx
movaps %xmm0, (%rdx)
movq $0x0, 0x10(%rdx)
leaq 0x20(%rsp), %r8
movl $0xffffffff, (%r8)      # imm = 0xFFFFFFFF
xorl %ecx, %ecx
callq 0xc714
movq 0x8(%rsp), %rsi
cmpq 0x10(%rsp), %rsi
je 0x16ddb
movl (%r15), %eax
movl %eax, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rsp)
jmp 0x16de6
movq %rsp, %rdi
movq %r15, %rdx
callq 0xdeac
leaq 0x50(%rsp), %rax
movq %rax, -0x30(%rax)
movq $0x1, -0x28(%rax)
xorps %xmm0, %xmm0
movups %xmm0, -0x20(%rax)
movl $0x3f800000, -0x10(%rax) # imm = 0x3F800000
movups %xmm0, -0x8(%rax)
testq %rbx, %rbx
jne 0x16e2f
leaq 0x1c(%rsp), %rcx
movl $0xffffffff, (%rcx)     # imm = 0xFFFFFFFF
leaq 0x20(%rsp), %rbx
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
xorl %r8d, %r8d
callq 0x2c84
movq %rsp, %rsi
movq %r14, %rdi
movq %rbx, %rdx
callq 0x16e98
movl %eax, %ebp
movq 0x18(%rbx), %rbx
leaq 0x20(%rsp), %rdi
callq 0xcff8
movq (%rsp), %rdi
testq %rdi, %rdi
je 0x16e5b
callq 0x21a0
addl %ebp, %ebp
subl %ebx, %ebp
movl %ebp, %eax
addq $0x58, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
jmp 0x16e70
jmp 0x16e7f
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xcff8
jmp 0x16e82
movq %rax, %rbx
movq (%rsp), %rdi
testq %rdi, %rdi
je 0x16e90
callq 0x21a0
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Graph.hpp
// Function: unsigned int Graph::getNumberOfEdgesBetweenSets<std::vector<unsigned int, std::allocator<unsigned int>>, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>>(std::vector<unsigned int, std::allocator<unsigned int>> const&, std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>> const&) const
uint32_t getNumberOfEdgesBetweenSets(const Container1 &set1, const Container2 &set2) const {
        uint32_t count = 0;
        for (auto i: set1) {
            for (auto j: set2) {
                if (edgeExists(i, j)) {
                    count++;
                }
            }
        }
        return count;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, 0x10(%rsp)
movq (%rsi), %r13
movq 0x8(%rsi), %rax
movq %rax, 0x8(%rsp)
cmpq %rax, %r13
je 0x16f0f
movq %rdi, %r14
xorl %ebp, %ebp
leaq 0x4(%rsp), %r15
movq %rsp, %r12
movl (%r13), %eax
movl %eax, 0x4(%rsp)
movq 0x10(%rsp), %rax
movq 0x10(%rax), %rbx
testq %rbx, %rbx
je 0x16f02
movl 0x8(%rbx), %eax
movl %eax, (%rsp)
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
callq 0xc5e2
xorl %ecx, %ecx
cmpl $-0x1, %eax
setne %cl
addl %ecx, %ebp
movq (%rbx), %rbx
jmp 0x16eda
addq $0x4, %r13
cmpq 0x8(%rsp), %r13
jne 0x16ec9
jmp 0x16f11
xorl %ebp, %ebp
movl %ebp, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::markHypernode(unsigned int const&, std::vector<unsigned int, std::allocator<unsigned int>> const&, std::vector<unsigned int, std::allocator<unsigned int>> const&)
void Mis::markHypernode(const uint32_t &hypernode, const vector<uint32_t> &nodes, const vector<uint32_t> &neighbors) {
    const vector<uint32_t> *container = &nodes;
    for (uint32_t i = 0 ; i < 2 ; i++) {
        for (auto node: *container) {
            auto it = hypernodeToInnernode.find(node);
            if (it != hypernodeToInnernode.end()) {
                it->second.outerLevel = false;
            }
        }
        container = &neighbors;
    }
    assert(hypernodeToInnernode.insert({hypernode, Innernode(nodes, neighbors)}).second);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x88, %rsp
movq %rdx, %r8
movq %rsi, 0x8(%rsp)
movq %rdi, %rbx
movq 0x18(%rdi), %r10
movq 0x20(%rdi), %r11
xorl %r15d, %r15d
movq %rdx, %rax
movq (%rax), %r12
movq 0x8(%rax), %r13
cmpq %r13, %r12
je 0x1776b
movl (%r12), %esi
movq %rsi, %rax
xorl %edx, %edx
divq %r11
movq %rdx, %rdi
movq (%r10,%rdx,8), %rdx
movl $0x0, %eax
testq %rdx, %rdx
je 0x17750
movq (%rdx), %rbp
movq %rdx, %rax
cmpl 0x8(%rbp), %esi
je 0x17750
movq %rbp, %r14
movq (%rbp), %rbp
testq %rbp, %rbp
je 0x1774e
movl 0x8(%rbp), %r9d
movq %r9, %rax
xorl %edx, %edx
divq %r11
movl $0x0, %eax
cmpq %rdi, %rdx
jne 0x17750
movq %r14, %rax
cmpl %r9d, %esi
jne 0x17722
jmp 0x17750
xorl %eax, %eax
testq %rax, %rax
je 0x1775a
movq (%rax), %rax
jmp 0x1775c
xorl %eax, %eax
testq %rax, %rax
je 0x17765
movb $0x0, 0x40(%rax)
addq $0x4, %r12
jmp 0x176f5
leal 0x1(%r15), %edx
movq %rcx, %rax
testl %r15d, %r15d
movl %edx, %r15d
je 0x176ee
addq $0x18, %rbx
leaq 0x10(%rsp), %r15
movq %r15, %rdi
movq %r8, %rsi
movq %rcx, %rdx
callq 0x183fa
movq 0x8(%rsp), %rax
movl (%rax), %eax
leaq 0x48(%rsp), %rsi
movl %eax, (%rsi)
movaps (%r15), %xmm0
movups %xmm0, 0x8(%rsi)
movq 0x10(%r15), %rax
movq %rax, 0x18(%rsi)
xorps %xmm0, %xmm0
movaps %xmm0, (%r15)
xorl %eax, %eax
movq %rax, 0x10(%r15)
movups 0x18(%r15), %xmm1
movups %xmm1, 0x20(%rsi)
movq 0x28(%r15), %rcx
movq %rcx, 0x30(%rsi)
movups %xmm0, 0x18(%r15)
movq %rax, 0x28(%r15)
movb 0x30(%r15), %al
movb %al, 0x38(%rsi)
movq %rbx, %rdi
callq 0x18a48
testb $0x1, %dl
je 0x1783c
movq 0x68(%rsp), %rdi
testq %rdi, %rdi
je 0x177fd
callq 0x21a0
movq 0x50(%rsp), %rdi
testq %rdi, %rdi
je 0x1780c
callq 0x21a0
movq 0x28(%rsp), %rdi
testq %rdi, %rdi
je 0x1781b
callq 0x21a0
movq 0x10(%rsp), %rdi
testq %rdi, %rdi
je 0x1782a
callq 0x21a0
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3586(%rip), %rdi      # 0x1adc9
leaq 0x35cc(%rip), %rsi      # 0x1ae16
leaq 0x35d1(%rip), %rcx      # 0x1ae22
movl $0x13, %edx
callq 0x2110
movq %rax, %rbx
leaq 0x48(%rsp), %rdi
callq 0x1843a
leaq 0x10(%rsp), %rdi
callq 0x1845e
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::unfoldHypernodes(std::vector<unsigned int, std::allocator<unsigned int>>&, std::vector<unsigned int, std::allocator<unsigned int>>&)
void Mis::unfoldHypernodes(vector<uint32_t> &zeroDegreeNodes, vector<uint32_t> &finalMis) {
    finalMis.reserve(zeroDegreeNodes.size() + mis.size());
    expandIncludedNodes(mis, finalMis);
    expandIncludedNodes(zeroDegreeNodes, finalMis);
    expandExcludedNodes(finalMis);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq 0x8(%rsi), %rax
subq (%rsi), %rax
sarq $0x2, %rax
movq 0x8(%rdi), %rsi
subq (%rdi), %rsi
sarq $0x2, %rsi
addq %rax, %rsi
movq %rdx, %rdi
callq 0xc44a
movq %r15, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0x18480
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x18480
movq %r15, %rdi
movq %rbx, %rsi
popq %rbx
popq %r14
popq %r15
jmp 0x178d6
nop
// File: /workspace/github_cpp_makefile_star2_O1/iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::print(std::vector<unsigned int, std::allocator<unsigned int>>&)
void Mis::print(vector<uint32_t> &finalMis) {
    cout <<"\nWriting Maximum Independent Set to file " << Mis::misOutputFile << endl;
    cout << "Maximum Independent Set size: " << finalMis.size() << "\n";
    FILE *f;
    f = fopen(Mis::misOutputFile.c_str(), "w");
    if (f == NULL) {
        cerr << "Error in opening mis output file " << Mis::misOutputFile << endl;
        exit(EXIT_FAILURE);
    }
    fprintf(f, "Maximum Independent Set size: %ld\n", finalMis.size());
    for (auto node : finalMis) {
        fprintf(f, "%" PRIu32 "\n", node);
    }
    fclose(f);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rdi, %rbx
movq 0xb4ea(%rip), %r14      # 0x22fd0
leaq 0x3393(%rip), %rsi      # 0x1ae80
movl $0x29, %edx
movq %r14, %rdi
callq 0x2200
movq 0xb6df(%rip), %rsi      # 0x231e0
movq 0xb6e0(%rip), %rdx      # 0x231e8
movq %r14, %rdi
callq 0x2200
movq %rax, %r15
movq (%rax), %rax
movq -0x18(%rax), %rdi
addq %r15, %rdi
movl $0xa, %esi
callq 0x21b0
movsbl %al, %esi
movq %r15, %rdi
callq 0x2030
movq %rax, %rdi
callq 0x2130
leaq 0x3369(%rip), %rsi      # 0x1aeaa
movl $0x1e, %edx
movq %r14, %rdi
callq 0x2200
movq 0x8(%rbx), %rsi
subq (%rbx), %rsi
sarq $0x2, %rsi
movq %r14, %rdi
callq 0x2120
leaq 0x2a1e(%rip), %rsi      # 0x1a586
movl $0x1, %edx
movq %rax, %rdi
callq 0x2200
movq 0xb664(%rip), %rdi      # 0x231e0
leaq 0x3346(%rip), %rsi      # 0x1aec9
callq 0x2230
testq %rax, %rax
je 0x17beb
movq %rax, %r14
movq 0x8(%rbx), %rdx
subq (%rbx), %rdx
sarq $0x2, %rdx
leaq 0x334b(%rip), %rsi      # 0x1aeed
movq %rax, %rdi
xorl %eax, %eax
callq 0x2270
movq (%rbx), %r15
movq 0x8(%rbx), %r12
cmpq %r12, %r15
je 0x17bd8
leaq 0x3351(%rip), %rbx      # 0x1af10
movl (%r15), %edx
movq %r14, %rdi
movq %rbx, %rsi
xorl %eax, %eax
callq 0x2270
addq $0x4, %r15
cmpq %r12, %r15
jne 0x17bbf
movq %r14, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x21d0
movq 0xb3fe(%rip), %rdi      # 0x22ff0
leaq 0x32d2(%rip), %rsi      # 0x1aecb
callq 0x21c0
leaq 0xb5db(%rip), %rsi      # 0x231e0
movq %rax, %rdi
callq 0x2190
movq %rax, %rdi
callq 0x20b0
movl $0x1, %edi
callq 0x2240
nop