LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_cpp_makefile_star2_O3/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 0x11c48
movl 0x10(%rbx), %r14d
cmpl %r14d, %ebp
je 0xfa51
movl %r14d, %r15d
movq %rbx, %rdi
callq 0x11c48
movl 0x10(%rbx), %eax
cmpl %eax, %r15d
movl %eax, %r15d
jne 0xfa3e
cmpl %r14d, %ebp
setne %al
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/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 0xc96e
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 0x1170c
movq (%r15), %r8
movq (%r14), %rax
movq %rax, (%r15)
movq %r8, (%r14)
movl 0x10(%r13), %eax
movl %ebp, 0x14(%rsp)
movl %eax, 0x10(%rsp)
cmpl %eax, %ebp
je 0xfaf8
movl 0x10(%rsp), %ebp
movb $0x0, 0xe(%rsp)
movq (%r15), %rcx
movq %r13, %rdi
movq %r12, %rsi
leaq 0xe(%rsp), %rdx
movq %rbx, %r9
callq 0x1170c
movq (%r15), %r8
movq (%r14), %rax
movq %rax, (%r15)
movq %r8, (%r14)
movl 0x10(%r13), %eax
cmpl %eax, %ebp
movl %eax, %ebp
jne 0xfac7
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
// File: /workspace/github_cpp_makefile_star2_O3/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 0x11d26
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 0x3fee
cmpb $0x0, 0xf(%rsp)
jne 0x11cf0
movq (%rbx), %rdi
movq %r12, %rsi
xorl %edx, %edx
xorl %ecx, %ecx
callq 0x124fc
testb %al, %al
jne 0x11d08
movq (%rbx), %rdi
movb $0x0, 0xe(%rsp)
movq %r15, %rsi
movq 0x18(%rsp), %rdx
movq %rbp, %rcx
callq 0x2f76
movq (%rbx), %rdi
movq %r15, %rsi
callq 0xb94a
movq %r12, %rdi
callq 0xc950
cmpl $-0x1, 0x10(%rsp)
jne 0x11c93
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x11d39
jmp 0x11d39
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xc950
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O3/iPapatsoris[P]Maximum-Independent-Set/src/Reductions.cpp
// Function: Reductions::findClique(std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>&, std::vector<Graph::GraphTraversal, std::allocator<Graph::GraphTraversal>>*, unsigned int const&)
bool Reductions::findClique(vector<Graph::GraphTraversal> &clique, vector<Graph::GraphTraversal> *previousClique, const uint32_t &cliqueSize) {
    Graph::GraphTraversal graphTraversal = clique[0];
    if (graphTraversal.curNode == NONE) {
        return false;
    }
    while (clique.size() < cliqueSize) {
        uint32_t neighbor = (*graph.edgeBuffer)[graphTraversal.curEdgeOffset];
        bool existsInPreviousClique = (previousClique == NULL ? false : find(neighbor, *previousClique));
        if (!existsInPreviousClique && !find(neighbor, clique) && isSubsetOfNeighbors(clique, neighbor, graph)) {
            graph.goToNode(neighbor, graphTraversal);
            clique.push_back(graphTraversal);
        } else {
            if (!Graph::advance(clique, graphTraversal, graph)) {
                return false;
            }
        }
    }
    return true;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rcx, %rbx
movq (%rsi), %r13
movq (%r13), %rcx
movq %rcx, 0x8(%rsp)
cmpl $-0x1, %ecx
jne 0x11d77
xorl %eax, %eax
jmp 0x11e86
movq %rdx, %r14
movq %rsi, %r15
movq 0x8(%rsi), %rsi
movq %rsi, %rcx
subq %r13, %rcx
sarq $0x3, %rcx
movl (%rbx), %edx
movb $0x1, %al
cmpq %rdx, %rcx
jae 0x11e86
movq %rdi, %r12
leaq 0x8(%rsp), %rbp
movq (%r12), %rdx
movq 0x18(%rdx), %rdi
movl 0xc(%rsp), %r8d
movq (%rdi), %rdi
movl (%rdi,%r8,4), %edi
movl %edi, 0x14(%rsp)
testq %r14, %r14
je 0x11de7
movq (%r14), %r8
movq 0x8(%r14), %r9
subq %r8, %r9
je 0x11de7
sarq $0x3, %r9
movl $0x1, %r10d
xorl %r11d, %r11d
cmpl %edi, (%r8,%r11,8)
je 0x11e44
movl %r10d, %r11d
incl %r10d
cmpq %r11, %r9
ja 0x11dd6
cmpq %r13, %rsi
je 0x11e05
movl $0x1, %esi
xorl %r8d, %r8d
cmpl %edi, (%r13,%r8,8)
je 0x11e44
movl %esi, %r8d
incl %esi
cmpq %r8, %rcx
ja 0x11df4
movq %r15, %rdi
leaq 0x14(%rsp), %r13
movq %r13, %rsi
callq 0x1268c
movq (%r12), %rdx
testb %al, %al
je 0x11e44
movq %rdx, %rdi
movq %r13, %rsi
movq %rbp, %rdx
callq 0xba5a
movq 0x8(%r15), %rsi
cmpq 0x10(%r15), %rsi
je 0x11e77
movq 0x8(%rsp), %rax
movq %rax, (%rsi)
addq $0x8, 0x8(%r15)
jmp 0x11e59
movq %r15, %rdi
movq %rbp, %rsi
xorl %ecx, %ecx
callq 0x12752
testb %al, %al
je 0x11d70
movq (%r15), %r13
movq 0x8(%r15), %rsi
movq %rsi, %rcx
subq %r13, %rcx
sarq $0x3, %rcx
movl (%rbx), %edx
cmpq %rdx, %rcx
jb 0x11da0
jmp 0x11e84
movq %r15, %rdi
movq %rbp, %rdx
callq 0x1302a
jmp 0x11e59
movb $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_O3/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), %r14
movb $0x1, %bl
testq %r14, %r14
je 0x1257e
movq %rdi, %r12
movq %rdx, 0x8(%rsp)
movq %rcx, 0x10(%rsp)
movq (%r14), %r15
testq %r15, %r15
je 0x1257e
leaq 0x8(%r14), %r13
leaq 0x8(%r15), %rbp
movq %r12, %rdi
movq %r13, %rsi
movq %rbp, %rdx
callq 0xbf3a
cmpl $-0x1, %eax
jne 0x12557
movq (%r15), %r15
testq %r15, %r15
jne 0x1252e
movq (%r14), %r14
testq %r14, %r14
jne 0x12522
jmp 0x1257e
movq 0x8(%rsp), %rsi
testq %rsi, %rsi
sete %al
movq 0x10(%rsp), %rdx
testq %rdx, %rdx
sete %cl
orb %al, %cl
jne 0x1257c
movl (%r13), %eax
movl %eax, (%rsi)
movl (%rbp), %eax
movl %eax, (%rdx)
xorl %ebx, %ebx
movl %ebx, %eax
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/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 %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rdi, %r14
movq %rdx, %rdi
callq 0x124d0
movq (%r14), %rcx
movq 0x8(%r14), %rdx
movq %rdx, %rsi
subq %rcx, %rsi
sarq $0x3, %rsi
movl %eax, %edi
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 0x126e6
movq 0x18(%rbx), %rax
movq 0x8(%rax), %r9
subq (%rax), %r9
shrq $0x2, %r9
jmp 0x126f1
leal 0x1(%rdi), %eax
leaq (%rax,%rax,2), %rax
movl (%r8,%rax,4), %r9d
testl %esi, %esi
setne %al
je 0x12747
leaq (%rdi,%rdi,2), %rdi
movl (%r8,%rdi,4), %edi
cmpl %r9d, %edi
jae 0x12747
movq 0x18(%rbx), %r8
movl %r9d, %r9d
movl %esi, %r10d
cmpq %rcx, %rdx
je 0x12737
movq (%r8), %rax
movl (%rax,%rdi,4), %eax
movl $0x1, %r11d
xorl %ebx, %ebx
cmpl %eax, (%rcx,%rbx,8)
je 0x12734
movl %r11d, %ebx
incl %r11d
cmpq %rbx, %rsi
ja 0x12722
jmp 0x12737
decl %r10d
testl %r10d, %r10d
setne %al
je 0x12747
incq %rdi
cmpq %r9, %rdi
jb 0x1270f
xorb $0x1, %al
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
// File: /workspace/github_cpp_makefile_star2_O3/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 %r12
pushq %rbx
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
movq %r14, %rdi
movq %r15, %rsi
callq 0xbe2e
movq 0x8(%r12), %rax
movq (%r15), %rcx
movq %rcx, -0x8(%rax)
movl 0x4(%r15), %ebp
cmpl $-0x1, %ebp
jne 0x127c5
movq 0x8(%r12), %rax
movq -0x8(%rax), %rax
movq %rax, (%r15)
testq %rbx, %rbx
je 0x127ae
movq %rbx, %rdi
movq %r15, %rsi
callq 0xd3d6
movq (%r12), %rax
movq 0x8(%r12), %rcx
addq $-0x8, %rcx
movq %rcx, 0x8(%r12)
cmpq %rcx, %rax
jne 0x12766
cmpl $-0x1, %ebp
setne %al
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/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 0x7082
testb %al, %al
je 0x13c5b
movl $0x8, 0x8(%rbx)
movb $0x1, 0x128(%rbx)
movb $0x1, %al
jmp 0x13c94
cmpb $0x1, 0x7(%rsp)
jne 0x13c92
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0x81cc
testb %al, %al
jne 0x13c49
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
movq %r13, %rcx
movq %rbp, %r8
callq 0xa612
testb %al, %al
jne 0x13c49
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_O3/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 0xada4
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 0x141eb
movl $0x3, %eax
cmpl $0x2, %ecx
ja 0x141ef
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 0x14212
callq 0x21a0
movq 0x168(%rbx), %rdi
testq %rdi, %rdi
je 0x14223
callq 0x21a0
movq %r13, %rdi
callq 0xc950
jmp 0x14230
movq %rax, %r12
movq %r15, %rdi
callq 0x1425e
movq %r14, %rdi
callq 0x2950
jmp 0x14245
movq %rax, %r12
addq $0x18, %rbx
movq (%rbx), %rdi
testq %rdi, %rdi
je 0x14256
callq 0x21a0
movq %r12, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O3/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 0x14767
movl 0x114(%rbx), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x14767
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 0x14730
callq 0x21a0
movq %r15, %rdi
callq 0x21a0
movq 0x8(%r14), %rax
movq -0x8(%rax), %r15
testq %r15, %r15
je 0x1474d
movq %r15, %rdi
callq 0x13790
movq %r15, %rdi
callq 0x21a0
addq $-0x8, 0x8(%r14)
movb $0x1, 0x199(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x540d(%rip), %rdi      # 0x19b7b
leaq 0x5354(%rip), %rsi      # 0x19ac9
leaq 0x5459(%rip), %rcx      # 0x19bd5
movl $0x15e, %edx            # imm = 0x15E
callq 0x2110
// File: /workspace/github_cpp_makefile_star2_O3/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 0x148e3
movl 0x114(%r14), %esi
addq $-0x2, %rdx
cmpq %rsi, %rdx
jne 0x148e3
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 0x14815
movq 0x120(%r15), %rsi
movq (%rsi), %rdx
movq 0x8(%rsi), %rsi
cmpq %rsi, %rdx
je 0x1480c
movl (%rax), %r8d
movq %rdx, %r9
cmpl (%r9), %r8d
je 0x148c4
addq $0x4, %r9
cmpq %rsi, %r9
jne 0x147fa
addq $0x4, %rax
cmpq %rcx, %rax
jne 0x147ef
movq %rdi, 0x120(%r14)
movq 0x8(%rdi), %rsi
movq 0x120(%r15), %rax
movq (%rax), %rdx
movq 0x8(%rax), %rcx
callq 0xe46c
leaq 0x30(%r14), %rdi
callq 0x6fa6
leaq 0x80(%r14), %rdi
movq 0x120(%r14), %rdx
addq $0x50, %r14
movq %r14, %rsi
callq 0x16e76
movq 0x120(%r15), %r14
testq %r14, %r14
je 0x1486f
movq (%r14), %rdi
testq %rdi, %rdi
je 0x1486f
callq 0x21a0
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x1488c
movq %r14, %rdi
callq 0x13790
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 0x148b1
movq %r14, %rdi
callq 0x13790
movq %r14, %rdi
callq 0x21a0
addq $-0x8, 0x8(%rbx)
popq %rbx
popq %r14
popq %r15
retq
leaq 0x47b9(%rip), %rdi      # 0x19084
leaq 0x51f7(%rip), %rsi      # 0x19ac9
leaq 0x5324(%rip), %rcx      # 0x19bfd
movl $0x14b, %edx            # imm = 0x14B
callq 0x2110
leaq 0x5291(%rip), %rdi      # 0x19b7b
leaq 0x51d8(%rip), %rsi      # 0x19ac9
leaq 0x5305(%rip), %rcx      # 0x19bfd
movl $0x147, %edx            # imm = 0x147
callq 0x2110
// File: /workspace/github_cpp_makefile_star2_O3/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 0x149f4
movl 0x114(%rsi), %edi
addq $-0x2, %rdx
cmpq %rdi, %rdx
jne 0x149f4
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 (%r14), %rdi
movq 0x8(%r14), %r8
subq %rdi, %r8
movq 0x8(%rdx), %r9
subq (%rdx), %r9
cmpq %r9, %r8
jbe 0x1498e
movl (%rcx), %ecx
movl %ecx, (%rsi)
movq %r14, 0x120(%rsi)
movq 0x120(%rax), %r14
testq %r14, %r14
je 0x1499a
movq (%r14), %rdi
testq %rdi, %rdi
je 0x1499d
callq 0x21a0
jmp 0x1499d
xorl %r14d, %r14d
movq %r14, %rdi
callq 0x21a0
movq 0x8(%rbx), %rax
movq -0x8(%rax), %r14
testq %r14, %r14
je 0x149ba
movq %r14, %rdi
callq 0x13790
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 0x149df
movq %r14, %rdi
callq 0x13790
movq %r14, %rdi
callq 0x21a0
addq $-0x8, 0x8(%rbx)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
leaq 0x5180(%rip), %rdi      # 0x19b7b
leaq 0x50c7(%rip), %rsi      # 0x19ac9
leaq 0x5216(%rip), %rcx      # 0x19c1f
movl $0x134, %edx            # imm = 0x134
callq 0x2110
nop
// File: /workspace/github_cpp_makefile_star2_O3/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 0xc092
movq 0x8(%rsp), %rsi
cmpq 0x10(%rsp), %rsi
je 0x16403
movl (%r15), %eax
movl %eax, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%rsp)
jmp 0x1640e
movq %rsp, %rdi
movq %r15, %rdx
callq 0xd7b4
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 0x16457
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 0x2cca
movq %rsp, %rsi
movq %r14, %rdi
movq %rbx, %rdx
callq 0x164c0
movl %eax, %ebp
movq 0x18(%rbx), %rbx
leaq 0x20(%rsp), %rdi
callq 0xc950
movq (%rsp), %rdi
testq %rdi, %rdi
je 0x16483
callq 0x21a0
addl %ebp, %ebp
subl %ebx, %ebp
movl %ebp, %eax
addq $0x58, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
jmp 0x16498
jmp 0x164a7
movq %rax, %rbx
leaq 0x20(%rsp), %rdi
callq 0xc950
jmp 0x164aa
movq %rax, %rbx
movq (%rsp), %rdi
testq %rdi, %rdi
je 0x164b8
callq 0x21a0
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O3/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 0x16537
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 0x1652a
movl 0x8(%rbx), %eax
movl %eax, (%rsp)
movq %r14, %rdi
movq %r15, %rsi
movq %r12, %rdx
callq 0xbf3a
xorl %ecx, %ecx
cmpl $-0x1, %eax
setne %cl
addl %ecx, %ebp
movq (%rbx), %rbx
jmp 0x16502
addq $0x4, %r13
cmpq 0x8(%rsp), %r13
jne 0x164f1
jmp 0x16539
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_O3/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 %rcx, %r15
movq %rsi, 0x8(%rsp)
movq %rdi, %rbx
addq $0x18, %rbx
movb $0x1, %bpl
leaq 0x10(%rsp), %r13
movq %rdx, (%rsp)
movq %rdx, %rax
movq (%rax), %r14
movq 0x8(%rax), %r12
cmpq %r12, %r14
je 0x16d6c
movl (%r14), %eax
movl %eax, 0x10(%rsp)
movq %rbx, %rdi
movq %r13, %rsi
callq 0x17b80
testq %rax, %rax
je 0x16d66
movb $0x0, 0x40(%rax)
addq $0x4, %r14
jmp 0x16d46
movq %r15, %rax
testb $0x1, %bpl
movl $0x0, %ebp
jne 0x16d3f
leaq 0x50(%rsp), %r13
movq %r13, %rdi
movq (%rsp), %rsi
movq %r15, %rdx
callq 0x17738
movq 0x8(%rsp), %rax
movl (%rax), %eax
leaq 0x10(%rsp), %rsi
movl %eax, (%rsi)
movaps (%r13), %xmm0
movups %xmm0, 0x8(%rsi)
movq 0x10(%r13), %rax
movq %rax, 0x18(%rsi)
xorps %xmm0, %xmm0
movaps %xmm0, (%r13)
xorl %eax, %eax
movq %rax, 0x10(%r13)
movups 0x18(%r13), %xmm1
movups %xmm1, 0x20(%rsi)
movq 0x28(%r13), %rcx
movq %rcx, 0x30(%rsi)
movups %xmm0, 0x18(%r13)
movq %rax, 0x28(%r13)
movb 0x30(%r13), %al
movb %al, 0x38(%rsi)
movq %rbx, %rdi
callq 0x17c9c
testb $0x1, %dl
je 0x16e37
movq 0x30(%rsp), %rdi
testq %rdi, %rdi
je 0x16df8
callq 0x21a0
movq 0x18(%rsp), %rdi
testq %rdi, %rdi
je 0x16e07
callq 0x21a0
movq 0x68(%rsp), %rdi
testq %rdi, %rdi
je 0x16e16
callq 0x21a0
movq 0x50(%rsp), %rdi
testq %rdi, %rdi
je 0x16e25
callq 0x21a0
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x2f8b(%rip), %rdi      # 0x19dc9
leaq 0x2fd1(%rip), %rsi      # 0x19e16
leaq 0x2fd6(%rip), %rcx      # 0x19e22
movl $0x13, %edx
callq 0x2110
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x17778
leaq 0x50(%rsp), %rdi
callq 0x1779c
movq %rbx, %rdi
callq 0x2320
nop
// File: /workspace/github_cpp_makefile_star2_O3/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 0xbd9c
movq %r15, %rdi
movq %r15, %rsi
movq %rbx, %rdx
callq 0x177be
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x177be
movq %r15, %rdi
movq %rbx, %rsi
popq %rbx
popq %r14
popq %r15
jmp 0x16ed2
nop
// File: /workspace/github_cpp_makefile_star2_O3/iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::expandExcludedNodes(std::vector<unsigned int, std::allocator<unsigned int>>&)
void Mis::expandExcludedNodes(vector<uint32_t> &finalMis) {
    while (!hypernodeToInnernode.empty()) {
        auto hypernode = hypernodeToInnernode.begin();
        while (!hypernode->second.outerLevel) {
            hypernode++;
        }
        for (auto node : hypernode->second.nodes) {
            auto nestedHypernode = hypernodeToInnernode.find(node);
            if (nestedHypernode != hypernodeToInnernode.end()) {
                assert(!nestedHypernode->second.outerLevel);
                nestedHypernode->second.outerLevel = true;
            }
            mis.push_back(node);
        }
        for (auto node : hypernode->second.neighbors) {
            auto innerHypernode = hypernodeToInnernode.find(node);
            if (innerHypernode != hypernodeToInnernode.end()) {
                assert(!innerHypernode->second.outerLevel);
                innerHypernode->second.outerLevel = true;
            }
        }
        hypernodeToInnernode.erase(hypernode);
        expandIncludedNodes(mis, finalMis);
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rsi, 0x10(%rsp)
cmpq $0x0, 0x30(%rdi)
je 0x16fc7
movq %rdi, %r14
leaq 0x18(%rdi), %r15
leaq 0x28(%rdi), %rbp
movq %rsp, %r13
movq %rbp, 0x8(%rsp)
movq (%rbp), %rbp
cmpb $0x1, 0x40(%rbp)
jne 0x16f03
movq 0x10(%rbp), %rbx
movq 0x18(%rbp), %r12
cmpq %r12, %rbx
je 0x16f67
movl (%rbx), %eax
movl %eax, (%rsp)
movq %r15, %rdi
movq %r13, %rsi
callq 0x17b80
testq %rax, %rax
je 0x16f3d
cmpb $0x1, 0x40(%rax)
je 0x16fd6
movb $0x1, 0x40(%rax)
movq 0x8(%r14), %rsi
cmpq 0x10(%r14), %rsi
je 0x16f56
movl (%rsp), %eax
movl %eax, (%rsi)
addq $0x4, %rsi
movq %rsi, 0x8(%r14)
jmp 0x16f61
movq %r14, %rdi
movq %r13, %rdx
callq 0xd7b4
addq $0x4, %rbx
jmp 0x16f15
movq 0x28(%rbp), %rbx
movq 0x30(%rbp), %r12
cmpq %r12, %rbx
je 0x16f9c
movl (%rbx), %eax
movl %eax, 0x4(%rsp)
movq %r15, %rdi
leaq 0x4(%rsp), %rsi
callq 0x17b80
testq %rax, %rax
je 0x16f96
cmpb $0x1, 0x40(%rax)
je 0x16ff5
movb $0x1, 0x40(%rax)
addq $0x4, %rbx
jmp 0x16f6f
movq %r15, %rdi
movq %rbp, %rsi
callq 0x17bdc
movq %r14, %rdi
movq %r14, %rsi
movq 0x10(%rsp), %rdx
callq 0x177be
cmpq $0x0, 0x30(%r14)
movq 0x8(%rsp), %rbp
jne 0x16f03
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x2f37(%rip), %rdi      # 0x19f14
leaq 0x2e32(%rip), %rsi      # 0x19e16
leaq 0x2f4d(%rip), %rcx      # 0x19f38
movl $0x36, %edx
callq 0x2110
leaq 0x2f6e(%rip), %rdi      # 0x19f6a
leaq 0x2e13(%rip), %rsi      # 0x19e16
leaq 0x2f2e(%rip), %rcx      # 0x19f38
movl $0x3e, %edx
callq 0x2110
// File: /workspace/github_cpp_makefile_star2_O3/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 0xafaa(%rip), %r14      # 0x21fd0
leaq 0x2e53(%rip), %rsi      # 0x19e80
movl $0x29, %edx
movq %r14, %rdi
callq 0x2200
movq 0xb19f(%rip), %rsi      # 0x221e0
movq 0xb1a0(%rip), %rdx      # 0x221e8
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 0x2e29(%rip), %rsi      # 0x19eaa
movl $0x1e, %edx
movq %r14, %rdi
callq 0x2200
movq 0x8(%rbx), %rsi
subq (%rbx), %rsi
sarq $0x2, %rsi
movq %r14, %rdi
callq 0x2120
leaq 0x24de(%rip), %rsi      # 0x19586
movl $0x1, %edx
movq %rax, %rdi
callq 0x2200
movq 0xb124(%rip), %rdi      # 0x221e0
leaq 0x2e06(%rip), %rsi      # 0x19ec9
callq 0x2230
testq %rax, %rax
je 0x1712b
movq %rax, %r14
movq 0x8(%rbx), %rdx
subq (%rbx), %rdx
sarq $0x2, %rdx
leaq 0x2e0b(%rip), %rsi      # 0x19eed
movq %rax, %rdi
xorl %eax, %eax
callq 0x2270
movq (%rbx), %r15
movq 0x8(%rbx), %r12
cmpq %r12, %r15
je 0x17118
leaq 0x2e11(%rip), %rbx      # 0x19f10
movl (%r15), %edx
movq %r14, %rdi
movq %rbx, %rsi
xorl %eax, %eax
callq 0x2270
addq $0x4, %r15
cmpq %r12, %r15
jne 0x170ff
movq %r14, %rdi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x21d0
movq 0xaebe(%rip), %rdi      # 0x21ff0
leaq 0x2d92(%rip), %rsi      # 0x19ecb
callq 0x21c0
leaq 0xb09b(%rip), %rsi      # 0x221e0
movq %rax, %rdi
callq 0x2190
movq %rax, %rdi
callq 0x20b0
movl $0x1, %edi
callq 0x2240
nop
// File: /workspace/github_cpp_makefile_star2_O3/iPapatsoris[P]Maximum-Independent-Set/src/Mis.cpp
// Function: Mis::removeSubsequentNodes(std::unordered_set<unsigned int, std::hash<unsigned int>, std::equal_to<unsigned int>, std::allocator<unsigned int>>&)
void Mis::removeSubsequentNodes(unordered_set<uint32_t> &nodes) {
    removeHypernodes(nodes);
    unordered_set<uint32_t> toRemove;
    for (auto s: subsequentNodes) {
        if (nodes.find(s.second) == nodes.end()) {
            toRemove.insert(s.first);
        }
    }
    for (auto i: toRemove) {
        subsequentNodes.erase(i);
    }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, %r14
movq %rdi, %rbx
callq 0x17160
leaq 0x40(%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)
movq 0x60(%rbx), %r13
testq %r13, %r13
je 0x17495
addq $0x50, %rbx
leaq 0xc(%rsp), %r15
leaq 0x10(%rsp), %r12
movq %rsp, %rbp
movq 0x8(%r13), %rax
movq %rax, 0x8(%rsp)
movq %r14, %rdi
movq %r15, %rsi
callq 0xdcaa
testq %rax, %rax
jne 0x17465
movq %r12, (%rsp)
movq %r12, %rdi
leaq 0x8(%rsp), %rsi
movq %rbp, %rdx
callq 0xd538
movq (%r13), %r13
testq %r13, %r13
jne 0x17438
movq 0x20(%rsp), %r15
testq %r15, %r15
je 0x17495
movq %rsp, %r14
movl 0x8(%r15), %eax
movl %eax, (%rsp)
movq %rbx, %rdi
movq %r14, %rsi
callq 0x17ff6
movq (%r15), %r15
testq %r15, %r15
jne 0x1747b
leaq 0x10(%rsp), %rdi
callq 0xc950
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x174b2
jmp 0x174b2
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0xc950
movq %rbx, %rdi
callq 0x2320
nop
// File: /workspace/github_cpp_makefile_star2_O3/iPapatsoris[P]Maximum-Independent-Set/src/ControlUnit.cpp
// Function: main
int main(int argc, char **argv) {
    string graphInputFile;
    bool checkIndependentSet = false;
    for (int i=1 ; i < argc ; i++) {
        if (!strcmp(argv[i], "-check")) {
            checkIndependentSet = true;
        } else {
            graphInputFile = argv[i];
        }
   }
   if (!graphInputFile.compare("")) {
       cerr << "Error: No graph input file specified" << endl;
       exit(EXIT_FAILURE);
   }
   ControlUnit controlUnit(graphInputFile, checkIndependentSet);
   if (!checkIndependentSet) {
       controlUnit.run();
   } else {
       controlUnit.checkIndependentSet(graphInputFile + ".mis");
   }
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
leaq 0x20(%rsp), %rcx
movq %rcx, -0x10(%rcx)
movq $0x0, -0x8(%rcx)
xorl %eax, %eax
movb %al, (%rcx)
movb %al, 0xf(%rsp)
cmpl $0x2, %edi
jl 0x180da
movq %rsi, %rbx
movl %edi, %ebp
movl $0x1, %r15d
leaq 0x1fc9(%rip), %r14      # 0x1a05f
movq (%rbx,%r15,8), %r12
movq %r12, %rdi
movq %r14, %rsi
callq 0x2260
testl %eax, %eax
je 0x180cd
movq 0x18(%rsp), %r13
movq %r12, %rdi
callq 0x20a0
leaq 0x10(%rsp), %rdi
xorl %esi, %esi
movq %r13, %rdx
movq %r12, %rcx
movq %rax, %r8
callq 0x22c0
jmp 0x180d2
movb $0x1, 0xf(%rsp)
incq %r15
cmpq %r15, %rbp
jne 0x18096
leaq 0x1491(%rip), %rsi      # 0x19572
leaq 0x10(%rsp), %rdi
callq 0x2070
testl %eax, %eax
je 0x18198
leaq 0x50(%rsp), %rdi
leaq 0x10(%rsp), %rsi
leaq 0xf(%rsp), %rdx
callq 0x13384
cmpb $0x0, 0xf(%rsp)
je 0x1815f
leaq 0x40(%rsp), %r14
movq %r14, -0x10(%r14)
movq 0x10(%rsp), %rsi
movq 0x18(%rsp), %rdx
addq %rsi, %rdx
leaq 0x30(%rsp), %rdi
callq 0x16aac
leaq 0x18e3(%rip), %rsi      # 0x19a18
leaq 0x30(%rsp), %rdi
callq 0x2340
leaq 0x50(%rsp), %rdi
leaq 0x30(%rsp), %rsi
callq 0x18216
movq 0x30(%rsp), %rdi
cmpq %r14, %rdi
je 0x18169
callq 0x21a0
jmp 0x18169
leaq 0x50(%rsp), %rdi
callq 0x1382c
leaq 0x50(%rsp), %rdi
callq 0x13476
movq 0x10(%rsp), %rdi
leaq 0x20(%rsp), %rax
cmpq %rax, %rdi
je 0x18187
callq 0x21a0
xorl %eax, %eax
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq 0x9e51(%rip), %rdi      # 0x21ff0
leaq 0x1ec0(%rip), %rsi      # 0x1a066
movl $0x24, %edx
callq 0x2200
movq 0x9e39(%rip), %rdi      # 0x21ff0
callq 0x20b0
movl $0x1, %edi
callq 0x2240
jmp 0x181c8
movq %rax, %rbx
movq 0x30(%rsp), %rdi
cmpq %r14, %rdi
je 0x181e1
callq 0x21a0
jmp 0x181e1
jmp 0x181de
movq %rax, %rbx
leaq 0x50(%rsp), %rdi
callq 0x13476
jmp 0x181f4
jmp 0x181f1
jmp 0x181f1
movq %rax, %rbx
movq 0x10(%rsp), %rdi
leaq 0x20(%rsp), %rax
cmpq %rax, %rdi
je 0x18208
callq 0x21a0
movq %rbx, %rdi
callq 0x2320
// File: /workspace/github_cpp_makefile_star2_O3/iPapatsoris[P]Maximum-Independent-Set/src/Util.cpp
// Function: setsHaveKUncommonElements(std::vector<unsigned int, std::allocator<unsigned int>> const&, std::vector<unsigned int, std::allocator<unsigned int>> const&, unsigned int const&, unsigned int&)
bool setsHaveKUncommonElements(const vector<uint32_t> &container1, const vector<uint32_t> &container2, const uint32_t &k, uint32_t &uncommonElement) {
    uint32_t uncommonElements = 0;
    const vector<uint32_t> *containerPtr = &container1;
    auto begin = container2.begin();
    auto end = container2.end();
    for (uint32_t it = 0 ; it < 2 ; it++) {
        for (auto &i: *containerPtr) {
            if (!binary_search(begin, end, i)) {
                uncommonElements++;
                uncommonElement = i;
                if (uncommonElements > k) {
                    return false;
                }
            }
        }
        containerPtr = &container2;
        begin = container1.begin();
        end = container1.end();
    }
    return (uncommonElements == k);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rcx, 0x20(%rsp)
movq %rdx, %rbx
movb $0x1, %dl
xorl %r12d, %r12d
movq %rsi, 0x18(%rsp)
movq %rsi, %rax
movq %rdi, 0x10(%rsp)
movq %rdi, %rcx
movl %edx, 0xc(%rsp)
movq (%rcx), %r13
movq 0x8(%rcx), %r14
cmpq %r14, %r13
je 0x186df
movq (%rax), %rbp
movq 0x8(%rax), %r15
movq %rbp, %rdi
movq %r15, %rsi
movq %r13, %rdx
callq 0x1875f
testb %al, %al
jne 0x186d6
incl %r12d
movl (%r13), %eax
movq 0x20(%rsp), %rcx
movl %eax, (%rcx)
movl (%rbx), %eax
cmpl %eax, %r12d
ja 0x186fb
addq $0x4, %r13
cmpq %r14, %r13
jne 0x186af
movq 0x10(%rsp), %rax
movq 0x18(%rsp), %rcx
testb $0x1, 0xc(%rsp)
movl $0x0, %edx
jne 0x18698
movl (%rbx), %eax
movb $0x1, %cl
jmp 0x186fd
xorl %ecx, %ecx
cmpl %eax, %r12d
sete %al
andb %cl, %al
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_cpp_makefile_star2_O3/iZhangHui[P]CppPrimer/CH01_GettingStarted/examples/add_item.cc
// Function: main
int main() 
{
    Sales_item item1, item2;

    std::cin >> item1 >> item2;   //read a pair of transactions
    std::cout << item1 + item2 << std::endl; //print their sum

    return 0;
}

// Assembly:
pushq %rbp
movq %rsp, %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x90, %rsp
leaq -0x40(%rbp), %r14
movq %r14, -0x10(%r14)
xorl %eax, %eax
movq %rax, -0x8(%r14)
movb %al, (%r14)
movl %eax, 0x10(%r14)
movq %rax, 0x18(%r14)
leaq -0x70(%rbp), %r15
movq %r15, -0x10(%r15)
movq %rax, -0x8(%r15)
movb %al, (%r15)
movl %eax, 0x10(%r15)
movq %rax, 0x18(%r15)
movq 0x2ab8(%rip), %rdi      # 0x3fe0
leaq -0x50(%rbp), %rsi
callq 0x12f3
movq 0x2aa8(%rip), %rdi      # 0x3fe0
leaq -0x80(%rbp), %rsi
callq 0x12f3
leaq -0xa0(%rbp), %r12
movq %r12, -0x10(%r12)
movq -0x50(%rbp), %rsi
movq -0x48(%rbp), %rdx
addq %rsi, %rdx
leaq -0xb0(%rbp), %rdi
callq 0x1674
leaq -0x30(%rbp), %rax
movups (%rax), %xmm0
leaq -0xb0(%rbp), %rsi
movups %xmm0, 0x20(%rsi)
movl -0x60(%rbp), %eax
addl %eax, 0x20(%rsi)
movsd -0x58(%rbp), %xmm0
addsd 0x28(%rsi), %xmm0
movsd %xmm0, 0x28(%rsi)
movq 0x2a3e(%rip), %rbx      # 0x3fd0
movq %rbx, %rdi
callq 0x13b5
movq (%rbx), %rax
addq -0x18(%rax), %rbx
movq %rbx, %rdi
movl $0xa, %esi
callq 0x10a0
movsbl %al, %esi
movq 0x2a18(%rip), %rdi      # 0x3fd0
callq 0x1030
movq %rax, %rdi
callq 0x1060
movq -0xb0(%rbp), %rdi
cmpq %r12, %rdi
je 0x15e0
movq -0xa0(%rbp), %rsi
incq %rsi
callq 0x10b0
movq -0x80(%rbp), %rdi
cmpq %r15, %rdi
je 0x15f5
movq -0x70(%rbp), %rsi
incq %rsi
callq 0x10b0
movq -0x50(%rbp), %rdi
cmpq %r14, %rdi
je 0x160a
movq -0x40(%rbp), %rsi
incq %rsi
callq 0x10b0
xorl %eax, %eax
addq $0x90, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
jmp 0x161e
movq %rax, %rbx
jmp 0x1641
movq %rax, %rbx
movq -0xb0(%rbp), %rdi
cmpq %r12, %rdi
je 0x1641
movq -0xa0(%rbp), %rsi
incq %rsi
callq 0x10b0
movq -0x80(%rbp), %rdi
cmpq %r15, %rdi
je 0x1656
movq -0x70(%rbp), %rsi
incq %rsi
callq 0x10b0
movq -0x50(%rbp), %rdi
cmpq %r14, %rdi
je 0x166b
movq -0x40(%rbp), %rsi
incq %rsi
callq 0x10b0
movq %rbx, %rdi
callq 0x1120
nop
// File: /workspace/github_cpp_makefile_star2_O3/statgen[P]statgen/lib/tclap-1.2.0/examples/test10.cpp
// Function: main
int main()
{
	char *argv5[] = {"Foo", 0};
	const char *argv6[] = {"Foo", 0};
	const char * const argv7[] = {"Foo", 0};
	char **argv1 = argv5;
	const char **argv2 = argv6;
	const char * const * argv3 = argv7;
	const char * const * const argv4 = argv7;

	CmdLine cmd("Command description message", ' ', "0.9");
	cmd.parse(0, argv1);
	cmd.parse(0, argv2);
	cmd.parse(0, argv3);
	cmd.parse(0, argv4);
	cmd.parse(0, argv5);
	cmd.parse(0, argv6);
	cmd.parse(0, argv7);
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
subq $0x120, %rsp            # imm = 0x120
leaq 0x10(%rsp), %r14
movq %r14, -0x10(%r14)
leaq 0x6b56(%rip), %rsi      # 0xa03e
leaq 0x6b6a(%rip), %rdx      # 0xa059
movq %rsp, %rdi
callq 0x6a78
leaq 0x30(%rsp), %r15
movq %r15, -0x10(%r15)
leaq 0x6b53(%rip), %rsi      # 0xa05a
leaq 0x6b4f(%rip), %rdx      # 0xa05d
leaq 0x20(%rsp), %rdi
callq 0x6a78
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
leaq 0x20(%rsp), %rcx
movl $0x20, %edx
movl $0x1, %r8d
callq 0x4e8e
movq 0x20(%rsp), %rdi
cmpq %r15, %rdi
je 0x354c
movq 0x30(%rsp), %rsi
incq %rsi
callq 0x3190
movq (%rsp), %rdi
cmpq %r14, %rdi
je 0x3562
movq 0x10(%rsp), %rsi
incq %rsi
callq 0x3190
xorps %xmm0, %xmm0
movq %rsp, %rsi
movaps %xmm0, (%rsi)
movq $0x0, 0x10(%rsi)
leaq 0x40(%rsp), %rdi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rbx
movq %rbx, %rdi
callq 0x8e54
xorps %xmm0, %xmm0
movaps %xmm0, (%rbx)
movq $0x0, 0x10(%rbx)
leaq 0x40(%rsp), %rdi
movq %rsp, %rsi
callq 0x8a26
movq %rsp, %rdi
callq 0x8e54
leaq 0x40(%rsp), %rdi
callq 0x4d70
xorl %eax, %eax
addq $0x120, %rsp            # imm = 0x120
popq %rbx
popq %r14
popq %r15
retq
jmp 0x368e
jmp 0x368e
jmp 0x368e
jmp 0x368e
jmp 0x368e
jmp 0x368e
movq %rax, %rbx
movq %rsp, %rdi
callq 0x8e54
leaq 0x40(%rsp), %rdi
callq 0x4d70
movq %rbx, %rdi
callq 0x32a0
movq %rax, %rbx
movq 0x20(%rsp), %rdi
cmpq %r15, %rdi
je 0x36ca
movq 0x30(%rsp), %rsi
incq %rsi
callq 0x3190
jmp 0x36ca
movq %rax, %rbx
movq (%rsp), %rdi
cmpq %r14, %rdi
je 0x36a3
movq 0x10(%rsp), %rsi
incq %rsi
callq 0x3190
jmp 0x36a3
movq %rax, %rbx
jmp 0x36a3
nop