; LLVM IR from MostafaTwfiq/C-DataStructures-And-Algorithms :: Unit Test/Tests/DataStructuresTests/TreesTest/RedBlackTreeTest (RedBlackTreeTest)

; 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.ErrorTestStruct = type { i32 }

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local global ptr, align 8
@RBTreeTestTraversalArr = external dso_local global ptr, align 8
@__const.testRBTreePostOrderTraversal.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16
@__const.testRBTreePostOrderTraversal.traversalArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) #0

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

; Function Attrs: nounwind allocsize(0)
declare noalias ptr @malloc(i64 noundef) #2

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

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

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) #3

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) #3

; Function Attrs: nounwind
declare void @free(ptr noundef) #4

declare void @destroyRBTree(ptr noundef) #3

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

; Function Attrs: nocallback nofree nounwind willreturn memory(argmem: readwrite)
declare void @llvm.memcpy.p0.p0.i64(ptr noalias nocapture writeonly, ptr noalias nocapture readonly, i64, i1 immarg) #5

; Function Attrs: nounwind uwtable
declare dso_local void @printFunRBTT(ptr noundef, i32 noundef) #0

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreePostOrderTraversal(ptr noundef %0) #0 {
  %2 = alloca ptr, align 8
  %3 = alloca ptr, align 8
  %4 = alloca [13 x i32], align 16
  %5 = alloca i32, align 4
  %6 = alloca [13 x i32], align 16
  %7 = alloca ptr, align 8
  %8 = alloca i32, align 4
  store ptr %0, ptr %2, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %3) #6
  %9 = call ptr @redBlackTreeInitialization(ptr noundef @free, ptr noundef @compareIntPointersRBTT)
  store ptr %9, ptr %3, align 8, !tbaa !5
  call void @rBPostOrderTraversal(ptr noundef null, ptr noundef null)
  %10 = load ptr, ptr %2, align 8, !tbaa !5
  %11 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %12 = getelementptr inbounds %struct.ErrorTestStruct, ptr %11, i32 0, i32 0
  %13 = load i32, ptr %12, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %10, ptr noundef @.str, i32 noundef 501, ptr noundef null, i32 noundef -83386157, i32 noundef %13)
  %14 = load ptr, ptr %3, align 8, !tbaa !5
  call void @rBPostOrderTraversal(ptr noundef %14, ptr noundef null)
  %15 = load ptr, ptr %2, align 8, !tbaa !5
  %16 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %17 = getelementptr inbounds %struct.ErrorTestStruct, ptr %16, i32 0, i32 0
  %18 = load i32, ptr %17, align 4, !tbaa !9
  call void @CuAssertIntEquals_LineMsg(ptr noundef %15, ptr noundef @.str, i32 noundef 504, ptr noundef null, i32 noundef -83384987, i32 noundef %18)
  call void @llvm.lifetime.start.p0(i64 52, ptr %4) #6
  call void @llvm.memcpy.p0.p0.i64(ptr align 16 %4, ptr align 16 @__const.testRBTreePostOrderTraversal.valuesArr, i64 52, i1 false)
  call void @llvm.lifetime.start.p0(i64 4, ptr %5) #6
  store i32 0, ptr %5, align 4, !tbaa !12
  br label %19

19:                                               ; preds = %30, %1
  %20 = load i32, ptr %5, align 4, !tbaa !12
  %21 = icmp slt i32 %20, 13
  br i1 %21, label %23, label %22

22:                                               ; preds = %19
  call void @llvm.lifetime.end.p0(i64 4, ptr %5) #6
  br label %33

23:                                               ; preds = %19
  %24 = load ptr, ptr %3, align 8, !tbaa !5
  %25 = load i32, ptr %5, align 4, !tbaa !12
  %26 = sext i32 %25 to i64
  %27 = getelementptr inbounds [13 x i32], ptr %4, i64 0, i64 %26
  %28 = load i32, ptr %27, align 4, !tbaa !12
  %29 = call ptr @generateIntPointerRBTT(i32 noundef %28)
  call void @rBTreeInsert(ptr noundef %24, ptr noundef %29)
  br label %30

30:                                               ; preds = %23
  %31 = load i32, ptr %5, align 4, !tbaa !12
  %32 = add nsw i32 %31, 1
  store i32 %32, ptr %5, align 4, !tbaa !12
  br label %19, !llvm.loop !13

33:                                               ; preds = %22
  call void @llvm.lifetime.start.p0(i64 52, ptr %6) #6
  call void @llvm.memcpy.p0.p0.i64(ptr align 16 %6, ptr align 16 @__const.testRBTreePostOrderTraversal.traversalArr, i64 52, i1 false)
  %34 = call noalias ptr @malloc(i64 noundef 52) #7
  store ptr %34, ptr @RBTreeTestTraversalArr, align 8, !tbaa !5
  call void @llvm.lifetime.start.p0(i64 8, ptr %7) #6
  %35 = load ptr, ptr @RBTreeTestTraversalArr, align 8, !tbaa !5
  store ptr %35, ptr %7, align 8, !tbaa !5
  %36 = load ptr, ptr %3, align 8, !tbaa !5
  call void @rBPostOrderTraversal(ptr noundef %36, ptr noundef @printFunRBTT)
  call void @llvm.lifetime.start.p0(i64 4, ptr %8) #6
  store i32 0, ptr %8, align 4, !tbaa !12
  br label %37

37:                                               ; preds = %52, %33
  %38 = load i32, ptr %8, align 4, !tbaa !12
  %39 = icmp slt i32 %38, 13
  br i1 %39, label %41, label %40

40:                                               ; preds = %37
  call void @llvm.lifetime.end.p0(i64 4, ptr %8) #6
  br label %55

41:                                               ; preds = %37
  %42 = load ptr, ptr %2, align 8, !tbaa !5
  %43 = load i32, ptr %8, align 4, !tbaa !12
  %44 = sext i32 %43 to i64
  %45 = getelementptr inbounds [13 x i32], ptr %6, i64 0, i64 %44
  %46 = load i32, ptr %45, align 4, !tbaa !12
  %47 = load ptr, ptr %7, align 8, !tbaa !5
  %48 = load i32, ptr %8, align 4, !tbaa !12
  %49 = sext i32 %48 to i64
  %50 = getelementptr inbounds i32, ptr %47, i64 %49
  %51 = load i32, ptr %50, align 4, !tbaa !12
  call void @CuAssertIntEquals_LineMsg(ptr noundef %42, ptr noundef @.str, i32 noundef 519, ptr noundef null, i32 noundef %46, i32 noundef %51)
  br label %52

52:                                               ; preds = %41
  %53 = load i32, ptr %8, align 4, !tbaa !12
  %54 = add nsw i32 %53, 1
  store i32 %54, ptr %8, align 4, !tbaa !12
  br label %37, !llvm.loop !15

55:                                               ; preds = %40
  %56 = load ptr, ptr %7, align 8, !tbaa !5
  call void @free(ptr noundef %56) #6
  %57 = load ptr, ptr %3, align 8, !tbaa !5
  call void @destroyRBTree(ptr noundef %57)
  call void @llvm.lifetime.end.p0(i64 8, ptr %7) #6
  call void @llvm.lifetime.end.p0(i64 52, ptr %6) #6
  call void @llvm.lifetime.end.p0(i64 52, ptr %4) #6
  call void @llvm.lifetime.end.p0(i64 8, ptr %3) #6
  ret void
}

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

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 allocsize(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 #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 "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 = { nocallback nofree nounwind willreturn memory(argmem: readwrite) }
attributes #6 = { nounwind }
attributes #7 = { nounwind allocsize(0) }

!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 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}
!13 = distinct !{!13, !14}
!14 = !{!"llvm.loop.mustprogress"}
!15 = distinct !{!15, !14}


; 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"

@.str = external hidden unnamed_addr constant [160 x i8], align 1
@ERROR_TEST = external dso_local local_unnamed_addr global ptr, align 8
@RBTreeTestTraversalArr = external dso_local local_unnamed_addr global ptr, align 8
@__const.testRBTreePostOrderTraversal.valuesArr = external hidden unnamed_addr constant [13 x i32], align 16
@__const.testRBTreePostOrderTraversal.traversalArr = external hidden unnamed_addr constant [13 x i32], align 16

; Function Attrs: nounwind uwtable
declare dso_local ptr @generateIntPointerRBTT(i32 noundef) local_unnamed_addr #0

; Function Attrs: mustprogress nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(inaccessiblemem: readwrite)
declare noalias noundef ptr @malloc(i64 noundef) local_unnamed_addr #1

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

declare ptr @redBlackTreeInitialization(ptr noundef, ptr noundef) local_unnamed_addr #2

declare void @CuAssertIntEquals_LineMsg(ptr noundef, ptr noundef, i32 noundef, ptr noundef, i32 noundef, i32 noundef) local_unnamed_addr #2

; Function Attrs: mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite)
declare void @free(ptr allocptr nocapture noundef) #3

declare void @destroyRBTree(ptr noundef) local_unnamed_addr #2

declare void @rBTreeInsert(ptr noundef, ptr noundef) local_unnamed_addr #2

; Function Attrs: nounwind uwtable
declare dso_local void @printFunRBTT(ptr noundef, i32 noundef) #0

; Function Attrs: nounwind uwtable
define dso_local void @testRBTreePostOrderTraversal(ptr noundef %0) local_unnamed_addr #0 {
  %2 = tail call ptr @redBlackTreeInitialization(ptr noundef nonnull @free, ptr noundef nonnull @compareIntPointersRBTT) #4
  tail call void @rBPostOrderTraversal(ptr noundef null, ptr noundef null) #4
  %3 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %4 = load i32, ptr %3, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 501, ptr noundef null, i32 noundef -83386157, i32 noundef %4) #4
  tail call void @rBPostOrderTraversal(ptr noundef %2, ptr noundef null) #4
  %5 = load ptr, ptr @ERROR_TEST, align 8, !tbaa !5
  %6 = load i32, ptr %5, align 4, !tbaa !9
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 504, ptr noundef null, i32 noundef -83384987, i32 noundef %6) #4
  %7 = load i32, ptr @__const.testRBTreePostOrderTraversal.valuesArr, align 16, !tbaa !12
  %8 = tail call ptr @generateIntPointerRBTT(i32 noundef %7)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %8) #4
  %9 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 4), align 4, !tbaa !12
  %10 = tail call ptr @generateIntPointerRBTT(i32 noundef %9)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %10) #4
  %11 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 8), align 8, !tbaa !12
  %12 = tail call ptr @generateIntPointerRBTT(i32 noundef %11)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %12) #4
  %13 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 12), align 4, !tbaa !12
  %14 = tail call ptr @generateIntPointerRBTT(i32 noundef %13)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %14) #4
  %15 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 16), align 16, !tbaa !12
  %16 = tail call ptr @generateIntPointerRBTT(i32 noundef %15)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %16) #4
  %17 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 20), align 4, !tbaa !12
  %18 = tail call ptr @generateIntPointerRBTT(i32 noundef %17)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %18) #4
  %19 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 24), align 8, !tbaa !12
  %20 = tail call ptr @generateIntPointerRBTT(i32 noundef %19)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %20) #4
  %21 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 28), align 4, !tbaa !12
  %22 = tail call ptr @generateIntPointerRBTT(i32 noundef %21)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %22) #4
  %23 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 32), align 16, !tbaa !12
  %24 = tail call ptr @generateIntPointerRBTT(i32 noundef %23)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %24) #4
  %25 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 36), align 4, !tbaa !12
  %26 = tail call ptr @generateIntPointerRBTT(i32 noundef %25)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %26) #4
  %27 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 40), align 8, !tbaa !12
  %28 = tail call ptr @generateIntPointerRBTT(i32 noundef %27)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %28) #4
  %29 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 44), align 4, !tbaa !12
  %30 = tail call ptr @generateIntPointerRBTT(i32 noundef %29)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %30) #4
  %31 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.valuesArr, i64 48), align 16, !tbaa !12
  %32 = tail call ptr @generateIntPointerRBTT(i32 noundef %31)
  tail call void @rBTreeInsert(ptr noundef %2, ptr noundef %32) #4
  %33 = tail call noalias dereferenceable_or_null(52) ptr @malloc(i64 noundef 52) #5
  store ptr %33, ptr @RBTreeTestTraversalArr, align 8, !tbaa !5
  tail call void @rBPostOrderTraversal(ptr noundef %2, ptr noundef nonnull @printFunRBTT) #4
  %34 = load i32, ptr @__const.testRBTreePostOrderTraversal.traversalArr, align 16, !tbaa !12
  %35 = load i32, ptr %33, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %34, i32 noundef %35) #4
  %36 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 4), align 4, !tbaa !12
  %37 = getelementptr inbounds i8, ptr %33, i64 4
  %38 = load i32, ptr %37, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %36, i32 noundef %38) #4
  %39 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 8), align 8, !tbaa !12
  %40 = getelementptr inbounds i8, ptr %33, i64 8
  %41 = load i32, ptr %40, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %39, i32 noundef %41) #4
  %42 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 12), align 4, !tbaa !12
  %43 = getelementptr inbounds i8, ptr %33, i64 12
  %44 = load i32, ptr %43, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %42, i32 noundef %44) #4
  %45 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 16), align 16, !tbaa !12
  %46 = getelementptr inbounds i8, ptr %33, i64 16
  %47 = load i32, ptr %46, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %45, i32 noundef %47) #4
  %48 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 20), align 4, !tbaa !12
  %49 = getelementptr inbounds i8, ptr %33, i64 20
  %50 = load i32, ptr %49, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %48, i32 noundef %50) #4
  %51 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 24), align 8, !tbaa !12
  %52 = getelementptr inbounds i8, ptr %33, i64 24
  %53 = load i32, ptr %52, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %51, i32 noundef %53) #4
  %54 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 28), align 4, !tbaa !12
  %55 = getelementptr inbounds i8, ptr %33, i64 28
  %56 = load i32, ptr %55, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %54, i32 noundef %56) #4
  %57 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 32), align 16, !tbaa !12
  %58 = getelementptr inbounds i8, ptr %33, i64 32
  %59 = load i32, ptr %58, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %57, i32 noundef %59) #4
  %60 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 36), align 4, !tbaa !12
  %61 = getelementptr inbounds i8, ptr %33, i64 36
  %62 = load i32, ptr %61, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %60, i32 noundef %62) #4
  %63 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 40), align 8, !tbaa !12
  %64 = getelementptr inbounds i8, ptr %33, i64 40
  %65 = load i32, ptr %64, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %63, i32 noundef %65) #4
  %66 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 44), align 4, !tbaa !12
  %67 = getelementptr inbounds i8, ptr %33, i64 44
  %68 = load i32, ptr %67, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %66, i32 noundef %68) #4
  %69 = load i32, ptr getelementptr inbounds (i8, ptr @__const.testRBTreePostOrderTraversal.traversalArr, i64 48), align 16, !tbaa !12
  %70 = getelementptr inbounds i8, ptr %33, i64 48
  %71 = load i32, ptr %70, align 4, !tbaa !12
  tail call void @CuAssertIntEquals_LineMsg(ptr noundef %0, ptr noundef nonnull @.str, i32 noundef 519, ptr noundef null, i32 noundef %69, i32 noundef %71) #4
  tail call void @free(ptr noundef %33) #4
  tail call void @destroyRBTree(ptr noundef %2) #4
  ret void
}

declare void @rBPostOrderTraversal(ptr noundef, ptr noundef) local_unnamed_addr #2

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 nofree nounwind willreturn allockind("alloc,uninitialized") allocsize(0) memory(inaccessiblemem: readwrite) "alloc-family"="malloc" "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 #2 = { "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 = { mustprogress nounwind willreturn allockind("free") memory(argmem: readwrite, inaccessiblemem: readwrite) "alloc-family"="malloc" "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 }
attributes #5 = { nounwind allocsize(0) }

!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 = !{!"ErrorTestStruct", !11, i64 0}
!11 = !{!"int", !7, i64 0}
!12 = !{!11, !11, i64 0}


; Effective O3 passes: EarlyCSEPass,GVNPass,GlobalOptPass,IndVarSimplifyPass,InferAlignmentPass,InferFunctionAttrsPass,InstCombinePass,LoopRotatePass,SROAPass,SimplifyCFGPass,TailCallElimPass