; LLVM IR from yourtion/LearningMasteringAlgorithms-C :: Example/bistree (main)

; Unoptimized IR (clang -disable-llvm-passes):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

%struct.BiTree_ = type { i32, ptr, ptr, ptr }

@.str = external hidden unnamed_addr constant [4 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.4 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.7 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.8 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.9 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.10 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.11 = external hidden unnamed_addr constant [4 x i8], align 1
@stdout = external global ptr, align 8
@.str.12 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.13 = external hidden unnamed_addr constant [17 x i8], align 1
@.str.14 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.15 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.16 = external hidden unnamed_addr constant [19 x i8], align 1
@.str.17 = external hidden unnamed_addr constant [14 x i8], align 1
@.str.18 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.19 = external hidden unnamed_addr constant [23 x i8], align 1
@.str.20 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.21 = external hidden unnamed_addr constant [10 x i8], align 1
@.str.22 = external hidden unnamed_addr constant [28 x i8], align 1

; Function Attrs: nounwind uwtable
define dso_local i32 @main(i32 noundef %0, ptr noundef %1) #0 {
  %3 = alloca i32, align 4
  %4 = alloca i32, align 4
  %5 = alloca ptr, align 8
  %6 = alloca %struct.BiTree_, align 8
  %7 = alloca ptr, align 8
  %8 = alloca [12 x [6 x i8]], align 16
  %9 = alloca [12 x [6 x i8]], align 16
  %10 = alloca i32, align 4
  store i32 0, ptr %3, align 4
  store i32 %0, ptr %4, align 4, !tbaa !5
  store ptr %1, ptr %5, align 8, !tbaa !9
  call void @llvm.lifetime.start.p0(i64 32, ptr %6) #4
  call void @llvm.lifetime.start.p0(i64 8, ptr %7) #4
  call void @llvm.lifetime.start.p0(i64 72, ptr %8) #4
  call void @llvm.lifetime.start.p0(i64 72, ptr %9) #4
  %11 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %12 = getelementptr inbounds [6 x i8], ptr %11, i64 0, i64 0
  %13 = call ptr @strcpy(ptr noundef %12, ptr noundef @.str) #4
  %14 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 1
  %15 = getelementptr inbounds [6 x i8], ptr %14, i64 0, i64 0
  %16 = call ptr @strcpy(ptr noundef %15, ptr noundef @.str.1) #4
  %17 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %18 = getelementptr inbounds [6 x i8], ptr %17, i64 0, i64 0
  %19 = call ptr @strcpy(ptr noundef %18, ptr noundef @.str.2) #4
  %20 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 3
  %21 = getelementptr inbounds [6 x i8], ptr %20, i64 0, i64 0
  %22 = call ptr @strcpy(ptr noundef %21, ptr noundef @.str.3) #4
  %23 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %24 = getelementptr inbounds [6 x i8], ptr %23, i64 0, i64 0
  %25 = call ptr @strcpy(ptr noundef %24, ptr noundef @.str.4) #4
  %26 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 5
  %27 = getelementptr inbounds [6 x i8], ptr %26, i64 0, i64 0
  %28 = call ptr @strcpy(ptr noundef %27, ptr noundef @.str.5) #4
  %29 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 6
  %30 = getelementptr inbounds [6 x i8], ptr %29, i64 0, i64 0
  %31 = call ptr @strcpy(ptr noundef %30, ptr noundef @.str.6) #4
  %32 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 7
  %33 = getelementptr inbounds [6 x i8], ptr %32, i64 0, i64 0
  %34 = call ptr @strcpy(ptr noundef %33, ptr noundef @.str.7) #4
  %35 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 8
  %36 = getelementptr inbounds [6 x i8], ptr %35, i64 0, i64 0
  %37 = call ptr @strcpy(ptr noundef %36, ptr noundef @.str.8) #4
  %38 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 9
  %39 = getelementptr inbounds [6 x i8], ptr %38, i64 0, i64 0
  %40 = call ptr @strcpy(ptr noundef %39, ptr noundef @.str.9) #4
  %41 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %42 = getelementptr inbounds [6 x i8], ptr %41, i64 0, i64 0
  %43 = call ptr @strcpy(ptr noundef %42, ptr noundef @.str.10) #4
  %44 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 11
  %45 = getelementptr inbounds [6 x i8], ptr %44, i64 0, i64 0
  %46 = call ptr @strcpy(ptr noundef %45, ptr noundef @.str.11) #4
  call void @bistree_init(ptr noundef %6, ptr noundef @compare_str, ptr noundef null)
  %47 = load ptr, ptr @stdout, align 8, !tbaa !9
  %48 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %47, ptr noundef @.str.12) #4
  %49 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %50 = getelementptr inbounds [6 x i8], ptr %49, i64 0, i64 0
  %51 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %50)
  %52 = icmp ne i32 %51, 0
  br i1 %52, label %53, label %54

53:                                               ; preds = %2
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

54:                                               ; preds = %2
  %55 = load ptr, ptr @stdout, align 8, !tbaa !9
  %56 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %57 = load i32, ptr %56, align 8, !tbaa !11
  %58 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %55, ptr noundef @.str.13, i32 noundef %57) #4
  %59 = load ptr, ptr @stdout, align 8, !tbaa !9
  %60 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %59, ptr noundef @.str.14) #4
  %61 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %62 = load ptr, ptr %61, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %62)
  %63 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %64 = getelementptr inbounds [6 x i8], ptr %63, i64 0, i64 0
  %65 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %64)
  %66 = icmp ne i32 %65, 0
  br i1 %66, label %67, label %68

67:                                               ; preds = %54
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

68:                                               ; preds = %54
  %69 = load ptr, ptr @stdout, align 8, !tbaa !9
  %70 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %71 = load i32, ptr %70, align 8, !tbaa !11
  %72 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %69, ptr noundef @.str.13, i32 noundef %71) #4
  %73 = load ptr, ptr @stdout, align 8, !tbaa !9
  %74 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %73, ptr noundef @.str.14) #4
  %75 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %76 = load ptr, ptr %75, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %76)
  %77 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %78 = getelementptr inbounds [6 x i8], ptr %77, i64 0, i64 0
  %79 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %78)
  %80 = icmp ne i32 %79, 0
  br i1 %80, label %81, label %82

81:                                               ; preds = %68
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

82:                                               ; preds = %68
  %83 = load ptr, ptr @stdout, align 8, !tbaa !9
  %84 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %85 = load i32, ptr %84, align 8, !tbaa !11
  %86 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %83, ptr noundef @.str.13, i32 noundef %85) #4
  %87 = load ptr, ptr @stdout, align 8, !tbaa !9
  %88 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %87, ptr noundef @.str.14) #4
  %89 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %90 = load ptr, ptr %89, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %90)
  %91 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 7
  %92 = getelementptr inbounds [6 x i8], ptr %91, i64 0, i64 0
  %93 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %92)
  %94 = icmp ne i32 %93, 0
  br i1 %94, label %95, label %96

95:                                               ; preds = %82
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

96:                                               ; preds = %82
  %97 = load ptr, ptr @stdout, align 8, !tbaa !9
  %98 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %99 = load i32, ptr %98, align 8, !tbaa !11
  %100 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %97, ptr noundef @.str.13, i32 noundef %99) #4
  %101 = load ptr, ptr @stdout, align 8, !tbaa !9
  %102 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %101, ptr noundef @.str.14) #4
  %103 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %104 = load ptr, ptr %103, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %104)
  %105 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 3
  %106 = getelementptr inbounds [6 x i8], ptr %105, i64 0, i64 0
  %107 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %106)
  %108 = icmp ne i32 %107, 0
  br i1 %108, label %109, label %110

109:                                              ; preds = %96
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

110:                                              ; preds = %96
  %111 = load ptr, ptr @stdout, align 8, !tbaa !9
  %112 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %113 = load i32, ptr %112, align 8, !tbaa !11
  %114 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %111, ptr noundef @.str.13, i32 noundef %113) #4
  %115 = load ptr, ptr @stdout, align 8, !tbaa !9
  %116 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %115, ptr noundef @.str.14) #4
  %117 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %118 = load ptr, ptr %117, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %118)
  %119 = load ptr, ptr @stdout, align 8, !tbaa !9
  %120 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %121 = getelementptr inbounds [6 x i8], ptr %120, i64 0, i64 0
  %122 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %119, ptr noundef @.str.15, ptr noundef %121) #4
  %123 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %124 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %123)
  %125 = icmp ne i32 %124, 0
  br i1 %125, label %126, label %131

126:                                              ; preds = %110
  %127 = load ptr, ptr @stdout, align 8, !tbaa !9
  %128 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %129 = getelementptr inbounds [6 x i8], ptr %128, i64 0, i64 0
  %130 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %127, ptr noundef @.str.16, ptr noundef %129) #4
  br label %140

131:                                              ; preds = %110
  %132 = load ptr, ptr @stdout, align 8, !tbaa !9
  %133 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %134 = load i32, ptr %133, align 8, !tbaa !11
  %135 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %132, ptr noundef @.str.13, i32 noundef %134) #4
  %136 = load ptr, ptr @stdout, align 8, !tbaa !9
  %137 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %136, ptr noundef @.str.14) #4
  %138 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %139 = load ptr, ptr %138, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %139)
  br label %140

140:                                              ; preds = %131, %126
  %141 = load ptr, ptr @stdout, align 8, !tbaa !9
  %142 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %143 = getelementptr inbounds [6 x i8], ptr %142, i64 0, i64 0
  %144 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %141, ptr noundef @.str.15, ptr noundef %143) #4
  %145 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %146 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %145)
  %147 = icmp ne i32 %146, 0
  br i1 %147, label %148, label %153

148:                                              ; preds = %140
  %149 = load ptr, ptr @stdout, align 8, !tbaa !9
  %150 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %151 = getelementptr inbounds [6 x i8], ptr %150, i64 0, i64 0
  %152 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %149, ptr noundef @.str.16, ptr noundef %151) #4
  br label %162

153:                                              ; preds = %140
  %154 = load ptr, ptr @stdout, align 8, !tbaa !9
  %155 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %156 = load i32, ptr %155, align 8, !tbaa !11
  %157 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %154, ptr noundef @.str.13, i32 noundef %156) #4
  %158 = load ptr, ptr @stdout, align 8, !tbaa !9
  %159 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %158, ptr noundef @.str.14) #4
  %160 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %161 = load ptr, ptr %160, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %161)
  br label %162

162:                                              ; preds = %153, %148
  %163 = load ptr, ptr @stdout, align 8, !tbaa !9
  %164 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %165 = getelementptr inbounds [6 x i8], ptr %164, i64 0, i64 0
  %166 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %163, ptr noundef @.str.15, ptr noundef %165) #4
  %167 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %168 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %167)
  %169 = icmp ne i32 %168, 0
  br i1 %169, label %170, label %175

170:                                              ; preds = %162
  %171 = load ptr, ptr @stdout, align 8, !tbaa !9
  %172 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %173 = getelementptr inbounds [6 x i8], ptr %172, i64 0, i64 0
  %174 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %171, ptr noundef @.str.16, ptr noundef %173) #4
  br label %184

175:                                              ; preds = %162
  %176 = load ptr, ptr @stdout, align 8, !tbaa !9
  %177 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %178 = load i32, ptr %177, align 8, !tbaa !11
  %179 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %176, ptr noundef @.str.13, i32 noundef %178) #4
  %180 = load ptr, ptr @stdout, align 8, !tbaa !9
  %181 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %180, ptr noundef @.str.14) #4
  %182 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %183 = load ptr, ptr %182, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %183)
  br label %184

184:                                              ; preds = %175, %170
  %185 = load ptr, ptr @stdout, align 8, !tbaa !9
  %186 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %187 = getelementptr inbounds [6 x i8], ptr %186, i64 0, i64 0
  %188 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %185, ptr noundef @.str.15, ptr noundef %187) #4
  %189 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %190 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %189)
  %191 = icmp ne i32 %190, 0
  br i1 %191, label %192, label %197

192:                                              ; preds = %184
  %193 = load ptr, ptr @stdout, align 8, !tbaa !9
  %194 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %195 = getelementptr inbounds [6 x i8], ptr %194, i64 0, i64 0
  %196 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %193, ptr noundef @.str.16, ptr noundef %195) #4
  br label %206

197:                                              ; preds = %184
  %198 = load ptr, ptr @stdout, align 8, !tbaa !9
  %199 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %200 = load i32, ptr %199, align 8, !tbaa !11
  %201 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %198, ptr noundef @.str.13, i32 noundef %200) #4
  %202 = load ptr, ptr @stdout, align 8, !tbaa !9
  %203 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %202, ptr noundef @.str.14) #4
  %204 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %205 = load ptr, ptr %204, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %205)
  br label %206

206:                                              ; preds = %197, %192
  %207 = load ptr, ptr @stdout, align 8, !tbaa !9
  %208 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %209 = getelementptr inbounds [6 x i8], ptr %208, i64 0, i64 0
  %210 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %207, ptr noundef @.str.17, ptr noundef %209) #4
  %211 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %212 = getelementptr inbounds [6 x i8], ptr %211, i64 0, i64 0
  %213 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %212)
  %214 = icmp ne i32 %213, 0
  br i1 %214, label %215, label %216

215:                                              ; preds = %206
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

216:                                              ; preds = %206
  %217 = load ptr, ptr @stdout, align 8, !tbaa !9
  %218 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %219 = load i32, ptr %218, align 8, !tbaa !11
  %220 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %217, ptr noundef @.str.13, i32 noundef %219) #4
  %221 = load ptr, ptr @stdout, align 8, !tbaa !9
  %222 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %221, ptr noundef @.str.14) #4
  %223 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %224 = load ptr, ptr %223, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %224)
  %225 = load ptr, ptr @stdout, align 8, !tbaa !9
  %226 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 11
  %227 = getelementptr inbounds [6 x i8], ptr %226, i64 0, i64 0
  %228 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %225, ptr noundef @.str.17, ptr noundef %227) #4
  %229 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 11
  %230 = getelementptr inbounds [6 x i8], ptr %229, i64 0, i64 0
  %231 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %230)
  %232 = icmp ne i32 %231, 0
  br i1 %232, label %233, label %234

233:                                              ; preds = %216
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

234:                                              ; preds = %216
  %235 = load ptr, ptr @stdout, align 8, !tbaa !9
  %236 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %237 = load i32, ptr %236, align 8, !tbaa !11
  %238 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %235, ptr noundef @.str.13, i32 noundef %237) #4
  %239 = load ptr, ptr @stdout, align 8, !tbaa !9
  %240 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %239, ptr noundef @.str.14) #4
  %241 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %242 = load ptr, ptr %241, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %242)
  %243 = load ptr, ptr @stdout, align 8, !tbaa !9
  %244 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %245 = getelementptr inbounds [6 x i8], ptr %244, i64 0, i64 0
  %246 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %243, ptr noundef @.str.17, ptr noundef %245) #4
  %247 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 2
  %248 = getelementptr inbounds [6 x i8], ptr %247, i64 0, i64 0
  %249 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %248)
  %250 = icmp ne i32 %249, 0
  br i1 %250, label %251, label %252

251:                                              ; preds = %234
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

252:                                              ; preds = %234
  %253 = load ptr, ptr @stdout, align 8, !tbaa !9
  %254 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %255 = load i32, ptr %254, align 8, !tbaa !11
  %256 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %253, ptr noundef @.str.13, i32 noundef %255) #4
  %257 = load ptr, ptr @stdout, align 8, !tbaa !9
  %258 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %257, ptr noundef @.str.14) #4
  %259 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %260 = load ptr, ptr %259, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %260)
  %261 = load ptr, ptr @stdout, align 8, !tbaa !9
  %262 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %263 = getelementptr inbounds [6 x i8], ptr %262, i64 0, i64 0
  %264 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %261, ptr noundef @.str.17, ptr noundef %263) #4
  %265 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 10
  %266 = getelementptr inbounds [6 x i8], ptr %265, i64 0, i64 0
  %267 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %266)
  %268 = icmp ne i32 %267, 0
  br i1 %268, label %269, label %270

269:                                              ; preds = %252
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

270:                                              ; preds = %252
  %271 = load ptr, ptr @stdout, align 8, !tbaa !9
  %272 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %273 = load i32, ptr %272, align 8, !tbaa !11
  %274 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %271, ptr noundef @.str.13, i32 noundef %273) #4
  %275 = load ptr, ptr @stdout, align 8, !tbaa !9
  %276 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %275, ptr noundef @.str.14) #4
  %277 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %278 = load ptr, ptr %277, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %278)
  %279 = load ptr, ptr @stdout, align 8, !tbaa !9
  %280 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %281 = getelementptr inbounds [6 x i8], ptr %280, i64 0, i64 0
  %282 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %279, ptr noundef @.str.17, ptr noundef %281) #4
  %283 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 4
  %284 = getelementptr inbounds [6 x i8], ptr %283, i64 0, i64 0
  %285 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %284)
  %286 = icmp ne i32 %285, 0
  br i1 %286, label %287, label %288

287:                                              ; preds = %270
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

288:                                              ; preds = %270
  %289 = load ptr, ptr @stdout, align 8, !tbaa !9
  %290 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %291 = load i32, ptr %290, align 8, !tbaa !11
  %292 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %289, ptr noundef @.str.13, i32 noundef %291) #4
  %293 = load ptr, ptr @stdout, align 8, !tbaa !9
  %294 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %293, ptr noundef @.str.14) #4
  %295 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %296 = load ptr, ptr %295, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %296)
  %297 = load ptr, ptr @stdout, align 8, !tbaa !9
  %298 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %297, ptr noundef @.str.18) #4
  %299 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 6
  %300 = getelementptr inbounds [6 x i8], ptr %299, i64 0, i64 0
  %301 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %300)
  %302 = icmp ne i32 %301, 0
  br i1 %302, label %303, label %304

303:                                              ; preds = %288
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

304:                                              ; preds = %288
  %305 = load ptr, ptr @stdout, align 8, !tbaa !9
  %306 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %307 = load i32, ptr %306, align 8, !tbaa !11
  %308 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %305, ptr noundef @.str.13, i32 noundef %307) #4
  %309 = load ptr, ptr @stdout, align 8, !tbaa !9
  %310 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %309, ptr noundef @.str.14) #4
  %311 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %312 = load ptr, ptr %311, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %312)
  %313 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 1
  %314 = getelementptr inbounds [6 x i8], ptr %313, i64 0, i64 0
  %315 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %314)
  %316 = icmp ne i32 %315, 0
  br i1 %316, label %317, label %318

317:                                              ; preds = %304
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

318:                                              ; preds = %304
  %319 = load ptr, ptr @stdout, align 8, !tbaa !9
  %320 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %321 = load i32, ptr %320, align 8, !tbaa !11
  %322 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %319, ptr noundef @.str.13, i32 noundef %321) #4
  %323 = load ptr, ptr @stdout, align 8, !tbaa !9
  %324 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %323, ptr noundef @.str.14) #4
  %325 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %326 = load ptr, ptr %325, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %326)
  %327 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 5
  %328 = getelementptr inbounds [6 x i8], ptr %327, i64 0, i64 0
  %329 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %328)
  %330 = icmp ne i32 %329, 0
  br i1 %330, label %331, label %332

331:                                              ; preds = %318
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

332:                                              ; preds = %318
  %333 = load ptr, ptr @stdout, align 8, !tbaa !9
  %334 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %335 = load i32, ptr %334, align 8, !tbaa !11
  %336 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %333, ptr noundef @.str.13, i32 noundef %335) #4
  %337 = load ptr, ptr @stdout, align 8, !tbaa !9
  %338 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %337, ptr noundef @.str.14) #4
  %339 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %340 = load ptr, ptr %339, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %340)
  %341 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 9
  %342 = getelementptr inbounds [6 x i8], ptr %341, i64 0, i64 0
  %343 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %342)
  %344 = icmp ne i32 %343, 0
  br i1 %344, label %345, label %346

345:                                              ; preds = %332
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

346:                                              ; preds = %332
  %347 = load ptr, ptr @stdout, align 8, !tbaa !9
  %348 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %349 = load i32, ptr %348, align 8, !tbaa !11
  %350 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %347, ptr noundef @.str.13, i32 noundef %349) #4
  %351 = load ptr, ptr @stdout, align 8, !tbaa !9
  %352 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %351, ptr noundef @.str.14) #4
  %353 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %354 = load ptr, ptr %353, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %354)
  %355 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 8
  %356 = getelementptr inbounds [6 x i8], ptr %355, i64 0, i64 0
  %357 = call i32 @bistree_insert(ptr noundef %6, ptr noundef %356)
  %358 = icmp ne i32 %357, 0
  br i1 %358, label %359, label %360

359:                                              ; preds = %346
  store i32 1, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

360:                                              ; preds = %346
  %361 = load ptr, ptr @stdout, align 8, !tbaa !9
  %362 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %363 = load i32, ptr %362, align 8, !tbaa !11
  %364 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %361, ptr noundef @.str.13, i32 noundef %363) #4
  %365 = load ptr, ptr @stdout, align 8, !tbaa !9
  %366 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %365, ptr noundef @.str.14) #4
  %367 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %368 = load ptr, ptr %367, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %368)
  %369 = load ptr, ptr @stdout, align 8, !tbaa !9
  %370 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 9
  %371 = getelementptr inbounds [6 x i8], ptr %370, i64 0, i64 0
  %372 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %369, ptr noundef @.str.15, ptr noundef %371) #4
  %373 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 9
  %374 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %373)
  %375 = icmp ne i32 %374, 0
  br i1 %375, label %376, label %381

376:                                              ; preds = %360
  %377 = load ptr, ptr @stdout, align 8, !tbaa !9
  %378 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 9
  %379 = getelementptr inbounds [6 x i8], ptr %378, i64 0, i64 0
  %380 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %377, ptr noundef @.str.16, ptr noundef %379) #4
  br label %390

381:                                              ; preds = %360
  %382 = load ptr, ptr @stdout, align 8, !tbaa !9
  %383 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %384 = load i32, ptr %383, align 8, !tbaa !11
  %385 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %382, ptr noundef @.str.13, i32 noundef %384) #4
  %386 = load ptr, ptr @stdout, align 8, !tbaa !9
  %387 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %386, ptr noundef @.str.14) #4
  %388 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %389 = load ptr, ptr %388, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %389)
  br label %390

390:                                              ; preds = %381, %376
  %391 = load ptr, ptr @stdout, align 8, !tbaa !9
  %392 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %393 = getelementptr inbounds [6 x i8], ptr %392, i64 0, i64 0
  %394 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %391, ptr noundef @.str.15, ptr noundef %393) #4
  %395 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %396 = call i32 @bistree_remove(ptr noundef %6, ptr noundef %395)
  %397 = icmp ne i32 %396, 0
  br i1 %397, label %398, label %403

398:                                              ; preds = %390
  %399 = load ptr, ptr @stdout, align 8, !tbaa !9
  %400 = getelementptr inbounds [12 x [6 x i8]], ptr %8, i64 0, i64 0
  %401 = getelementptr inbounds [6 x i8], ptr %400, i64 0, i64 0
  %402 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %399, ptr noundef @.str.16, ptr noundef %401) #4
  br label %412

403:                                              ; preds = %390
  %404 = load ptr, ptr @stdout, align 8, !tbaa !9
  %405 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 0
  %406 = load i32, ptr %405, align 8, !tbaa !11
  %407 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %404, ptr noundef @.str.13, i32 noundef %406) #4
  %408 = load ptr, ptr @stdout, align 8, !tbaa !9
  %409 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %408, ptr noundef @.str.14) #4
  %410 = getelementptr inbounds %struct.BiTree_, ptr %6, i32 0, i32 3
  %411 = load ptr, ptr %410, align 8, !tbaa !13
  call void @preorder_tree(ptr noundef %411)
  br label %412

412:                                              ; preds = %403, %398
  %413 = load ptr, ptr @stdout, align 8, !tbaa !9
  %414 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %413, ptr noundef @.str.19) #4
  %415 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 0
  %416 = getelementptr inbounds [6 x i8], ptr %415, i64 0, i64 0
  %417 = call ptr @strcpy(ptr noundef %416, ptr noundef @.str.10) #4
  %418 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 1
  %419 = getelementptr inbounds [6 x i8], ptr %418, i64 0, i64 0
  %420 = call ptr @strcpy(ptr noundef %419, ptr noundef @.str) #4
  %421 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 2
  %422 = getelementptr inbounds [6 x i8], ptr %421, i64 0, i64 0
  %423 = call ptr @strcpy(ptr noundef %422, ptr noundef @.str.9) #4
  %424 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 3
  %425 = getelementptr inbounds [6 x i8], ptr %424, i64 0, i64 0
  %426 = call ptr @strcpy(ptr noundef %425, ptr noundef @.str.1) #4
  %427 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 4
  %428 = getelementptr inbounds [6 x i8], ptr %427, i64 0, i64 0
  %429 = call ptr @strcpy(ptr noundef %428, ptr noundef @.str.20) #4
  %430 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 0
  %431 = getelementptr inbounds [6 x i8], ptr %430, i64 0, i64 0
  store ptr %431, ptr %7, align 8, !tbaa !9
  %432 = call i32 @bistree_lookup(ptr noundef %6, ptr noundef %7)
  %433 = icmp eq i32 %432, -1
  br i1 %433, label %434, label %438

434:                                              ; preds = %412
  %435 = load ptr, ptr @stdout, align 8, !tbaa !9
  %436 = load ptr, ptr %7, align 8, !tbaa !9
  %437 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %435, ptr noundef @.str.16, ptr noundef %436) #4
  br label %442

438:                                              ; preds = %412
  %439 = load ptr, ptr @stdout, align 8, !tbaa !9
  %440 = load ptr, ptr %7, align 8, !tbaa !9
  %441 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %439, ptr noundef @.str.21, ptr noundef %440) #4
  br label %442

442:                                              ; preds = %438, %434
  %443 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 1
  %444 = getelementptr inbounds [6 x i8], ptr %443, i64 0, i64 0
  store ptr %444, ptr %7, align 8, !tbaa !9
  %445 = call i32 @bistree_lookup(ptr noundef %6, ptr noundef %7)
  %446 = icmp eq i32 %445, -1
  br i1 %446, label %447, label %451

447:                                              ; preds = %442
  %448 = load ptr, ptr @stdout, align 8, !tbaa !9
  %449 = load ptr, ptr %7, align 8, !tbaa !9
  %450 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %448, ptr noundef @.str.16, ptr noundef %449) #4
  br label %455

451:                                              ; preds = %442
  %452 = load ptr, ptr @stdout, align 8, !tbaa !9
  %453 = load ptr, ptr %7, align 8, !tbaa !9
  %454 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %452, ptr noundef @.str.21, ptr noundef %453) #4
  br label %455

455:                                              ; preds = %451, %447
  %456 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 2
  %457 = getelementptr inbounds [6 x i8], ptr %456, i64 0, i64 0
  store ptr %457, ptr %7, align 8, !tbaa !9
  %458 = call i32 @bistree_lookup(ptr noundef %6, ptr noundef %7)
  %459 = icmp eq i32 %458, -1
  br i1 %459, label %460, label %464

460:                                              ; preds = %455
  %461 = load ptr, ptr @stdout, align 8, !tbaa !9
  %462 = load ptr, ptr %7, align 8, !tbaa !9
  %463 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %461, ptr noundef @.str.16, ptr noundef %462) #4
  br label %468

464:                                              ; preds = %455
  %465 = load ptr, ptr @stdout, align 8, !tbaa !9
  %466 = load ptr, ptr %7, align 8, !tbaa !9
  %467 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %465, ptr noundef @.str.21, ptr noundef %466) #4
  br label %468

468:                                              ; preds = %464, %460
  %469 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 3
  %470 = getelementptr inbounds [6 x i8], ptr %469, i64 0, i64 0
  store ptr %470, ptr %7, align 8, !tbaa !9
  %471 = call i32 @bistree_lookup(ptr noundef %6, ptr noundef %7)
  %472 = icmp eq i32 %471, -1
  br i1 %472, label %473, label %477

473:                                              ; preds = %468
  %474 = load ptr, ptr @stdout, align 8, !tbaa !9
  %475 = load ptr, ptr %7, align 8, !tbaa !9
  %476 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %474, ptr noundef @.str.16, ptr noundef %475) #4
  br label %481

477:                                              ; preds = %468
  %478 = load ptr, ptr @stdout, align 8, !tbaa !9
  %479 = load ptr, ptr %7, align 8, !tbaa !9
  %480 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %478, ptr noundef @.str.21, ptr noundef %479) #4
  br label %481

481:                                              ; preds = %477, %473
  %482 = getelementptr inbounds [12 x [6 x i8]], ptr %9, i64 0, i64 4
  %483 = getelementptr inbounds [6 x i8], ptr %482, i64 0, i64 0
  store ptr %483, ptr %7, align 8, !tbaa !9
  %484 = call i32 @bistree_lookup(ptr noundef %6, ptr noundef %7)
  %485 = icmp eq i32 %484, -1
  br i1 %485, label %486, label %490

486:                                              ; preds = %481
  %487 = load ptr, ptr @stdout, align 8, !tbaa !9
  %488 = load ptr, ptr %7, align 8, !tbaa !9
  %489 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %487, ptr noundef @.str.16, ptr noundef %488) #4
  br label %494

490:                                              ; preds = %481
  %491 = load ptr, ptr @stdout, align 8, !tbaa !9
  %492 = load ptr, ptr %7, align 8, !tbaa !9
  %493 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %491, ptr noundef @.str.21, ptr noundef %492) #4
  br label %494

494:                                              ; preds = %490, %486
  %495 = load ptr, ptr @stdout, align 8, !tbaa !9
  %496 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %495, ptr noundef @.str.22) #4
  call void @bistree_destroy(ptr noundef %6)
  store i32 0, ptr %3, align 4
  store i32 1, ptr %10, align 4
  br label %497

497:                                              ; preds = %494, %359, %345, %331, %317, %303, %287, %269, %251, %233, %215, %109, %95, %81, %67, %53
  call void @llvm.lifetime.end.p0(i64 72, ptr %9) #4
  call void @llvm.lifetime.end.p0(i64 72, ptr %8) #4
  call void @llvm.lifetime.end.p0(i64 8, ptr %7) #4
  call void @llvm.lifetime.end.p0(i64 32, ptr %6) #4
  %498 = load i32, ptr %3, align 4
  ret i32 %498
}

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: nounwind
declare ptr @strcpy(ptr noundef, ptr noundef) #2

declare void @bistree_init(ptr noundef, ptr noundef, ptr noundef) #3

; Function Attrs: nounwind uwtable
declare hidden i32 @compare_str(ptr noundef, ptr noundef) #0

; Function Attrs: nounwind
declare i32 @fprintf(ptr noundef, ptr noundef, ...) #2

declare i32 @bistree_insert(ptr noundef, ptr noundef) #3

; Function Attrs: nounwind uwtable
declare hidden void @preorder_tree(ptr noundef) #0

declare i32 @bistree_remove(ptr noundef, ptr noundef) #3

declare i32 @bistree_lookup(ptr noundef, ptr noundef) #3

declare void @bistree_destroy(ptr noundef) #3

; Function Attrs: nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #1

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { nounwind "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #4 = { nounwind }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"int", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !10, i64 0}
!10 = !{!"any pointer", !7, i64 0}
!11 = !{!12, !6, i64 0}
!12 = !{!"BiTree_", !6, i64 0, !10, i64 8, !10, i64 16, !10, i64 24}
!13 = !{!12, !10, i64 24}


; Optimized IR (opt -passes='default<O3>'):
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128"
target triple = "x86_64-unknown-linux-gnu"

%struct.BiTree_ = type { i32, ptr, ptr, ptr }

@.str = external hidden unnamed_addr constant [4 x i8], align 1
@.str.1 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.2 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.3 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.4 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.5 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.6 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.7 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.8 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.9 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.10 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.11 = external hidden unnamed_addr constant [4 x i8], align 1
@stdout = external local_unnamed_addr global ptr, align 8
@.str.12 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.13 = external hidden unnamed_addr constant [17 x i8], align 1
@.str.14 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.15 = external hidden unnamed_addr constant [13 x i8], align 1
@.str.16 = external hidden unnamed_addr constant [19 x i8], align 1
@.str.17 = external hidden unnamed_addr constant [14 x i8], align 1
@.str.18 = external hidden unnamed_addr constant [22 x i8], align 1
@.str.19 = external hidden unnamed_addr constant [23 x i8], align 1
@.str.20 = external hidden unnamed_addr constant [4 x i8], align 1
@.str.21 = external hidden unnamed_addr constant [10 x i8], align 1
@.str.22 = external hidden unnamed_addr constant [28 x i8], align 1

; Function Attrs: nounwind uwtable
define dso_local range(i32 0, 2) i32 @main(i32 noundef %0, ptr nocapture noundef readnone %1) local_unnamed_addr #0 {
  %3 = alloca %struct.BiTree_, align 8
  %4 = alloca ptr, align 8
  %5 = alloca [12 x [6 x i8]], align 16
  %6 = alloca [12 x [6 x i8]], align 16
  call void @llvm.lifetime.start.p0(i64 32, ptr nonnull %3) #5
  call void @llvm.lifetime.start.p0(i64 8, ptr nonnull %4) #5
  call void @llvm.lifetime.start.p0(i64 72, ptr nonnull %5) #5
  call void @llvm.lifetime.start.p0(i64 72, ptr nonnull %6) #5
  %7 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %5, ptr noundef nonnull dereferenceable(1) @.str) #5
  %8 = getelementptr inbounds i8, ptr %5, i64 6
  %9 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %8, ptr noundef nonnull dereferenceable(1) @.str.1) #5
  %10 = getelementptr inbounds i8, ptr %5, i64 12
  %11 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %10, ptr noundef nonnull dereferenceable(1) @.str.2) #5
  %12 = getelementptr inbounds i8, ptr %5, i64 18
  %13 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %12, ptr noundef nonnull dereferenceable(1) @.str.3) #5
  %14 = getelementptr inbounds i8, ptr %5, i64 24
  %15 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %14, ptr noundef nonnull dereferenceable(1) @.str.4) #5
  %16 = getelementptr inbounds i8, ptr %5, i64 30
  %17 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %16, ptr noundef nonnull dereferenceable(1) @.str.5) #5
  %18 = getelementptr inbounds i8, ptr %5, i64 36
  %19 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %18, ptr noundef nonnull dereferenceable(1) @.str.6) #5
  %20 = getelementptr inbounds i8, ptr %5, i64 42
  %21 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %20, ptr noundef nonnull dereferenceable(1) @.str.7) #5
  %22 = getelementptr inbounds i8, ptr %5, i64 48
  %23 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %22, ptr noundef nonnull dereferenceable(1) @.str.8) #5
  %24 = getelementptr inbounds i8, ptr %5, i64 54
  %25 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %24, ptr noundef nonnull dereferenceable(1) @.str.9) #5
  %26 = getelementptr inbounds i8, ptr %5, i64 60
  %27 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %26, ptr noundef nonnull dereferenceable(1) @.str.10) #5
  %28 = getelementptr inbounds i8, ptr %5, i64 66
  %29 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %28, ptr noundef nonnull dereferenceable(1) @.str.11) #5
  call void @bistree_init(ptr noundef nonnull %3, ptr noundef nonnull @compare_str, ptr noundef null) #5
  %30 = load ptr, ptr @stdout, align 8, !tbaa !5
  %31 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %30, ptr noundef nonnull @.str.12) #5
  %32 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %10) #5
  %.not = icmp eq i32 %32, 0
  br i1 %.not, label %33, label %281

33:                                               ; preds = %2
  %34 = load ptr, ptr @stdout, align 8, !tbaa !5
  %35 = load i32, ptr %3, align 8, !tbaa !9
  %36 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %34, ptr noundef nonnull @.str.13, i32 noundef %35) #5
  %37 = load ptr, ptr @stdout, align 8, !tbaa !5
  %38 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %37, ptr noundef nonnull @.str.14) #5
  %39 = getelementptr inbounds i8, ptr %3, i64 24
  %40 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %40)
  %41 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %14) #5
  %.not1 = icmp eq i32 %41, 0
  br i1 %.not1, label %42, label %281

42:                                               ; preds = %33
  %43 = load ptr, ptr @stdout, align 8, !tbaa !5
  %44 = load i32, ptr %3, align 8, !tbaa !9
  %45 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %43, ptr noundef nonnull @.str.13, i32 noundef %44) #5
  %46 = load ptr, ptr @stdout, align 8, !tbaa !5
  %47 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %46, ptr noundef nonnull @.str.14) #5
  %48 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %48)
  %49 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %26) #5
  %.not2 = icmp eq i32 %49, 0
  br i1 %.not2, label %50, label %281

50:                                               ; preds = %42
  %51 = load ptr, ptr @stdout, align 8, !tbaa !5
  %52 = load i32, ptr %3, align 8, !tbaa !9
  %53 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %51, ptr noundef nonnull @.str.13, i32 noundef %52) #5
  %54 = load ptr, ptr @stdout, align 8, !tbaa !5
  %55 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %54, ptr noundef nonnull @.str.14) #5
  %56 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %56)
  %57 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %20) #5
  %.not3 = icmp eq i32 %57, 0
  br i1 %.not3, label %58, label %281

58:                                               ; preds = %50
  %59 = load ptr, ptr @stdout, align 8, !tbaa !5
  %60 = load i32, ptr %3, align 8, !tbaa !9
  %61 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %59, ptr noundef nonnull @.str.13, i32 noundef %60) #5
  %62 = load ptr, ptr @stdout, align 8, !tbaa !5
  %63 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %62, ptr noundef nonnull @.str.14) #5
  %64 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %64)
  %65 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %12) #5
  %.not4 = icmp eq i32 %65, 0
  br i1 %.not4, label %66, label %281

66:                                               ; preds = %58
  %67 = load ptr, ptr @stdout, align 8, !tbaa !5
  %68 = load i32, ptr %3, align 8, !tbaa !9
  %69 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %67, ptr noundef nonnull @.str.13, i32 noundef %68) #5
  %70 = load ptr, ptr @stdout, align 8, !tbaa !5
  %71 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %70, ptr noundef nonnull @.str.14) #5
  %72 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %72)
  %73 = load ptr, ptr @stdout, align 8, !tbaa !5
  %74 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %73, ptr noundef nonnull @.str.15, ptr noundef nonnull %10) #5
  %75 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %10) #5
  %.not5 = icmp eq i32 %75, 0
  %76 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not5, label %79, label %77

77:                                               ; preds = %66
  %78 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %76, ptr noundef nonnull @.str.16, ptr noundef nonnull %10) #5
  br label %85

79:                                               ; preds = %66
  %80 = load i32, ptr %3, align 8, !tbaa !9
  %81 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %76, ptr noundef nonnull @.str.13, i32 noundef %80) #5
  %82 = load ptr, ptr @stdout, align 8, !tbaa !5
  %83 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %82, ptr noundef nonnull @.str.14) #5
  %84 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %84)
  br label %85

85:                                               ; preds = %79, %77
  %86 = load ptr, ptr @stdout, align 8, !tbaa !5
  %87 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %86, ptr noundef nonnull @.str.15, ptr noundef nonnull %26) #5
  %88 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %26) #5
  %.not6 = icmp eq i32 %88, 0
  %89 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not6, label %92, label %90

90:                                               ; preds = %85
  %91 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %89, ptr noundef nonnull @.str.16, ptr noundef nonnull %26) #5
  br label %98

92:                                               ; preds = %85
  %93 = load i32, ptr %3, align 8, !tbaa !9
  %94 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %89, ptr noundef nonnull @.str.13, i32 noundef %93) #5
  %95 = load ptr, ptr @stdout, align 8, !tbaa !5
  %96 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %95, ptr noundef nonnull @.str.14) #5
  %97 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %97)
  br label %98

98:                                               ; preds = %92, %90
  %99 = load ptr, ptr @stdout, align 8, !tbaa !5
  %100 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %99, ptr noundef nonnull @.str.15, ptr noundef nonnull %14) #5
  %101 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %14) #5
  %.not7 = icmp eq i32 %101, 0
  %102 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not7, label %105, label %103

103:                                              ; preds = %98
  %104 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %102, ptr noundef nonnull @.str.16, ptr noundef nonnull %14) #5
  br label %111

105:                                              ; preds = %98
  %106 = load i32, ptr %3, align 8, !tbaa !9
  %107 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %102, ptr noundef nonnull @.str.13, i32 noundef %106) #5
  %108 = load ptr, ptr @stdout, align 8, !tbaa !5
  %109 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %108, ptr noundef nonnull @.str.14) #5
  %110 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %110)
  br label %111

111:                                              ; preds = %105, %103
  %112 = load ptr, ptr @stdout, align 8, !tbaa !5
  %113 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %112, ptr noundef nonnull @.str.15, ptr noundef nonnull %5) #5
  %114 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %5) #5
  %.not8 = icmp eq i32 %114, 0
  %115 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not8, label %118, label %116

116:                                              ; preds = %111
  %117 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %115, ptr noundef nonnull @.str.16, ptr noundef nonnull %5) #5
  br label %124

118:                                              ; preds = %111
  %119 = load i32, ptr %3, align 8, !tbaa !9
  %120 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %115, ptr noundef nonnull @.str.13, i32 noundef %119) #5
  %121 = load ptr, ptr @stdout, align 8, !tbaa !5
  %122 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %121, ptr noundef nonnull @.str.14) #5
  %123 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %123)
  br label %124

124:                                              ; preds = %118, %116
  %125 = load ptr, ptr @stdout, align 8, !tbaa !5
  %126 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %125, ptr noundef nonnull @.str.17, ptr noundef nonnull %5) #5
  %127 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %5) #5
  %.not9 = icmp eq i32 %127, 0
  br i1 %.not9, label %128, label %281

128:                                              ; preds = %124
  %129 = load ptr, ptr @stdout, align 8, !tbaa !5
  %130 = load i32, ptr %3, align 8, !tbaa !9
  %131 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %129, ptr noundef nonnull @.str.13, i32 noundef %130) #5
  %132 = load ptr, ptr @stdout, align 8, !tbaa !5
  %133 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %132, ptr noundef nonnull @.str.14) #5
  %134 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %134)
  %135 = load ptr, ptr @stdout, align 8, !tbaa !5
  %136 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %135, ptr noundef nonnull @.str.17, ptr noundef nonnull %28) #5
  %137 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %28) #5
  %.not10 = icmp eq i32 %137, 0
  br i1 %.not10, label %138, label %281

138:                                              ; preds = %128
  %139 = load ptr, ptr @stdout, align 8, !tbaa !5
  %140 = load i32, ptr %3, align 8, !tbaa !9
  %141 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %139, ptr noundef nonnull @.str.13, i32 noundef %140) #5
  %142 = load ptr, ptr @stdout, align 8, !tbaa !5
  %143 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %142, ptr noundef nonnull @.str.14) #5
  %144 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %144)
  %145 = load ptr, ptr @stdout, align 8, !tbaa !5
  %146 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %145, ptr noundef nonnull @.str.17, ptr noundef nonnull %10) #5
  %147 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %10) #5
  %.not11 = icmp eq i32 %147, 0
  br i1 %.not11, label %148, label %281

148:                                              ; preds = %138
  %149 = load ptr, ptr @stdout, align 8, !tbaa !5
  %150 = load i32, ptr %3, align 8, !tbaa !9
  %151 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %149, ptr noundef nonnull @.str.13, i32 noundef %150) #5
  %152 = load ptr, ptr @stdout, align 8, !tbaa !5
  %153 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %152, ptr noundef nonnull @.str.14) #5
  %154 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %154)
  %155 = load ptr, ptr @stdout, align 8, !tbaa !5
  %156 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %155, ptr noundef nonnull @.str.17, ptr noundef nonnull %26) #5
  %157 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %26) #5
  %.not12 = icmp eq i32 %157, 0
  br i1 %.not12, label %158, label %281

158:                                              ; preds = %148
  %159 = load ptr, ptr @stdout, align 8, !tbaa !5
  %160 = load i32, ptr %3, align 8, !tbaa !9
  %161 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %159, ptr noundef nonnull @.str.13, i32 noundef %160) #5
  %162 = load ptr, ptr @stdout, align 8, !tbaa !5
  %163 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %162, ptr noundef nonnull @.str.14) #5
  %164 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %164)
  %165 = load ptr, ptr @stdout, align 8, !tbaa !5
  %166 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %165, ptr noundef nonnull @.str.17, ptr noundef nonnull %14) #5
  %167 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %14) #5
  %.not13 = icmp eq i32 %167, 0
  br i1 %.not13, label %168, label %281

168:                                              ; preds = %158
  %169 = load ptr, ptr @stdout, align 8, !tbaa !5
  %170 = load i32, ptr %3, align 8, !tbaa !9
  %171 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %169, ptr noundef nonnull @.str.13, i32 noundef %170) #5
  %172 = load ptr, ptr @stdout, align 8, !tbaa !5
  %173 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %172, ptr noundef nonnull @.str.14) #5
  %174 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %174)
  %175 = load ptr, ptr @stdout, align 8, !tbaa !5
  %176 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %175, ptr noundef nonnull @.str.18) #5
  %177 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %18) #5
  %.not14 = icmp eq i32 %177, 0
  br i1 %.not14, label %178, label %281

178:                                              ; preds = %168
  %179 = load ptr, ptr @stdout, align 8, !tbaa !5
  %180 = load i32, ptr %3, align 8, !tbaa !9
  %181 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %179, ptr noundef nonnull @.str.13, i32 noundef %180) #5
  %182 = load ptr, ptr @stdout, align 8, !tbaa !5
  %183 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %182, ptr noundef nonnull @.str.14) #5
  %184 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %184)
  %185 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %8) #5
  %.not15 = icmp eq i32 %185, 0
  br i1 %.not15, label %186, label %281

186:                                              ; preds = %178
  %187 = load ptr, ptr @stdout, align 8, !tbaa !5
  %188 = load i32, ptr %3, align 8, !tbaa !9
  %189 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %187, ptr noundef nonnull @.str.13, i32 noundef %188) #5
  %190 = load ptr, ptr @stdout, align 8, !tbaa !5
  %191 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %190, ptr noundef nonnull @.str.14) #5
  %192 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %192)
  %193 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %16) #5
  %.not16 = icmp eq i32 %193, 0
  br i1 %.not16, label %194, label %281

194:                                              ; preds = %186
  %195 = load ptr, ptr @stdout, align 8, !tbaa !5
  %196 = load i32, ptr %3, align 8, !tbaa !9
  %197 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %195, ptr noundef nonnull @.str.13, i32 noundef %196) #5
  %198 = load ptr, ptr @stdout, align 8, !tbaa !5
  %199 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %198, ptr noundef nonnull @.str.14) #5
  %200 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %200)
  %201 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %24) #5
  %.not17 = icmp eq i32 %201, 0
  br i1 %.not17, label %202, label %281

202:                                              ; preds = %194
  %203 = load ptr, ptr @stdout, align 8, !tbaa !5
  %204 = load i32, ptr %3, align 8, !tbaa !9
  %205 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %203, ptr noundef nonnull @.str.13, i32 noundef %204) #5
  %206 = load ptr, ptr @stdout, align 8, !tbaa !5
  %207 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %206, ptr noundef nonnull @.str.14) #5
  %208 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %208)
  %209 = call i32 @bistree_insert(ptr noundef nonnull %3, ptr noundef nonnull %22) #5
  %.not18 = icmp eq i32 %209, 0
  br i1 %.not18, label %210, label %281

210:                                              ; preds = %202
  %211 = load ptr, ptr @stdout, align 8, !tbaa !5
  %212 = load i32, ptr %3, align 8, !tbaa !9
  %213 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %211, ptr noundef nonnull @.str.13, i32 noundef %212) #5
  %214 = load ptr, ptr @stdout, align 8, !tbaa !5
  %215 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %214, ptr noundef nonnull @.str.14) #5
  %216 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %216)
  %217 = load ptr, ptr @stdout, align 8, !tbaa !5
  %218 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %217, ptr noundef nonnull @.str.15, ptr noundef nonnull %24) #5
  %219 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %24) #5
  %.not19 = icmp eq i32 %219, 0
  %220 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not19, label %223, label %221

221:                                              ; preds = %210
  %222 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %220, ptr noundef nonnull @.str.16, ptr noundef nonnull %24) #5
  br label %229

223:                                              ; preds = %210
  %224 = load i32, ptr %3, align 8, !tbaa !9
  %225 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %220, ptr noundef nonnull @.str.13, i32 noundef %224) #5
  %226 = load ptr, ptr @stdout, align 8, !tbaa !5
  %227 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %226, ptr noundef nonnull @.str.14) #5
  %228 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %228)
  br label %229

229:                                              ; preds = %223, %221
  %230 = load ptr, ptr @stdout, align 8, !tbaa !5
  %231 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %230, ptr noundef nonnull @.str.15, ptr noundef nonnull %5) #5
  %232 = call i32 @bistree_remove(ptr noundef nonnull %3, ptr noundef nonnull %5) #5
  %.not20 = icmp eq i32 %232, 0
  %233 = load ptr, ptr @stdout, align 8, !tbaa !5
  br i1 %.not20, label %236, label %234

234:                                              ; preds = %229
  %235 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %233, ptr noundef nonnull @.str.16, ptr noundef nonnull %5) #5
  br label %242

236:                                              ; preds = %229
  %237 = load i32, ptr %3, align 8, !tbaa !9
  %238 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %233, ptr noundef nonnull @.str.13, i32 noundef %237) #5
  %239 = load ptr, ptr @stdout, align 8, !tbaa !5
  %240 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %239, ptr noundef nonnull @.str.14) #5
  %241 = load ptr, ptr %39, align 8, !tbaa !12
  call void @preorder_tree(ptr noundef %241)
  br label %242

242:                                              ; preds = %236, %234
  %243 = load ptr, ptr @stdout, align 8, !tbaa !5
  %244 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %243, ptr noundef nonnull @.str.19) #5
  %245 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %6, ptr noundef nonnull dereferenceable(1) @.str.10) #5
  %246 = getelementptr inbounds i8, ptr %6, i64 6
  %247 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %246, ptr noundef nonnull dereferenceable(1) @.str) #5
  %248 = getelementptr inbounds i8, ptr %6, i64 12
  %249 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %248, ptr noundef nonnull dereferenceable(1) @.str.9) #5
  %250 = getelementptr inbounds i8, ptr %6, i64 18
  %251 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %250, ptr noundef nonnull dereferenceable(1) @.str.1) #5
  %252 = getelementptr inbounds i8, ptr %6, i64 24
  %253 = call ptr @strcpy(ptr noundef nonnull dereferenceable(1) %252, ptr noundef nonnull dereferenceable(1) @.str.20) #5
  store ptr %6, ptr %4, align 8, !tbaa !5
  %254 = call i32 @bistree_lookup(ptr noundef nonnull %3, ptr noundef nonnull %4) #5
  %255 = icmp eq i32 %254, -1
  %256 = load ptr, ptr @stdout, align 8, !tbaa !5
  %257 = load ptr, ptr %4, align 8, !tbaa !5
  %.str.16..str.21 = select i1 %255, ptr @.str.16, ptr @.str.21
  %258 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %256, ptr noundef nonnull %.str.16..str.21, ptr noundef %257) #5
  store ptr %246, ptr %4, align 8, !tbaa !5
  %259 = call i32 @bistree_lookup(ptr noundef nonnull %3, ptr noundef nonnull %4) #5
  %260 = icmp eq i32 %259, -1
  %261 = load ptr, ptr @stdout, align 8, !tbaa !5
  %262 = load ptr, ptr %4, align 8, !tbaa !5
  %.str.16..str.2125 = select i1 %260, ptr @.str.16, ptr @.str.21
  %263 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %261, ptr noundef nonnull %.str.16..str.2125, ptr noundef %262) #5
  store ptr %248, ptr %4, align 8, !tbaa !5
  %264 = call i32 @bistree_lookup(ptr noundef nonnull %3, ptr noundef nonnull %4) #5
  %265 = icmp eq i32 %264, -1
  %266 = load ptr, ptr @stdout, align 8, !tbaa !5
  %267 = load ptr, ptr %4, align 8, !tbaa !5
  %.str.16..str.2123 = select i1 %265, ptr @.str.16, ptr @.str.21
  %268 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %266, ptr noundef nonnull %.str.16..str.2123, ptr noundef %267) #5
  store ptr %250, ptr %4, align 8, !tbaa !5
  %269 = call i32 @bistree_lookup(ptr noundef nonnull %3, ptr noundef nonnull %4) #5
  %270 = icmp eq i32 %269, -1
  %271 = load ptr, ptr @stdout, align 8, !tbaa !5
  %272 = load ptr, ptr %4, align 8, !tbaa !5
  %.str.16..str.2126 = select i1 %270, ptr @.str.16, ptr @.str.21
  %273 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %271, ptr noundef nonnull %.str.16..str.2126, ptr noundef %272) #5
  store ptr %252, ptr %4, align 8, !tbaa !5
  %274 = call i32 @bistree_lookup(ptr noundef nonnull %3, ptr noundef nonnull %4) #5
  %275 = icmp eq i32 %274, -1
  %276 = load ptr, ptr @stdout, align 8, !tbaa !5
  %277 = load ptr, ptr %4, align 8, !tbaa !5
  %.str.16..str.2124 = select i1 %275, ptr @.str.16, ptr @.str.21
  %278 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %276, ptr noundef nonnull %.str.16..str.2124, ptr noundef %277) #5
  %279 = load ptr, ptr @stdout, align 8, !tbaa !5
  %280 = call i32 (ptr, ptr, ...) @fprintf(ptr noundef %279, ptr noundef nonnull @.str.22) #5
  call void @bistree_destroy(ptr noundef nonnull %3) #5
  br label %281

281:                                              ; preds = %202, %194, %186, %178, %168, %158, %148, %138, %128, %124, %58, %50, %42, %33, %2, %242
  %.0 = phi i32 [ 0, %242 ], [ 1, %2 ], [ 1, %33 ], [ 1, %42 ], [ 1, %50 ], [ 1, %58 ], [ 1, %124 ], [ 1, %128 ], [ 1, %138 ], [ 1, %148 ], [ 1, %158 ], [ 1, %168 ], [ 1, %178 ], [ 1, %186 ], [ 1, %194 ], [ 1, %202 ]
  call void @llvm.lifetime.end.p0(i64 72, ptr nonnull %6) #5
  call void @llvm.lifetime.end.p0(i64 72, ptr nonnull %5) #5
  call void @llvm.lifetime.end.p0(i64 8, ptr nonnull %4) #5
  call void @llvm.lifetime.end.p0(i64 32, ptr nonnull %3) #5
  ret i32 %.0
}

; Function Attrs: mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.start.p0(i64 immarg, ptr nocapture) #1

; Function Attrs: mustprogress nofree nounwind willreturn memory(argmem: readwrite)
declare ptr @strcpy(ptr noalias noundef returned writeonly, ptr noalias nocapture noundef readonly) local_unnamed_addr #2

declare void @bistree_init(ptr noundef, ptr noundef, ptr noundef) local_unnamed_addr #3

; Function Attrs: nounwind uwtable
declare hidden i32 @compare_str(ptr noundef, ptr noundef) #0

; Function Attrs: nofree nounwind
declare noundef i32 @fprintf(ptr nocapture noundef, ptr nocapture noundef readonly, ...) local_unnamed_addr #4

declare i32 @bistree_insert(ptr noundef, ptr noundef) local_unnamed_addr #3

; Function Attrs: nounwind uwtable
declare hidden void @preorder_tree(ptr noundef) local_unnamed_addr #0

declare i32 @bistree_remove(ptr noundef, ptr noundef) local_unnamed_addr #3

declare i32 @bistree_lookup(ptr noundef, ptr noundef) local_unnamed_addr #3

declare void @bistree_destroy(ptr noundef) local_unnamed_addr #3

; Function Attrs: mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite)
declare void @llvm.lifetime.end.p0(i64 immarg, ptr nocapture) #1

attributes #0 = { nounwind uwtable "min-legal-vector-width"="0" "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #1 = { mustprogress nocallback nofree nosync nounwind willreturn memory(argmem: readwrite) }
attributes #2 = { mustprogress nofree nounwind willreturn memory(argmem: readwrite) "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #3 = { "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #4 = { nofree nounwind "no-trapping-math"="true" "stack-protector-buffer-size"="8" "target-cpu"="x86-64" "target-features"="+cmov,+cx8,+fxsr,+mmx,+sse,+sse2,+x87" "tune-cpu"="generic" }
attributes #5 = { nounwind }

!llvm.module.flags = !{!0, !1, !2, !3}
!llvm.ident = !{!4}

!0 = !{i32 1, !"wchar_size", i32 4}
!1 = !{i32 8, !"PIC Level", i32 2}
!2 = !{i32 7, !"PIE Level", i32 2}
!3 = !{i32 7, !"uwtable", i32 2}
!4 = !{!"clang version 19.1.0 (git@github.com:llvm/llvm-project.git a4bf6cd7cfb1a1421ba92bca9d017b49936c55e4)"}
!5 = !{!6, !6, i64 0}
!6 = !{!"any pointer", !7, i64 0}
!7 = !{!"omnipotent char", !8, i64 0}
!8 = !{!"Simple C/C++ TBAA"}
!9 = !{!10, !11, i64 0}
!10 = !{!"BiTree_", !11, i64 0, !6, i64 8, !6, i64 16, !6, i64 24}
!11 = !{!"int", !7, i64 0}
!12 = !{!10, !6, i64 24}


; Effective O3 passes: EarlyCSEPass,GlobalOptPass,IPSCCPPass,InferFunctionAttrsPass,InstCombinePass,PostOrderFunctionAttrsPass,SROAPass,SimplifyCFGPass