#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ asserter_crash_if_equal(unsigned int, unsigned int, int);
int /*<<< orphan*/ asserter_crash_if_not_equal(unsigned int, unsigned int, int);
unsigned int bitgraph_edge_add(unsigned int, int, int);
unsigned int bitgraph_empty();
unsigned int bitgraph_neighbors_get(unsigned int, int /*<<< orphan*/);
unsigned int bitset_add(unsigned int, int);
unsigned int bitset_empty();
int runner_main(void) {
  asserter_crash_if_not_equal(bitgraph_empty(), 0, 16);
  asserter_crash_if_equal(bitgraph_edge_add(bitgraph_empty(), 0, 0),
                          bitgraph_empty(), 19);
  asserter_crash_if_equal(bitgraph_edge_add(bitgraph_empty(), 0, 0),
                          bitgraph_edge_add(bitgraph_empty(), 0, 1), 20);
  asserter_crash_if_equal(bitgraph_edge_add(bitgraph_empty(), 1, 0),
                          bitgraph_edge_add(bitgraph_empty(), 0, 1), 21);
  asserter_crash_if_not_equal(bitgraph_neighbors_get(bitgraph_empty(), 0),
                              bitset_empty(), 24);
  asserter_crash_if_equal(
      bitgraph_neighbors_get(bitgraph_edge_add(bitgraph_empty(), 0, 0), 0),
      bitset_empty(), 25);
  {
    unsigned int graph = bitgraph_empty();
    unsigned int set = bitset_empty();
    graph = bitgraph_edge_add(
        bitgraph_edge_add(bitgraph_edge_add(graph, 0, 0), 0, 1), 0, 3);
    set = bitset_add(bitset_add(bitset_add(set, 0), 1), 3);
    asserter_crash_if_not_equal(bitgraph_neighbors_get(graph, 0), set, 33);
  }
  return 0;
}


x86 assembly (clang, -O0):
<runner_main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x20,%rsp
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x10,%edx
call   1050 <asserter_crash_if_not_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %edx,%edx
mov    %edx,%esi
call   1060 <bitgraph_edge_add@plt>
mov    %eax,-0x1c(%rbp)
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    -0x1c(%rbp),%edi
mov    %eax,%esi
mov    $0x13,%edx
call   1070 <asserter_crash_if_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %edx,%edx
mov    %edx,%esi
call   1060 <bitgraph_edge_add@plt>
mov    %eax,-0x18(%rbp)
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    -0x18(%rbp),%edi
mov    %eax,%esi
mov    $0x14,%edx
call   1070 <asserter_crash_if_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
mov    $0x1,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,-0x14(%rbp)
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    -0x14(%rbp),%edi
mov    %eax,%esi
mov    $0x15,%edx
call   1070 <asserter_crash_if_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,-0x10(%rbp)
mov    $0x0,%al
call   1080 <bitset_empty@plt>
mov    -0x10(%rbp),%edi
mov    %eax,%esi
mov    $0x18,%edx
call   1050 <asserter_crash_if_not_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %edx,%edx
mov    %edx,%esi
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,-0xc(%rbp)
mov    $0x0,%al
call   1080 <bitset_empty@plt>
mov    -0xc(%rbp),%edi
mov    %eax,%esi
mov    $0x19,%edx
call   1070 <asserter_crash_if_equal@plt>
mov    $0x0,%al
call   1040 <bitgraph_empty@plt>
mov    %eax,-0x4(%rbp)
mov    $0x0,%al
call   1080 <bitset_empty@plt>
mov    %eax,-0x8(%rbp)
mov    -0x4(%rbp),%edi
xor    %edx,%edx
mov    %edx,%esi
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x3,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,-0x4(%rbp)
mov    -0x8(%rbp),%edi
xor    %esi,%esi
call   1090 <bitset_add@plt>
mov    %eax,%edi
mov    $0x1,%esi
call   1090 <bitset_add@plt>
mov    %eax,%edi
mov    $0x3,%esi
call   1090 <bitset_add@plt>
mov    %eax,-0x8(%rbp)
mov    -0x4(%rbp),%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,%edi
mov    -0x8(%rbp),%esi
mov    $0x21,%edx
call   1050 <asserter_crash_if_not_equal@plt>
xor    %eax,%eax
add    $0x20,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<runner_main>:
push   %rbp
push   %rbx
push   %rax
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x10,%edx
call   1050 <asserter_crash_if_not_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %ebx,%edi
mov    %eax,%esi
mov    $0x13,%edx
call   1070 <asserter_crash_if_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %ebx,%edi
mov    %eax,%esi
mov    $0x14,%edx
call   1070 <asserter_crash_if_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
mov    $0x1,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %ebx,%edi
mov    %eax,%esi
mov    $0x15,%edx
call   1070 <asserter_crash_if_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1080 <bitset_empty@plt>
mov    %ebx,%edi
mov    %eax,%esi
mov    $0x18,%edx
call   1050 <asserter_crash_if_not_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%edi
xor    %esi,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1080 <bitset_empty@plt>
mov    %ebx,%edi
mov    %eax,%esi
mov    $0x19,%edx
call   1070 <asserter_crash_if_equal@plt>
xor    %eax,%eax
call   1040 <bitgraph_empty@plt>
mov    %eax,%ebx
xor    %eax,%eax
call   1080 <bitset_empty@plt>
mov    %eax,%ebp
mov    %ebx,%edi
xor    %esi,%esi
xor    %edx,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x1,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%edi
xor    %esi,%esi
mov    $0x3,%edx
call   1060 <bitgraph_edge_add@plt>
mov    %eax,%ebx
mov    %ebp,%edi
xor    %esi,%esi
call   1090 <bitset_add@plt>
mov    %eax,%edi
mov    $0x1,%esi
call   1090 <bitset_add@plt>
mov    %eax,%edi
mov    $0x3,%esi
call   1090 <bitset_add@plt>
mov    %eax,%ebp
mov    %ebx,%edi
xor    %esi,%esi
call   1030 <bitgraph_neighbors_get@plt>
mov    %eax,%edi
mov    %ebp,%esi
mov    $0x21,%edx
call   1050 <asserter_crash_if_not_equal@plt>
xor    %eax,%eax
add    $0x8,%rsp
pop    %rbx
pop    %rbp
ret

LLVM IR (-O0):
define i32 @runner_main() {
%1 = alloca i32
%2 = alloca i32
%3 = call i32 (...) @bitgraph_empty()
%4 = call i32 @asserter_crash_if_not_equal(i32 %3, i32 0, i32 16)
%5 = call i32 (...) @bitgraph_empty()
%6 = call i32 @bitgraph_edge_add(i32 %5, i32 0, i32 0)
%7 = call i32 (...) @bitgraph_empty()
%8 = call i32 @asserter_crash_if_equal(i32 %6, i32 %7, i32 19)
%9 = call i32 (...) @bitgraph_empty()
%10 = call i32 @bitgraph_edge_add(i32 %9, i32 0, i32 0)
%11 = call i32 (...) @bitgraph_empty()
%12 = call i32 @bitgraph_edge_add(i32 %11, i32 0, i32 1)
%13 = call i32 @asserter_crash_if_equal(i32 %10, i32 %12, i32 20)
%14 = call i32 (...) @bitgraph_empty()
%15 = call i32 @bitgraph_edge_add(i32 %14, i32 1, i32 0)
%16 = call i32 (...) @bitgraph_empty()
%17 = call i32 @bitgraph_edge_add(i32 %16, i32 0, i32 1)
%18 = call i32 @asserter_crash_if_equal(i32 %15, i32 %17, i32 21)
%19 = call i32 (...) @bitgraph_empty()
%20 = call i32 @bitgraph_neighbors_get(i32 %19, i32 0)
%21 = call i32 (...) @bitset_empty()
%22 = call i32 @asserter_crash_if_not_equal(i32 %20, i32 %21, i32 24)
%23 = call i32 (...) @bitgraph_empty()
%24 = call i32 @bitgraph_edge_add(i32 %23, i32 0, i32 0)
%25 = call i32 @bitgraph_neighbors_get(i32 %24, i32 0)
%26 = call i32 (...) @bitset_empty()
%27 = call i32 @asserter_crash_if_equal(i32 %25, i32 %26, i32 25)
%28 = call i32 (...) @bitgraph_empty()
store i32 %28, i32* %1
%29 = call i32 (...) @bitset_empty()
store i32 %29, i32* %2
%30 = load i32, i32* %1
%31 = call i32 @bitgraph_edge_add(i32 %30, i32 0, i32 0)
%32 = call i32 @bitgraph_edge_add(i32 %31, i32 0, i32 1)
%33 = call i32 @bitgraph_edge_add(i32 %32, i32 0, i32 3)
store i32 %33, i32* %1
%34 = load i32, i32* %2
%35 = call i32 @bitset_add(i32 %34, i32 0)
%36 = call i32 @bitset_add(i32 %35, i32 1)
%37 = call i32 @bitset_add(i32 %36, i32 3)
store i32 %37, i32* %2
%38 = load i32, i32* %1
%39 = call i32 @bitgraph_neighbors_get(i32 %38, i32 0)
%40 = load i32, i32* %2
%41 = call i32 @asserter_crash_if_not_equal(i32 %39, i32 %40, i32 33)
ret i32 0
}

LLVM IR (-O2):
define i32 @runner_main() {
%1 = tail call i32 (...) @bitgraph_empty()
%2 = tail call i32 @asserter_crash_if_not_equal(i32 %1, i32 0, i32 16)
%3 = tail call i32 (...) @bitgraph_empty()
%4 = tail call i32 @bitgraph_edge_add(i32 %3, i32 0, i32 0)
%5 = tail call i32 (...) @bitgraph_empty()
%6 = tail call i32 @asserter_crash_if_equal(i32 %4, i32 %5, i32 19)
%7 = tail call i32 (...) @bitgraph_empty()
%8 = tail call i32 @bitgraph_edge_add(i32 %7, i32 0, i32 0)
%9 = tail call i32 (...) @bitgraph_empty()
%10 = tail call i32 @bitgraph_edge_add(i32 %9, i32 0, i32 1)
%11 = tail call i32 @asserter_crash_if_equal(i32 %8, i32 %10, i32 20)
%12 = tail call i32 (...) @bitgraph_empty()
%13 = tail call i32 @bitgraph_edge_add(i32 %12, i32 1, i32 0)
%14 = tail call i32 (...) @bitgraph_empty()
%15 = tail call i32 @bitgraph_edge_add(i32 %14, i32 0, i32 1)
%16 = tail call i32 @asserter_crash_if_equal(i32 %13, i32 %15, i32 21)
%17 = tail call i32 (...) @bitgraph_empty()
%18 = tail call i32 @bitgraph_neighbors_get(i32 %17, i32 0)
%19 = tail call i32 (...) @bitset_empty()
%20 = tail call i32 @asserter_crash_if_not_equal(i32 %18, i32 %19, i32 24)
%21 = tail call i32 (...) @bitgraph_empty()
%22 = tail call i32 @bitgraph_edge_add(i32 %21, i32 0, i32 0)
%23 = tail call i32 @bitgraph_neighbors_get(i32 %22, i32 0)
%24 = tail call i32 (...) @bitset_empty()
%25 = tail call i32 @asserter_crash_if_equal(i32 %23, i32 %24, i32 25)
%26 = tail call i32 (...) @bitgraph_empty()
%27 = tail call i32 (...) @bitset_empty()
%28 = tail call i32 @bitgraph_edge_add(i32 %26, i32 0, i32 0)
%29 = tail call i32 @bitgraph_edge_add(i32 %28, i32 0, i32 1)
%30 = tail call i32 @bitgraph_edge_add(i32 %29, i32 0, i32 3)
%31 = tail call i32 @bitset_add(i32 %27, i32 0)
%32 = tail call i32 @bitset_add(i32 %31, i32 1)
%33 = tail call i32 @bitset_add(i32 %32, i32 3)
%34 = tail call i32 @bitgraph_neighbors_get(i32 %30, i32 0)
%35 = tail call i32 @asserter_crash_if_not_equal(i32 %34, i32 %33, i32 33)
ret i32 0
}