LLM4Binary/decompile-bench-makefile huggingface dataset:
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/minhashing.c
// Function: fullEmbeddingProjectionApproximationForTrees
int* fullEmbeddingProjectionApproximationForTrees(struct Graph* g, struct EvaluationPlan p, int* projection, int projectionSize, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=0; i<projectionSize; ++i) {
		// if we don't know the value we need to compute it.
		int currentGraphNumber = projection[i];
		if (!embeddingValueKnown(p.poset->vertices[currentGraphNumber])) {
			// evaluate the embedding operator
			struct Graph* currentGraph = (struct Graph*)(p.poset->vertices[currentGraphNumber]->label);
			char match = isSubtree(g, currentGraph, gp);
			++nEvaluations;
			updateEvaluationPlan(p, currentGraphNumber, match);
		}
	}

	int* approximateEmbedding = malloc((p.poset->n - 1) * sizeof(int));
	if (!approximateEmbedding) {
		fprintf(stderr, "Could not allocate memory for sketch. This is a bad thing.\n");
		return NULL;
	}

	for (int i=1; i<p.poset->n; ++i) {
		approximateEmbedding[i-1] = p.poset->vertices[i]->visited; // init sketch values to 'infty'
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return approximateEmbedding;

}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, 0x40(%rsp)
movl %edx, %r15d
movq %rsi, %r12
movq %rdi, 0x38(%rsp)
leaq 0x80(%rsp), %rax
movq (%rax), %r13
movq 0x8(%rax), %rax
movl (%r13), %ecx
xorl %edx, %edx
testl %ecx, %ecx
cmovlel %edx, %ecx
cmpq %rdx, %rcx
je 0x12d55
movq 0x10(%r13), %rsi
movq (%rsi,%rdx,8), %rsi
andl $0x0, 0x1c(%rsi)
movq 0x10(%rax), %rsi
movq (%rsi,%rdx,8), %rsi
andl $0x0, 0x1c(%rsi)
incq %rdx
jmp 0x12d33
xorl %r14d, %r14d
testl %r15d, %r15d
cmovlel %r14d, %r15d
xorl %ebx, %ebx
cmpq %r14, %r15
je 0x12dbc
movslq (%r12,%r14,4), %rbp
movq 0x10(%r13), %rax
movq (%rax,%rbp,8), %rax
cmpl $0x0, 0x1c(%rax)
jne 0x12db7
movq (%rax), %rsi
movq 0x38(%rsp), %rdi
movq 0x40(%rsp), %rdx
callq 0x86b2
incl %ebx
leaq 0x80(%rsp), %rcx
movups (%rcx), %xmm0
movups 0x10(%rcx), %xmm1
movups 0x20(%rcx), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movsbl %al, %esi
movl %ebp, %edi
callq 0x120b2
incq %r14
jmp 0x12d61
movslq (%r13), %r15
leaq -0x4(,%r15,4), %rdi
callq 0x1180
movq %rax, %r14
testq %rax, %rax
jne 0x12df3
movq 0x1721c(%rip), %rax     # 0x29ff8
movq (%rax), %rcx
leaq 0xade0(%rip), %rdi      # 0x1dbc6
pushq $0x3b
popq %rsi
pushq $0x1
popq %rdx
callq 0x1210
jmp 0x12e2a
pushq $0x1
popq %rax
cmpq %r15, %rax
jge 0x12e10
movq 0x10(%r13), %rcx
movq (%rcx,%rax,8), %rcx
movl 0x1c(%rcx), %ecx
movl %ecx, -0x4(%r14,%rax,4)
incq %rax
jmp 0x12df6
movq 0x171e1(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0xa215(%rip), %rsi      # 0x1d036
movl %ebx, %edx
xorl %eax, %eax
callq 0x1150
movq %r14, %rax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/minhashing.c
// Function: randomProjectionEmbeddingForTrees
int* randomProjectionEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, int* projection, int projectionSize, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	// alloc output array
	int* approximateEmbedding = malloc(projectionSize * sizeof(int));
	if (!approximateEmbedding) {
		fprintf(stderr, "Could not allocate memory for sketch. This is a bad thing.\n");
		return NULL;
	}

	for (int i=0; i<projectionSize; ++i) {

		// if we don't know the value we need to compute it.
		int currentGraphNumber = projection[i];
		if (!embeddingValueKnown(p.poset->vertices[currentGraphNumber])) {

			// evaluate the embedding operator
			struct Graph* currentGraph = (struct Graph*)(p.poset->vertices[currentGraphNumber]->label);
			char match = isSubtree(g, currentGraph, gp);

			// update output
			approximateEmbedding[i] = match;

			// update evaluation Plan
			++nEvaluations;
			updateEvaluationPlan(p, currentGraphNumber, match);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return approximateEmbedding;

}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, 0x40(%rsp)
movl %edx, %r14d
movq %rsi, %r15
movq %rdi, 0x38(%rsp)
leaq 0x80(%rsp), %rax
movq (%rax), %r13
movq 0x8(%rax), %rax
movl (%r13), %ecx
xorl %edx, %edx
testl %ecx, %ecx
cmovlel %edx, %ecx
cmpq %rdx, %rcx
je 0x13098
movq 0x10(%r13), %rsi
movq (%rsi,%rdx,8), %rsi
andl $0x0, 0x1c(%rsi)
movq 0x10(%rax), %rsi
movq (%rsi,%rdx,8), %rsi
andl $0x0, 0x1c(%rsi)
incq %rdx
jmp 0x13076
movslq %r14d, %rdi
shlq $0x2, %rdi
callq 0x1180
movq %rax, 0x30(%rsp)
testq %rax, %rax
jne 0x130cf
movq 0x16f43(%rip), %rax     # 0x29ff8
movq (%rax), %rcx
leaq 0xab07(%rip), %rdi      # 0x1dbc6
pushq $0x3b
popq %rsi
pushq $0x1
popq %rdx
callq 0x1210
jmp 0x13159
xorl %r12d, %r12d
testl %r14d, %r14d
cmovlel %r12d, %r14d
xorl %ebp, %ebp
cmpq %r12, %r14
je 0x1313f
movslq (%r15,%r12,4), %rbx
movq 0x10(%r13), %rax
movq (%rax,%rbx,8), %rax
cmpl $0x0, 0x1c(%rax)
jne 0x1313a
movq (%rax), %rsi
movq 0x38(%rsp), %rdi
movq 0x40(%rsp), %rdx
callq 0x86b2
movsbl %al, %esi
movq 0x30(%rsp), %rax
movl %esi, (%rax,%r12,4)
incl %ebp
leaq 0x80(%rsp), %rax
movups (%rax), %xmm0
movups 0x10(%rax), %xmm1
movups 0x20(%rax), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movl %ebx, %edi
callq 0x120b2
incq %r12
jmp 0x130db
movq 0x16eb2(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x9ee6(%rip), %rsi      # 0x1d036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1150
movq 0x30(%rsp), %rax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/newCube.c
// Function: printNewCubeCondensed
void printNewCubeCondensed(uint8_t* S, int gn, int hn, FILE* out) {
	if (S == NULL) {
		fprintf(out, "(NULL)\n");
		return;
	}
	for (int v=0; v<gn; ++v) {
		for (int u=0; u<hn; ++u) {
			fprintf(out, "(%i, %i): ", v, u);
			for (int y=0; y<hn; ++y) {
				if (getBit(S, getCharacteristicPosition(y, u, v, hn))) {
					fprintf(out, " %i", y);
				}
			}
			if (getBit(S, getCharacteristicPosition(u,u,v,hn))) {
				fprintf(out, " <- !");
			}
			fprintf(out, "\n");
		}
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
testq %rdi, %rdi
je 0x1359e
movq %rdi, %r15
movslq %edx, %r13
xorl %eax, %eax
testl %r13d, %r13d
movl $0x0, %ecx
cmovgl %r13d, %ecx
movq %rcx, 0x40(%rsp)
testl %esi, %esi
cmovlel %eax, %esi
movl %r13d, %r12d
movq %r13, %rax
imulq %r13, %rax
movq %rax, 0x10(%rsp)
xorl %r14d, %r14d
xorl %edx, %edx
movq %rsi, 0x18(%rsp)
movq %r13, 0x28(%rsp)
cmpq %rsi, %rdx
je 0x1358f
movq %rdx, %rax
imulq %r13, %rax
movq %rax, 0x30(%rsp)
movq %r14, 0x20(%rsp)
xorl %ebp, %ebp
movq %rdx, 0x38(%rsp)
cmpq 0x40(%rsp), %rbp
je 0x13578
movq %rbx, %rdi
leaq 0xa796(%rip), %rsi      # 0x1dc75
movl %ebp, %ecx
xorl %eax, %eax
callq 0x1150
movq 0x30(%rsp), %rax
movq %rbp, 0x8(%rsp)
addq %rax, %rbp
imulq %r13, %rbp
xorl %r13d, %r13d
cmpq %r13, %r12
je 0x1352a
leaq (%r14,%r13), %rsi
movq %r15, %rdi
callq 0x1d39
testb %al, %al
je 0x13525
movq %rbx, %rdi
leaq 0xb02e(%rip), %rsi      # 0x1e549
movl %r13d, %edx
xorl %eax, %eax
callq 0x1150
incq %r13
jmp 0x134fc
addq 0x8(%rsp), %rbp
movq %r15, %rdi
movq %rbp, %rsi
callq 0x1d39
testb %al, %al
je 0x13553
leaq 0xa73b(%rip), %rdi      # 0x1dc80
pushq $0x5
popq %rsi
pushq $0x1
popq %rdx
movq %rbx, %rcx
callq 0x1210
pushq $0xa
popq %rdi
movq %rbx, %rsi
callq 0x1100
movq 0x8(%rsp), %rbp
incq %rbp
movq 0x28(%rsp), %r13
addq %r13, %r14
movq 0x38(%rsp), %rdx
jmp 0x134ca
incq %rdx
movq 0x20(%rsp), %r14
addq 0x10(%rsp), %r14
movq 0x18(%rsp), %rsi
jmp 0x134a9
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0xa6c8(%rip), %rdi      # 0x1dc6d
pushq $0x7
popq %rsi
pushq $0x1
popq %rdx
movq %rbx, %rcx
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x1210
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/newCube.c
// Function: printNewCube
void printNewCube(uint8_t* S, int gn, int hn, FILE* out) {
	for (int v=0; v<gn; ++v) {
		for (int u=0; u<hn; ++u) {
			fprintf(out, "(%i, %i): ", v, u);
			for (int y=0; y<hn; ++y) {
				fprintf(out, "%i", getBit(S, getCharacteristicPosition(y, u, v, hn)));
			}
			fprintf(out, "\n");
		}
	}
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rcx, %rbx
movslq %edx, %rcx
xorl %eax, %eax
testl %ecx, %ecx
movl $0x0, %edx
cmovgl %ecx, %edx
movq %rdx, 0x38(%rsp)
movq %rdi, %r15
testl %esi, %esi
cmovlel %eax, %esi
movq %rsi, 0x10(%rsp)
movl %ecx, %eax
movq %rax, 0x20(%rsp)
movq %rcx, 0x28(%rsp)
imulq %rcx, %rcx
movq %rcx, 0x8(%rsp)
leaq 0xaf3b(%rip), %r13      # 0x1e54a
xorl %ebp, %ebp
xorl %edx, %edx
cmpq 0x10(%rsp), %rdx
je 0x136a7
movq %rbp, 0x18(%rsp)
xorl %r12d, %r12d
movq %rdx, 0x30(%rsp)
cmpq 0x38(%rsp), %r12
je 0x13695
movq %rbx, %rdi
leaq 0xa639(%rip), %rsi      # 0x1dc75
movl %r12d, %ecx
xorl %eax, %eax
callq 0x1150
movq %rbp, 0x40(%rsp)
movq 0x20(%rsp), %r14
subq $0x1, %r14
jb 0x13676
movq %r15, %rdi
movq %rbp, %rsi
callq 0x1d39
movzbl %al, %edx
movq %rbx, %rdi
movq %r13, %rsi
xorl %eax, %eax
callq 0x1150
incq %rbp
jmp 0x13650
pushq $0xa
popq %rdi
movq %rbx, %rsi
callq 0x1100
incq %r12
movq 0x40(%rsp), %rbp
addq 0x28(%rsp), %rbp
movq 0x30(%rsp), %rdx
jmp 0x1362b
incq %rdx
movq 0x18(%rsp), %rbp
addq 0x8(%rsp), %rbp
jmp 0x13613
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isPath
char isPath(struct 	Graph* tree) {
	if (tree->m != tree->n - 1) { return 0; }
	for (int v=0; v<tree->n; ++v) {
		if (degree(tree->vertices[v]) > 2) {
			return 0;
		}
	}
	return 1;
}

// Assembly:
movl (%rdi), %eax
decl %eax
cmpl %eax, 0x4(%rdi)
jne 0x13d90
pushq %r15
pushq %r14
pushq %rbx
movq %rdi, %rbx
xorl %ecx, %ecx
movq %rcx, %r14
movslq (%rbx), %r15
cmpq %r15, %rcx
jge 0x13d84
movq 0x10(%rbx), %rax
movq (%rax,%r14,8), %rdi
callq 0x5a8a
leaq 0x1(%r14), %rcx
cmpl $0x3, %eax
jl 0x13d63
cmpq %r15, %r14
setge %al
popq %rbx
popq %r14
popq %r15
retq
xorl %eax, %eax
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isCactus
char isCactus(struct Graph* g, struct ShallowGraphPool* sgp) {

	/* the empty graph and singleton vertices are cactus graphs */
	if (g->n <= 1) {
		return 1;
	}

	if (isConnected(g)) {
		struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
		struct ShallowGraph* comp;
		int compNumber = 0;
		for (comp = biconnectedComponents; comp!=NULL; comp=comp->next) {
			if (comp->m > 1) {
				++compNumber;
			}			
		}
		/* cleanup */
		dumpShallowGraphCycle(sgp, biconnectedComponents);
		return g->m - compNumber == g->n - 1 ? 1 : 0;
	} else {
		return 0;
	}
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movb $0x1, %bl
cmpl $0x2, (%rdi)
jl 0x13e0c
movq %rsi, %r15
movq %rdi, %r14
callq 0x348d
xorl %ebx, %ebx
testb %al, %al
je 0x13e0c
movq %r14, %rdi
movq %r15, %rsi
callq 0x8ccd
movq %rax, %rcx
testq %rcx, %rcx
je 0x13df1
xorl %edx, %edx
cmpl $0x2, 0x10(%rcx)
setge %dl
addl %edx, %ebx
movq 0x18(%rcx), %rcx
jmp 0x13ddb
movq %r15, %rdi
movq %rax, %rsi
callq 0x11888
movl (%r14), %eax
movl 0x4(%r14), %ecx
subl %ebx, %ecx
decl %eax
cmpl %eax, %ecx
sete %bl
movl %ebx, %eax
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isOuterplanarGraph
char isOuterplanarGraph(struct Graph* g, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct ShallowGraph* biconnectedComponents = listBiconnectedComponents(g, sgp);
	struct ShallowGraph* comp;
	char isOp = 1;
	for (comp = biconnectedComponents; comp!=NULL; comp=comp->next) {
		if (comp->m > 1) {
			isOp = isOuterplanarBlockShallow(comp, sgp, gp);
			if (isOp == 0) {
				break;
			}
		}			
	}
	/* cleanup */
	dumpShallowGraphCycle(sgp, biconnectedComponents);
	return isOp;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rdx, %r15
movq %rsi, %rbx
callq 0x8ccd
movq %rax, %r14
movb $0x1, %bpl
movq %rax, %r12
testq %r12, %r12
je 0x13e5a
cmpl $0x2, 0x10(%r12)
jl 0x13e51
movq %r12, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x13e70
movl %eax, %ebp
testb %al, %al
je 0x13e58
movq 0x18(%r12), %r12
jmp 0x13e30
xorl %ebp, %ebp
movq %rbx, %rdi
movq %r14, %rsi
callq 0x11888
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: isOuterplanarBlockShallow
char isOuterplanarBlockShallow(struct ShallowGraph* original, struct ShallowGraphPool* sgp, struct GraphPool* gp) {
	struct Graph* g = shallowGraphToGraph(original, gp);
	char isOP = isOuterplanarBlock(g, sgp);
	dumpGraph(gp, g);
	return isOP;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdx, %rsi
callq 0x5fe8
movq %rax, %r15
movq %rax, %rdi
movq %r14, %rsi
callq 0x13ead
movl %eax, %ebp
movq %rbx, %rdi
movq %r15, %rsi
callq 0x1166e
movl %ebp, %eax
addq $0x8, %rsp
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: createBBTree
struct BBTree* createBBTree(struct Graph* tree, struct Graph* blocks, struct ShallowGraph* blockList, int* originalIDs, struct GraphPool* gp) {
	int i;
	struct BBTree* result = malloc(sizeof(struct BBTree));

	result->tree = tree;
	result->originalIDs = originalIDs;
	if (blocks->n > 0) {
		result->blocks = blocks;
		result->blockComponents = malloc(blocks->n * sizeof(struct ShallowGraph*));

		for (i=0; i<blocks->n; ++i) {
			result->blockComponents[i] = blockList;
			blockList = blockList->next;
		}
	} else {
		dumpGraph(gp, blocks);
		result->blockComponents = NULL;
		result->blocks = NULL;
	}

	return result;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %r8, %r15
movq %rcx, %r13
movq %rdx, %r14
movq %rsi, %r12
movq %rdi, %rbp
pushq $0x20
popq %rdi
callq 0x1180
movq %rax, %rbx
movq %rbp, (%rax)
movq %r13, 0x18(%rax)
movslq (%r12), %r13
testq %r13, %r13
jle 0x143ad
movq %r12, 0x8(%rbx)
leaq (,%r13,8), %rdi
callq 0x1180
movq %rax, 0x10(%rbx)
xorl %ecx, %ecx
cmpq %rcx, %r13
je 0x143bf
movq %r14, (%rax,%rcx,8)
movq 0x18(%r14), %r14
incq %rcx
jmp 0x1439b
movq %r15, %rdi
movq %r12, %rsi
callq 0x1166e
xorps %xmm0, %xmm0
movups %xmm0, 0x8(%rbx)
movq %rbx, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: dumpBBTree
void dumpBBTree(struct GraphPool* gp, struct ShallowGraphPool* sgp, struct BBTree* tree) {
	if (tree) {
		dumpGraph(gp, tree->tree);
		if (tree->blocks) {
			dumpGraph(gp, tree->blocks);
			dumpShallowGraphCycle(sgp, tree->blockComponents[0]);
			free(tree->blockComponents);
		}
		if (tree->originalIDs) {
			free(tree->originalIDs);
		}
		free(tree);
	}
}

// Assembly:
testq %rdx, %rdx
je 0x1442b
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq (%rdx), %rsi
callq 0x1166e
movq 0x8(%rbx), %rsi
testq %rsi, %rsi
je 0x14415
movq %r15, %rdi
callq 0x1166e
movq 0x10(%rbx), %rax
movq (%rax), %rsi
movq %r14, %rdi
callq 0x11888
movq 0x10(%rbx), %rdi
callq 0x1030
movq 0x18(%rbx), %rdi
callq 0x1030
movq %rbx, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x1030
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: dumpFancyBBTree
void dumpFancyBBTree(struct GraphPool* gp, struct ShallowGraphPool* sgp, struct BBTree* tree) {
	if (tree) {
		dumpGraph(gp, tree->tree);
		if (tree->blocks) {
			free(tree->blocks->vertices);
			tree->blocks->vertices = NULL;
			dumpGraph(gp, tree->blocks);
			dumpShallowGraphCycle(sgp, tree->blockComponents[0]);
			free(tree->blockComponents);
		}
		free(tree->originalIDs);
		free(tree);
	}
}

// Assembly:
testq %rdx, %rdx
je 0x14498
pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
movq (%rdx), %rsi
callq 0x1166e
movq 0x8(%rbx), %rax
testq %rax, %rax
je 0x14482
movq 0x10(%rax), %rdi
callq 0x1030
movq 0x8(%rbx), %rsi
andq $0x0, 0x10(%rsi)
movq %r15, %rdi
callq 0x1166e
movq 0x10(%rbx), %rax
movq (%rax), %rsi
movq %r14, %rdi
callq 0x11888
movq 0x10(%rbx), %rdi
callq 0x1030
movq 0x18(%rbx), %rdi
callq 0x1030
movq %rbx, %rdi
popq %rbx
popq %r14
popq %r15
jmp 0x1030
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: getContainmentEdge
struct VertexList* getContainmentEdge(struct ListPool* lp) {
	struct VertexList* e = getVertexList(lp);
	e->label = malloc(2*sizeof(char));
	sprintf(e->label, "#");
	e->isStringMaster = 1;
	return e;
}

// Assembly:
pushq %rbx
callq 0x11307
movq %rax, %rbx
pushq $0x2
popq %rdi
callq 0x1180
movq %rax, (%rbx)
movw $0x23, (%rax)
movl $0x1, 0x28(%rbx)
movq %rbx, %rax
popq %rbx
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: mergeBBtree
int* mergeBBtree(struct Graph* g, struct Graph*h) {
	struct Vertex** tmp;
	int i, j, tmpN;
	int actualVertices = 0;
	for (i=0; i<g->n; ++i) {
		if (g->vertices[i]) {
			++actualVertices;
		}
	}

	/* up to this point, there may be elements of copy->vertices, that are NULL */
	tmp = g->vertices;
	tmpN = g->n;

	/* set the number of vertices correctly */
	int newSize = actualVertices + h->n;
	setVertexNumber(g, newSize);
	int* originalIDs = malloc(newSize * sizeof(int));

	/* shift the vertices that are there into the new array and
	 * assign new numbers */
	j = 0;
	for (i=0; i<tmpN; ++i) {
		if (tmp[i]) {
			g->vertices[j] = tmp[i];
			originalIDs[j] = g->vertices[j]->number;
			g->vertices[j]->number = j;
			++j;
		}
	}

	/* attach the block vertices to the new tree */
	for (i=0; i<h->n; ++i) {
		g->vertices[j] = h->vertices[i];
		originalIDs[j] = -1 - i;
		g->vertices[j]->number = j;
		++j;	
	}

	/* set the number of edges correctly */
	g->m += h->m;

	free(tmp);

	return originalIDs;
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %rsi, %r14
movq %rdi, %rbx
movl (%rdi), %r13d
xorl %eax, %eax
testl %r13d, %r13d
cmovlel %eax, %r13d
movq 0x10(%rdi), %r15
xorl %ecx, %ecx
cmpq %rax, %r13
je 0x14924
cmpq $0x1, (%r15,%rax,8)
sbbl $-0x1, %ecx
incq %rax
jmp 0x14912
movslq (%r14), %rax
movslq %ecx, %r12
addq %rax, %r12
movq %rbx, %rdi
movl %r12d, %esi
callq 0x5c80
shlq $0x2, %r12
movq %r12, %rdi
callq 0x1180
movq %rax, %r12
xorl %ecx, %ecx
xorl %edx, %edx
movslq %edx, %rax
cmpq %rcx, %r13
je 0x1497f
movq (%r15,%rcx,8), %rsi
testq %rsi, %rsi
je 0x1497a
movq 0x10(%rbx), %rdx
movq %rsi, (%rdx,%rax,8)
movq 0x10(%rbx), %rdx
movq (%rdx,%rax,8), %rdx
movl 0x18(%rdx), %esi
movl %esi, (%r12,%rax,4)
movl %eax, 0x18(%rdx)
incl %eax
movl %eax, %edx
incq %rcx
jmp 0x1494b
movl (%r14), %ecx
xorl %edx, %edx
testl %ecx, %ecx
cmovlel %edx, %ecx
movl %eax, %esi
leaq (%r12,%rax,4), %rdi
shlq $0x3, %rax
pushq $-0x1
popq %r8
cmpq %rdx, %rcx
je 0x149ce
movq 0x10(%r14), %r9
movq (%r9,%rdx,8), %r9
movq 0x10(%rbx), %r10
addq %rax, %r10
movq %r9, (%r10,%rdx,8)
movl %r8d, (%rdi,%rdx,4)
movq 0x10(%rbx), %r9
addq %rax, %r9
movq (%r9,%rdx,8), %r9
leal (%rsi,%rdx), %r10d
movl %r10d, 0x18(%r9)
incq %rdx
decl %r8d
jmp 0x14997
movl 0x4(%r14), %eax
addl %eax, 0x4(%rbx)
movq %r15, %rdi
callq 0x1030
movq %r12, %rax
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/outerplanar.c
// Function: compressedBBTree
struct BBTree* compressedBBTree(struct Graph* tree, struct Graph* blocks, struct ShallowGraph* list, int** originalIDs, struct GraphPool* gp) {
	int* tmpIDs = mergeBBtree(tree, blocks);
	if (*originalIDs) {
		for (int i=0; i<tree->n - blocks->n; ++i) {
			tmpIDs[i] = (*originalIDs)[tmpIDs[i]];
		}
	}	  
	return createBBTree(tree, blocks, list, tmpIDs, gp);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movq %r8, %rbx
movq %rcx, %r13
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
callq 0x148f1
movq (%r13), %rcx
testq %rcx, %rcx
je 0x14a32
movl (%r12), %edx
subl (%r15), %edx
xorl %esi, %esi
testl %edx, %edx
cmovlel %esi, %edx
cmpq %rsi, %rdx
je 0x14a32
movslq (%rax,%rsi,4), %rdi
movl (%rcx,%rdi,4), %edi
movl %edi, (%rax,%rsi,4)
incq %rsi
jmp 0x14a1e
movq %r12, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %rax, %rcx
movq %rbx, %r8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x1434f
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: numberOfReachableVertices
int numberOfReachableVertices(struct Vertex* v, struct ShallowGraphPool* sgp) {
	struct ShallowGraph* queue = getShallowGraph(sgp);
	int markerID = v->number;
	addToVertexQueue(v, queue, sgp);
	v->visited = markerID;

	int reachableCount = 1;

	for (struct Vertex* w=popFromVertexQueue(queue, sgp); w!=NULL; w=popFromVertexQueue(queue, sgp)) {
		for (struct VertexList* e=w->neighborhood; e!=NULL; e=e->next) {
			if (e->endPoint->visited != markerID) {
				e->endPoint->visited = markerID;
				addToVertexQueue(e->endPoint, queue, sgp);
				++reachableCount;
			}
		}
	}

	return reachableCount;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x117e9
movq %rax, %r14
movl 0x18(%r15), %r12d
movq %r15, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x1ba70
movl %r12d, 0x1c(%r15)
pushq $0x1
popq %rbp
movq %r14, %rdi
movq %rbx, %rsi
callq 0x1ba99
testq %rax, %rax
je 0x14ec7
movq %rax, %r15
movq 0x8(%r15), %r15
testq %r15, %r15
je 0x14e8e
movq 0x18(%r15), %rdi
cmpl %r12d, 0x1c(%rdi)
je 0x14ea1
movl %r12d, 0x1c(%rdi)
movq %r14, %rsi
movq %rbx, %rdx
callq 0x1ba70
incl %ebp
jmp 0x14ea1
movl %ebp, %eax
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: computeAllReachabilityCounts
void computeAllReachabilityCounts(struct Graph* g, struct ShallowGraphPool* sgp) {
	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->visited = -1;
	}

	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->lowPoint = numberOfReachableVertices(g->vertices[v], sgp);
	}
}

// Assembly:
pushq %r15
pushq %r14
pushq %rbx
movq %rsi, %rbx
movq %rdi, %r14
movl (%rdi), %eax
movslq %eax, %rcx
xorl %edx, %edx
cmpq %rcx, %rdx
jge 0x14efa
movq 0x10(%r14), %rsi
movq (%rsi,%rdx,8), %rsi
orl $-0x1, 0x1c(%rsi)
incq %rdx
jmp 0x14ee4
xorl %r15d, %r15d
cltq
cmpq %rax, %r15
jge 0x14f27
movq 0x10(%r14), %rax
movq (%rax,%r15,8), %rdi
movq %rbx, %rsi
callq 0x14e5c
movq 0x10(%r14), %rcx
movq (%rcx,%r15,8), %rcx
movl %eax, 0x20(%rcx)
incq %r15
movl (%r14), %eax
jmp 0x14efd
popq %rbx
popq %r14
popq %r15
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: printPathArray
void printPathArray(int* path, FILE* out) {
	fputc('[', out);
	for (int i=1; i<path[0]; ++i) {
		fprintf(out, "%i, ", path[i]);
	}
	fputc(']', out);
	fputc('\n', out);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
pushq $0x5b
popq %rdi
callq 0x1100
pushq $0x1
popq %r12
leaq 0x849d(%rip), %r15      # 0x1d3eb
movslq (%r14), %rax
cmpq %rax, %r12
jge 0x14f6c
movl (%r14,%r12,4), %edx
movq %rbx, %rdi
movq %r15, %rsi
xorl %eax, %eax
callq 0x1150
incq %r12
jmp 0x14f4e
pushq $0x5d
popq %rdi
movq %rbx, %rsi
callq 0x1100
pushq $0xa
popq %rdi
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
jmp 0x1100
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: printFlowInstanceDotFormat
void printFlowInstanceDotFormat(struct Graph* g, FILE* out) {
	fputs("digraph anonymous {\n", out);
	// write vertices
	for (int v=0; v<g->n; ++v) {
		if (g->vertices[v]->visited == 0) {
			fprintf(out, "%i [label=\"%i: %i/%i\"];\n", v, v, g->vertices[v]->visited, g->vertices[v]->d);
		} else {
			fprintf(out, "%i [label=\"%i: %i/%i\", color=green, penwidth=3];\n", v, v, g->vertices[v]->visited, g->vertices[v]->d);
		}
	}
	// write edges
	for (int v=0; v<g->n; ++v) {
		for (struct VertexList* e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			if (e->endPoint->number > e->startPoint->number) {
				if (e->flag > 0) {
					// original edge
					fprintf(out, "%i -> %i [label=\"%i/%i\", penwidth=3, color=red];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
				} else {
					fprintf(out, "%i -> %i [label=\"%i/%i\", color=red];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
				}
			} else {
				// residual edge
				fprintf(out, "%i -> %i [label=\"%i/%i\"];\n", e->startPoint->number, e->endPoint->number, e->flag, e->used);
			}
		}
	}
	fputs("}\n", out);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x8d8b(%rip), %rdi      # 0x1dd30
callq 0x10c0
leaq 0x8d94(%rip), %r15      # 0x1dd45
leaq 0x8da6(%rip), %r12      # 0x1dd5e
xorl %r13d, %r13d
movslq (%r14), %rax
cmpq %rax, %r13
jge 0x14ffe
movq 0x10(%r14), %rax
movq (%rax,%r13,8), %rax
movl 0x1c(%rax), %r8d
movl 0x28(%rax), %r9d
movq %rbx, %rdi
testl %r8d, %r8d
je 0x14fe6
movq %r12, %rsi
movl %r13d, %edx
movl %r13d, %ecx
jmp 0x14ff2
movq %r15, %rsi
movl %r13d, %edx
movl %r13d, %ecx
xorl %r8d, %r8d
xorl %eax, %eax
callq 0x1150
incq %r13
jmp 0x14fbb
leaq 0x8d8b(%rip), %r15      # 0x1dd90
leaq 0x8db6(%rip), %r12      # 0x1ddc2
leaq 0x8dd5(%rip), %r13      # 0x1dde8
xorl %ebp, %ebp
movq %r14, (%rsp)
cltq
cmpq %rax, %rbp
jge 0x1507c
movq 0x10(%r14), %rax
movq (%rax,%rbp,8), %r14
movq 0x8(%r14), %r14
testq %r14, %r14
je 0x15070
movq 0x10(%r14), %rax
movq 0x18(%r14), %rcx
movl 0x18(%rcx), %ecx
movl 0x18(%rax), %edx
movl 0x24(%r14), %r8d
cmpl %edx, %ecx
jle 0x15058
movl 0x20(%r14), %r9d
movq %rbx, %rdi
testl %r8d, %r8d
jle 0x15064
movq %r15, %rsi
jmp 0x15067
movl 0x20(%r14), %r9d
movq %rbx, %rdi
movq %r13, %rsi
jmp 0x15067
movq %r12, %rsi
xorl %eax, %eax
callq 0x1150
jmp 0x15028
incq %rbp
movq (%rsp), %r14
movl (%r14), %eax
jmp 0x15019
leaq 0x833f(%rip), %rdi      # 0x1d3c2
movq %rbx, %rsi
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x10c0
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: checkPathCover
int checkPathCover(struct Graph* g, int** pathset, size_t nPaths) {

	for (int v=0; v<g->n; ++v) {
		g->vertices[v]->visited = 0;
	}

	for (size_t i=0; i<nPaths; ++i) {
		for (int j=1; j<pathset[i][0]; ++j) {
			g->vertices[pathset[i][j]]->visited = 1;
		}
	}

	int covered = 0;
	for (int v=0; v<g->n; ++v) {
		covered += g->vertices[v]->visited;
	}

	return g->n - covered;

}

// Assembly:
pushq %r14
pushq %rbx
movl (%rdi), %eax
xorl %r8d, %r8d
testl %eax, %eax
movl $0x0, %ecx
cmovgl %eax, %ecx
cmpq %r8, %rcx
je 0x150c2
movq 0x10(%rdi), %r9
movq (%r9,%r8,8), %r9
andl $0x0, 0x1c(%r9)
incq %r8
jmp 0x150ab
xorl %r8d, %r8d
movabsq $0x1, %r9
cmpq %rdx, %r8
je 0x15100
movq (%rsi,%r8,8), %r10
movq %r9, %r11
movslq (%r10), %rbx
cmpq %rbx, %r11
jge 0x150fb
movq 0x10(%rdi), %rbx
movslq (%r10,%r11,4), %r14
movq (%rbx,%r14,8), %rbx
movl $0x1, 0x1c(%rbx)
incq %r11
jmp 0x150db
incq %r8
jmp 0x150cf
xorl %edx, %edx
xorl %esi, %esi
cmpq %rdx, %rcx
je 0x1511a
movq 0x10(%rdi), %r8
movq (%r8,%rdx,8), %r8
addl 0x1c(%r8), %esi
incq %rdx
jmp 0x15104
subl %esi, %eax
popq %rbx
popq %r14
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: createVertexCoverFlowInstanceOfPoset
static struct Graph* createVertexCoverFlowInstanceOfPoset(struct Graph* g, struct GraphPool* gp) {
	struct Graph* flowInstance = createGraph(2 * g->n, gp);
	int maxCapacity = g->n;

	// source and sink of s-t flow instance
	struct Vertex* s = flowInstance->vertices[0];
	struct Vertex* t = flowInstance->vertices[1];

	// actual elements of poset start at vertex 1. they have infinite capacity.
	// HINT: if you ever want to change this for general graphs, consider that the
	// above s,t positions and size of flowInstance need to be changed.
	for (int v=1; v<g->n; ++v) {
		struct Vertex* vStart = flowInstance->vertices[2 * v];
		struct Vertex* vEnd = flowInstance->vertices[2 * v + 1];

		// add edge for each vertex in the original graph
		addResidualEdgesWithCapacity(vStart, vEnd, maxCapacity, gp->listPool);

		// add copy of original edges and residuals, they have infinite capacity
		for (struct VertexList* e=g->vertices[v]->neighborhood; e!=NULL; e=e->next) {
			addResidualEdgesWithCapacity(vEnd, flowInstance->vertices[2 * e->endPoint->number], maxCapacity, gp->listPool);
		}

		// add edge from s to vEnd with capacity 1
		addResidualEdgesWithCapacity(s, vEnd, 1, gp->listPool);

		// add edge from v to t
		addResidualEdgesWithCapacity(vStart, t, 1, gp->listPool);
	}

	return flowInstance;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rsi, %rbx
movq %rdi, %r13
movl (%rdi), %edi
addl %edi, %edi
callq 0x630e
movq %rax, %r15
movl (%r13), %ebp
movq 0x10(%rax), %rax
movq (%rax), %rcx
movq %rcx, 0x10(%rsp)
movq 0x8(%rax), %rax
movq %rax, 0x8(%rsp)
pushq $0x1
popq %r14
movl %ebp, %eax
movq %r13, 0x18(%rsp)
cltq
cmpq %rax, %r14
jge 0x153c4
movq 0x10(%r15), %rax
movq %r14, %rcx
shlq $0x4, %rcx
movq (%rax,%rcx), %rdi
movq 0x8(%rax,%rcx), %r12
movq 0x18(%rbx), %rcx
movq %rdi, 0x20(%rsp)
movq %r12, %rsi
movl %ebp, %edx
callq 0x184b
movq 0x10(%r13), %rax
movq (%rax,%r14,8), %r13
movq 0x8(%r13), %r13
testq %r13, %r13
je 0x15385
movq 0x10(%r15), %rax
movq 0x18(%r13), %rcx
movslq 0x18(%rcx), %rcx
shlq $0x4, %rcx
movq (%rax,%rcx), %rsi
movq 0x18(%rbx), %rcx
movq %r12, %rdi
movl %ebp, %edx
callq 0x184b
jmp 0x15358
movq 0x18(%rbx), %rcx
movq 0x10(%rsp), %rdi
movq %r12, %rsi
pushq $0x1
popq %r12
movl %r12d, %edx
callq 0x184b
movq 0x18(%rbx), %rcx
movq 0x20(%rsp), %rdi
movq 0x8(%rsp), %rsi
movl %r12d, %edx
callq 0x184b
incq %r14
movq 0x18(%rsp), %r13
movl (%r13), %eax
jmp 0x1531e
movq %r15, %rax
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: countPossiblePaths
static void countPossiblePaths(struct Graph* flowInstance, size_t* nPaths) {
	// how many paths are there?
	*nPaths = 0;
	for (int v=2; v<flowInstance->n; ++v) {
		if (flowInstance->vertices[v]->visited > 0) {
			*nPaths += flowInstance->vertices[v]->visited;
		}
	}
}

// Assembly:
andq $0x0, (%rsi)
movslq (%rdi), %rax
pushq $0x2
popq %rcx
xorl %edx, %edx
cmpq %rax, %rcx
jge 0x15403
movq 0x10(%rdi), %r8
movq (%r8,%rcx,8), %r8
movslq 0x1c(%r8), %r8
testq %r8, %r8
jle 0x153fe
addq %r8, %rdx
movq %rdx, (%rsi)
incq %rcx
jmp 0x153e2
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsDownwardEmbeddingForTrees
struct IntSet* dfsDownwardEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);
	for (int i=1; i<p.poset->n; ++i) {
		nEvaluations += dfsRaySearch(g, p, p.poset->vertices[i], gp);
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x30, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x60(%rsp), %r15
movaps (%r15), %xmm0
movaps 0x10(%r15), %xmm1
movaps 0x20(%r15), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1206c
xorl %ebp, %ebp
pushq $0x1
popq %r12
movq (%r15), %rax
movslq (%rax), %rcx
cmpq %rcx, %r12
jge 0x1578f
movq 0x10(%rax), %rax
movq (%rax,%r12,8), %rsi
movups (%r15), %xmm0
movups 0x10(%r15), %xmm1
movups 0x20(%r15), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x157ba
addl %eax, %ebp
incq %r12
jmp 0x1574e
movq 0x14862(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x7896(%rip), %rsi      # 0x1d036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1150
addq $0x30, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
popq %rbp
jmp 0x121ee
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: dfsRaySearch
static int dfsRaySearch(struct Graph* g, struct EvaluationPlan p, struct Vertex* currentPattern, struct GraphPool* gp) {
	int nEvaluations = 0;
	if (!embeddingValueKnown(currentPattern)) {
		struct Graph* pattern = (struct Graph*)(currentPattern->label);
		char match = isSubtree(g, pattern, gp);
		++nEvaluations;
		if (match) {
			for (struct VertexList* e=currentPattern->neighborhood; e!=NULL; e=e->next) {
				nEvaluations += dfsRaySearch(g, p, e->endPoint, gp);
			}
			updateEvaluationPlan(p, currentPattern->number, 1);
		} else {
			updateEvaluationPlan(p, currentPattern->number, 0);
		}
	}
	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, %r14
movq %rsi, %rbx
movq %rdi, %r15
movq %rsi, %rdi
callq 0x1209e
xorl %ebp, %ebp
testl %eax, %eax
jne 0x1586b
leaq 0x70(%rsp), %r12
movq (%rbx), %rsi
movq %r15, %rdi
movq %r14, %rdx
callq 0x86b2
pushq $0x1
popq %rbp
testb %al, %al
je 0x1583f
movq %rbx, %r13
movq 0x8(%r13), %r13
testq %r13, %r13
je 0x1583b
movq 0x18(%r13), %rsi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r15, %rdi
movq %r14, %rdx
callq 0x157ba
addl %eax, %ebp
jmp 0x15800
movb $0x1, %al
jmp 0x15841
xorl %eax, %eax
movl 0x18(%rbx), %edi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movzbl %al, %esi
callq 0x120b2
movl %ebp, %eax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: latticePathEmbeddingForTrees
struct IntSet* latticePathEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getPathInDAG(p.poset->vertices[i]);
			nEvaluations += binarySearchEvaluation(g, p, path, gp);
			free(path);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x70(%rsp), %r12
movaps (%r12), %xmm0
movaps 0x10(%r12), %xmm1
movaps 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1206c
xorl %ebp, %ebp
pushq $0x1
popq %r13
movq (%r12), %rax
movslq (%rax), %rcx
cmpq %rcx, %r13
jge 0x1592c
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x1209e
testl %eax, %eax
jne 0x15927
movq (%r12), %rax
movq 0x10(%rax), %rax
movq (%rax,%r13,8), %rdi
callq 0x15959
movq %rax, %r15
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rax, %rsi
movq %rbx, %rdx
callq 0x159c7
addl %eax, %ebp
movq %r15, %rdi
callq 0x1030
incq %r13
jmp 0x158bf
movq 0x146c5(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x76f9(%rip), %rsi      # 0x1d036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1150
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x121ee
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: getPathInDAG
static int* getPathInDAG(struct Vertex* v) {
	int pathLength = 2;
	int* path = NULL;

	// DFS without backtracking in DAG
	for (struct VertexList* e=v->neighborhood; e!=NULL && (e->endPoint->visited == 0); e=e->endPoint->neighborhood) {
		++pathLength;
	}

	path = malloc(pathLength * sizeof(int));
	path[0] = pathLength;
	path[1] = v->number;

	pathLength = 2;
	// DFS without backtracking in DAG
	for (struct VertexList* e=v->neighborhood; e!=NULL && (e->endPoint->visited == 0); e=e->endPoint->neighborhood) {
		path[pathLength] = e->endPoint->number;
		++pathLength;
	}

	return path;
}

// Assembly:
pushq %rbp
pushq %r14
pushq %rbx
movq %rdi, %rbx
leaq 0x8(%rdi), %r14
pushq $0x2
popq %rbp
pushq $0x8
popq %rdi
movq %r14, %rax
movq (%rax), %rax
testq %rax, %rax
je 0x1598b
movq 0x18(%rax), %rax
cmpl $0x0, 0x1c(%rax)
jne 0x1598b
incl %ebp
addq $0x8, %rax
addq $0x4, %rdi
jmp 0x1596d
callq 0x1180
movl %ebp, (%rax)
movl 0x18(%rbx), %ecx
movl %ecx, 0x4(%rax)
movq %rax, %rcx
addq $0x8, %rcx
movq (%r14), %rdx
testq %rdx, %rdx
je 0x159c2
movq 0x18(%rdx), %r14
cmpl $0x0, 0x1c(%r14)
jne 0x159c2
movl 0x18(%r14), %edx
movl %edx, (%rcx)
addq $0x8, %r14
addq $0x4, %rcx
jmp 0x1599f
popq %rbx
popq %r14
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: binarySearchEvaluation
static int binarySearchEvaluation(struct Graph* g, struct EvaluationPlan p, int* path, struct GraphPool* gp) {
	int nEvaluations = 0;
	int minIdx = 1;
	int maxIdx = path[0] - 1;

	while (minIdx <= maxIdx) {
		int currentIdx = (minIdx + maxIdx) / 2;
		char match;
		if (!embeddingValueKnown(p.poset->vertices[path[currentIdx]])) {
			struct Graph* pattern = (struct Graph*)(p.poset->vertices[path[currentIdx]]->label);
			match = isSubtree(g, pattern, gp);
			++nEvaluations;
			updateEvaluationPlan(p, path[currentIdx], match);
		} else {
			match = getMatch(p.poset->vertices[path[currentIdx]]);
		}

		if (match) {
			minIdx = currentIdx + 1;
		} else {
			maxIdx = currentIdx - 1;
		}
	}

	return nEvaluations;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rdx, 0x40(%rsp)
movq %rsi, %r14
movq %rdi, 0x38(%rsp)
leaq 0x80(%rsp), %r13
movl (%rsi), %ebp
decl %ebp
movl $0x0, 0x34(%rsp)
pushq $0x1
popq %r15
cmpl %ebp, %r15d
jg 0x15a96
leal (%r15,%rbp), %ebx
shrl %ebx
movq (%r13), %rax
movq 0x10(%rax), %rax
movslq (%r14,%rbx,4), %rcx
movq (%rax,%rcx,8), %rdi
callq 0x1209e
movq (%r13), %rcx
movq 0x10(%rcx), %rcx
movslq (%r14,%rbx,4), %rdx
movq (%rcx,%rdx,8), %rdi
testl %eax, %eax
je 0x15a3c
callq 0x120a8
movl %eax, %r12d
jmp 0x15a7e
movq (%rdi), %rsi
movq 0x38(%rsp), %rdi
movq 0x40(%rsp), %rdx
callq 0x86b2
movl %eax, %r12d
incl 0x34(%rsp)
movl (%r14,%rbx,4), %edi
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movsbl %al, %esi
callq 0x120b2
testb %r12b, %r12b
je 0x15a8d
incl %ebx
movl %ebx, %r15d
jmp 0x159fa
decl %ebx
movl %ebx, %ebp
jmp 0x159fa
movl 0x34(%rsp), %eax
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: latticeLongestPathEmbeddingForTrees
struct IntSet* latticeLongestPathEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getLongestPathInDAG(p.poset->vertices[i], p.poset, sgp);
			nEvaluations += binarySearchEvaluation(g, p, path, gp);
			free(path);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rdx, 0x30(%rsp)
movq %rsi, %r14
movq %rdi, %r15
leaq 0x70(%rsp), %r13
movaps (%r13), %xmm0
movaps 0x10(%r13), %xmm1
movaps 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1206c
xorl %ebp, %ebp
pushq $0x1
popq %rbx
movq (%r13), %rax
movslq (%rax), %rcx
cmpq %rcx, %rbx
jge 0x15b5e
movq 0x10(%rax), %rax
movq (%rax,%rbx,8), %rdi
callq 0x1209e
testl %eax, %eax
jne 0x15b59
movq (%r13), %rsi
movq 0x10(%rsi), %rax
movq (%rax,%rbx,8), %rdi
movq 0x30(%rsp), %rdx
callq 0x15b8b
movq %rax, %r12
movups (%r13), %xmm0
movups 0x10(%r13), %xmm1
movups 0x20(%r13), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r15, %rdi
movq %rax, %rsi
movq %r14, %rdx
callq 0x159c7
addl %eax, %ebp
movq %r12, %rdi
callq 0x1030
incq %rbx
jmp 0x15aee
movq 0x14493(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x74c7(%rip), %rsi      # 0x1d036
movl %ebp, %edx
xorl %eax, %eax
callq 0x1150
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x121ee
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: getLongestPathInDAG
static int* getLongestPathInDAG(struct Vertex* v, struct Graph* poset, struct ShallowGraphPool* sgp) {

	struct ShallowGraph* border = getShallowGraph(sgp);
	addToVertexQueue(v, border, sgp);
	v->lowPoint = -1;
	v->d = 1;

	// use ->lowPoint to store the a parent of w
	// for sake of simplicity we count the number of times a vertex is in the border and
	struct Vertex* highestVertex = v;
	for (struct Vertex* w=popFromVertexQueue(border, sgp); w!=NULL;  w=popFromVertexQueue(border, sgp)) {
		highestVertex = w;
		w->d -= 1;
		if (w->d == 0) {
			for (struct VertexList* e=w->neighborhood; e!=NULL; e=e->next) {
				if ((e->endPoint->visited == 0) && (e->endPoint->d == 0)) {
					e->endPoint->lowPoint = w->number;
					e->endPoint->d += 1;
					addToVertexQueue(e->endPoint, border, sgp);
				}
			}
		}
	}
	// here w stores the last visited pattern that, by construction, is on the highest level of the poset.
	// backtrack using the ->lowPoints from here.
	int pathLength = 2;
	int* path = NULL;
	for (struct Vertex* x=highestVertex; x->lowPoint!=-1; x=poset->vertices[x->lowPoint]) {
		++pathLength;
	}

	path = malloc(pathLength * sizeof(int));
	path[0] = pathLength;
	path[1] = v->number;

	pathLength -= 1;
	for (struct Vertex* x=highestVertex; x->lowPoint!=-1; x=poset->vertices[x->lowPoint]) {
		path[pathLength] = x->number;
		--pathLength;
	}

	return path;
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movq %rdx, %r15
movq %rsi, %rbx
movq %rdi, %r14
movq %rdx, %rdi
callq 0x117e9
movq %rax, %r12
movq %r14, %rdi
movq %rax, %rsi
movq %r15, %rdx
callq 0x1ba70
orl $-0x1, 0x20(%r14)
movl $0x1, 0x28(%r14)
movq %r14, %rbp
movq %r12, %rdi
movq %r15, %rsi
callq 0x1ba99
testq %rax, %rax
je 0x15c1f
movq %rax, %r13
decl 0x28(%rax)
movq %rax, %rbp
jne 0x15bc8
movq %r13, %rbp
movq 0x8(%rbp), %rbp
testq %rbp, %rbp
je 0x15c1a
movq 0x18(%rbp), %rdi
cmpl $0x0, 0x1c(%rdi)
jne 0x15be6
cmpl $0x0, 0x28(%rdi)
jne 0x15be6
movl 0x18(%r13), %eax
movl %eax, 0x20(%rdi)
movl $0x1, 0x28(%rdi)
movq %r12, %rsi
movq %r15, %rdx
callq 0x1ba70
jmp 0x15be6
movq %r13, %rbp
jmp 0x15bc8
pushq $0x2
popq %r12
pushq $0x4
popq %r15
movq %rbp, %rax
movslq 0x20(%rax), %rax
cmpq $-0x1, %rax
je 0x15c45
incl %r12d
movq 0x10(%rbx), %rcx
movq (%rcx,%rax,8), %rax
addq $0x4, %r15
jmp 0x15c2a
leaq 0x4(%r15), %rdi
callq 0x1180
movl %r12d, (%rax)
movl 0x18(%r14), %ecx
movl %ecx, 0x4(%rax)
movq %rax, %rcx
addq %r15, %rcx
cmpl $-0x1, 0x20(%rbp)
je 0x15c7b
movl 0x18(%rbp), %edx
movl %edx, (%rcx)
movq 0x10(%rbx), %rdx
movslq 0x20(%rbp), %rsi
movq (%rdx,%rsi,8), %rbp
addq $-0x4, %rcx
jmp 0x15c5e
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: staticPathCoverEmbeddingForTrees
struct IntSet* staticPathCoverEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, struct GraphPool* gp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (size_t i=0; i<p.sketchSize; ++i) {
		nEvaluations += binarySearchEvaluation(g, p, p.shrunkPermutations[i], gp);
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x30, %rsp
movq %rsi, %rbx
movq %rdi, %r14
leaq 0x60(%rsp), %r12
movaps (%r12), %xmm0
movaps 0x10(%r12), %xmm1
movaps 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1206c
xorl %r15d, %r15d
xorl %r13d, %r13d
cmpq 0x28(%r12), %r13
jae 0x15d0e
movq 0x18(%r12), %rax
movq (%rax,%r13,8), %rsi
movups (%r12), %xmm0
movups 0x10(%r12), %xmm1
movups 0x20(%r12), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movq %r14, %rdi
movq %rbx, %rdx
callq 0x159c7
addl %eax, %r15d
incq %r13
jmp 0x15ccc
movq 0x142e3(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x7317(%rip), %rsi      # 0x1d036
movl %r15d, %edx
xorl %eax, %eax
callq 0x1150
addq $0x30, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
jmp 0x121ee
// File: /workspace/github_c_makefile_star2_O2/pwelke[P]GraphMiningTools/poset_pathCover.c
// Function: latticeLongestWeightedPathEmbeddingForTrees
struct IntSet* latticeLongestWeightedPathEmbeddingForTrees(struct Graph* g, struct EvaluationPlan p, int databaseSize, struct GraphPool* gp, struct ShallowGraphPool* sgp) {

	int nEvaluations = 0;
	cleanEvaluationPlan(p);

	for (int i=1; i<p.poset->n; ++i) {
		if (!embeddingValueKnown(p.poset->vertices[i])) {
			int* path = getLongestPathInDAG(p.poset->vertices[i], p.poset, sgp);
			double* weights = getWeightsOfPath(p.poset, path, databaseSize);
			nEvaluations += weightedBinarySearchEvaluation(g, p, path, weights, gp);
			free(path);
			free(weights);
		}
	}

	fprintf(stderr, "%i\n", nEvaluations);
	return patternPosetInfoToFeatureSet(p);
}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x68(%rsp)
movq %rdx, 0x60(%rsp)
movl %esi, 0x40(%rsp)
movq %rdi, 0x58(%rsp)
leaq 0xf0(%rsp), %r14
movaps (%r14), %xmm0
movaps 0x10(%r14), %xmm1
movaps 0x20(%r14), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
callq 0x1206c
xorl %r12d, %r12d
pushq $0x1
popq %rbx
leaq 0x78(%rsp), %r15
movq (%r14), %rax
movslq (%rax), %rcx
cmpq %rcx, %rbx
jge 0x15efb
movq 0x10(%rax), %rax
movq (%rax,%rbx,8), %rdi
callq 0x1209e
testl %eax, %eax
jne 0x15ef3
movl %r12d, 0x44(%rsp)
movq (%r14), %rsi
movq 0x10(%rsi), %rax
movq %rbx, 0x70(%rsp)
movq (%rax,%rbx,8), %rdi
movq 0x68(%rsp), %rdx
callq 0x15b8b
movq %rax, %rbx
movq (%r14), %rdi
movq %rax, %rsi
movl 0x40(%rsp), %edx
callq 0x15f2c
movq %rax, %rbp
movups (%r14), %xmm0
movups 0x10(%r14), %xmm1
movups 0x20(%r14), %xmm2
movaps %xmm2, 0xa0(%rsp)
movaps %xmm1, 0x90(%rsp)
movaps %xmm0, 0x80(%rsp)
movq $0x1, 0x50(%rsp)
movslq (%rbx), %r13
decq %r13
movq %r13, 0x78(%rsp)
andq $0x0, 0x48(%rsp)
movl $0x0, 0x3c(%rsp)
movq 0x80(%rsp), %r14
movq %rbp, %rdi
leaq 0x48(%rsp), %rsi
leaq 0x50(%rsp), %rdx
movq %r15, %rcx
callq 0x16a1a
cmpq %r13, 0x50(%rsp)
ja 0x15ecc
movq 0x10(%r14), %rax
movq 0x48(%rsp), %rcx
movslq (%rbx,%rcx,4), %r12
movq (%rax,%r12,8), %rdi
callq 0x1209e
movq 0x10(%r14), %rcx
movq (%rcx,%r12,8), %rdi
testl %eax, %eax
je 0x15e80
callq 0x120a8
jmp 0x15e3b
movq (%rdi), %rsi
movq 0x58(%rsp), %rdi
movq 0x60(%rsp), %rdx
callq 0x86b2
incl 0x3c(%rsp)
movaps 0x80(%rsp), %xmm0
movaps 0x90(%rsp), %xmm1
movaps 0xa0(%rsp), %xmm2
movups %xmm2, 0x20(%rsp)
movups %xmm1, 0x10(%rsp)
movups %xmm0, (%rsp)
movsbl %al, %esi
movl %r12d, %edi
callq 0x120b2
jmp 0x15e33
movl 0x44(%rsp), %r12d
addl 0x3c(%rsp), %r12d
movq %rbx, %rdi
callq 0x1030
movq %rbp, %rdi
callq 0x1030
leaq 0xf0(%rsp), %r14
movq 0x70(%rsp), %rbx
incq %rbx
jmp 0x15d93
movq 0x140f6(%rip), %rax     # 0x29ff8
movq (%rax), %rdi
leaq 0x712a(%rip), %rsi      # 0x1d036
movl %r12d, %edx
xorl %eax, %eax
callq 0x1150
addq $0xb8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x121ee