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

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ printf(char *);
void print_help(void) {
  printf("\n");
  printf("NAME\n");
  printf("    gbla - Linear algebra for Groebner basis computations\n");
  printf("\n");
  printf("SYNOPSIS\n");
  printf("    gbla [options] [file..]\n");
  printf("\n");
  printf("DESCRIPTION\n");
  printf("    Computes Gaussian Elimination of a structured hybrid sparse-\n");
  printf("    dense matrix coming from Groebner basis computations.\n");
  printf("\n");
  printf("OPTIONS\n");
  printf("    -b          Dimensions of a block in submatrices.\n");
  printf("                Default: 256.\n");
  printf("                NOTE: The block dimension must be a multiple of "
         "__GBLA_LOOP_UNROLL_BIG\n");
  printf("                      which is by default 64. You can reset "
         "__GBLA_LOOP_UNROLL_BIG in \n");
  printf("                      src/gb_config.h.in (you need to rebuild the "
         "library afterwards).\n");
  printf("    -d          Reads in different matrix format (at the moment only "
         "for matrices arising\n");
  printf("                from the Prym-Green conjecture. \n");
  printf("    -f          Free memory on the go.\n");
  printf("                Default: 1, memory is freed on the go.\n");
  printf("                Use 0 for keeping complete memory until the end.\n");
  printf("    -g GIT      Outputs git commit hash if verbosity level is >0.\n");
  printf("    -h          Print help.\n");
  printf("    -n          Use the new format for matrices.\n");
  printf("    -o          Use third party dense reducer for D. By default this "
         "is FFLAS-FFPACK\n");
  printf("    -p          Writes intermediate matrices in pbm format.\n");
  printf("    -r          Compute a REDUCED row echelon form.\n");
  printf("    -s          Splicing options:\n");
  printf("                0: standard Faugère-Lachartre block method.\n");
  printf("                1: not reducing A, for rank profiling.\n");
  printf("                2: standard Faugère-Lachartre block method, "
         "completely multiline.   (OLD VERSION)\n");
  printf("                3: A and C are multiline, B and D are blocks, "
         "completely multiline. (OLD VERSION)\n");
  printf("                Default: 1.\n");
  printf("    -t THRDS    Number of threads used.\n");
  printf("                Default: 1.\n");
  printf("    -v LEVEL    Level of verbosity:\n");
  printf("                1 -> only error messages printed\n");
  printf("                2 -> some meta information printed\n");
  printf("                3 -> additionally meta information printed\n");
  printf(
      "                Note: Everything >2 is time consuming and slows down\n");
  printf("                      the overall computations.\n");
  printf("\n");
  return;
}


x86 assembly (clang, -O0):
<print_help>:
push   %rbp
mov    %rsp,%rbp
lea    0x11c9(%rip),%rdi
call   1030 <printf@plt>
lea    0xed9(%rip),%rdi
call   1030 <printf@plt>
lea    0xed3(%rip),%rdi
call   1030 <printf@plt>
lea    0x11a5(%rip),%rdi
call   1030 <printf@plt>
lea    0xef6(%rip),%rdi
call   1030 <printf@plt>
lea    0xef4(%rip),%rdi
call   1030 <printf@plt>
lea    0x1181(%rip),%rdi
call   1030 <printf@plt>
lea    0xef9(%rip),%rdi
call   1030 <printf@plt>
lea    0xefa(%rip),%rdi
call   1030 <printf@plt>
lea    0xf30(%rip),%rdi
call   1030 <printf@plt>
lea    0x1151(%rip),%rdi
call   1030 <printf@plt>
lea    0xf53(%rip),%rdi
call   1030 <printf@plt>
lea    0xf50(%rip),%rdi
call   1030 <printf@plt>
lea    0xf7b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf8e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfda(%rip),%rdi
call   1030 <printf@plt>
lea    0x1026(%rip),%rdi
call   1030 <printf@plt>
lea    0x1072(%rip),%rdi
call   1030 <printf@plt>
lea    0x10c1(%rip),%rdi
call   1030 <printf@plt>
lea    0x10e7(%rip),%rdi
call   1030 <printf@plt>
lea    0x1103(%rip),%rdi
call   1030 <printf@plt>
lea    0x112f(%rip),%rdi
call   1030 <printf@plt>
lea    0x1165(%rip),%rdi
call   1030 <printf@plt>
lea    0x119c(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ad(%rip),%rdi
call   1030 <printf@plt>
lea    0x11d3(%rip),%rdi
call   1030 <printf@plt>
lea    0x121d(%rip),%rdi
call   1030 <printf@plt>
lea    0x124e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1277(%rip),%rdi
call   1030 <printf@plt>
lea    0x128e(%rip),%rdi
call   1030 <printf@plt>
lea    0x12c0(%rip),%rdi
call   1030 <printf@plt>
lea    0x12ec(%rip),%rdi
call   1030 <printf@plt>
lea    0x1344(%rip),%rdi
call   1030 <printf@plt>
lea    0x139b(%rip),%rdi
call   1030 <printf@plt>
lea    0x13ac(%rip),%rdi
call   1030 <printf@plt>
lea    0x1383(%rip),%rdi
call   1030 <printf@plt>
lea    0x13bd(%rip),%rdi
call   1030 <printf@plt>
lea    0x13d6(%rip),%rdi
call   1030 <printf@plt>
lea    0x13fc(%rip),%rdi
call   1030 <printf@plt>
lea    0x1424(%rip),%rdi
call   1030 <printf@plt>
lea    0x1454(%rip),%rdi
call   1030 <printf@plt>
lea    0x148e(%rip),%rdi
call   1030 <printf@plt>
lea    0xfd1(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<print_help>:
push   %rbx
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xece(%rip),%rdi
call   1040 <puts@plt>
lea    0xec7(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xeeb(%rip),%rdi
call   1040 <puts@plt>
lea    0xee8(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xeee(%rip),%rdi
call   1040 <puts@plt>
lea    0xeee(%rip),%rdi
call   1040 <puts@plt>
lea    0xf23(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xf47(%rip),%rdi
call   1040 <puts@plt>
lea    0xf43(%rip),%rdi
call   1040 <puts@plt>
lea    0xf6d(%rip),%rdi
call   1040 <puts@plt>
lea    0xf7f(%rip),%rdi
call   1040 <puts@plt>
lea    0xfca(%rip),%rdi
call   1040 <puts@plt>
lea    0x1015(%rip),%rdi
call   1040 <puts@plt>
lea    0x1060(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ae(%rip),%rdi
call   1040 <puts@plt>
lea    0x10d3(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ee(%rip),%rdi
call   1040 <puts@plt>
lea    0x1119(%rip),%rdi
call   1040 <puts@plt>
lea    0x114e(%rip),%rdi
call   1040 <puts@plt>
lea    0x1184(%rip),%rdi
call   1040 <puts@plt>
lea    0x1194(%rip),%rdi
call   1040 <puts@plt>
lea    0x11b9(%rip),%rdi
call   1040 <puts@plt>
lea    0x1202(%rip),%rdi
call   1040 <puts@plt>
lea    0x1232(%rip),%rdi
call   1040 <puts@plt>
lea    0x125a(%rip),%rdi
call   1040 <puts@plt>
lea    0x1270(%rip),%rdi
call   1040 <puts@plt>
lea    0x12a1(%rip),%rdi
call   1040 <puts@plt>
lea    0x12cc(%rip),%rdi
call   1040 <puts@plt>
lea    0x1323(%rip),%rdi
call   1040 <puts@plt>
lea    0x13a1(%rip),%rbx
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0x136a(%rip),%rdi
call   1040 <puts@plt>
mov    %rbx,%rdi
call   1040 <puts@plt>
lea    0x139a(%rip),%rdi
call   1040 <puts@plt>
lea    0x13b2(%rip),%rdi
call   1040 <puts@plt>
lea    0x13d7(%rip),%rdi
call   1040 <puts@plt>
lea    0x13fe(%rip),%rdi
call   1040 <puts@plt>
lea    0x142d(%rip),%rdi
call   1040 <puts@plt>
lea    0x1466(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rbx
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [2 x i8] c"\0A\00"
@.str.1 = [6 x i8] c"NAME\0A\00"
@.str.2 = [59 x i8] c" gbla - Linear algebra for Groebner basis computations\0A\00"
@.str.3 = [10 x i8] c"SYNOPSIS\0A\00"
@.str.4 = [29 x i8] c" gbla [options] [file..]\0A\00"
@.str.5 = [13 x i8] c"DESCRIPTION\0A\00"
@.str.6 = [66 x i8] c" Computes Gaussian Elimination of a structured hybrid sparse-\0A\00"
@.str.7 = [59 x i8] c" dense matrix coming from Groebner basis computations.\0A\00"
@.str.8 = [9 x i8] c"OPTIONS\0A\00"
@.str.9 = [55 x i8] c" -b Dimensions of a block in submatrices.\0A\00"
@.str.10 = [31 x i8] c" Default: 256.\0A\00"
@.str.11 = [88 x i8] c" NOTE: The block dimension must be a multiple of __GBLA_LOOP_UNROLL_BIG\0A\00"
@.str.12 = [88 x i8] c" which is by default 64. You can reset __GBLA_LOOP_UNROLL_BIG in \0A\00"
@.str.13 = [88 x i8] c" src/gb_config.h.in (you need to rebuild the library afterwards).\0A\00"
@.str.14 = [91 x i8] c" -d Reads in different matrix format (at the moment only for matrices arising\0A\00"
@.str.15 = [50 x i8] c" from the Prym-Green conjecture. \0A\00"
@.str.16 = [40 x i8] c" -f Free memory on the go.\0A\00"
@.str.17 = [56 x i8] c" Default: 1, memory is freed on the go.\0A\00"
@.str.18 = [66 x i8] c" Use 0 for keeping complete memory until the end.\0A\00"
@.str.19 = [67 x i8] c" -g GIT Outputs git commit hash if verbosity level is >0.\0A\00"
@.str.20 = [29 x i8] c" -h Print help.\0A\00"
@.str.21 = [50 x i8] c" -n Use the new format for matrices.\0A\00"
@.str.22 = [86 x i8] c" -o Use third party dense reducer for D. By default this is FFLAS-FFPACK\0A\00"
@.str.23 = [61 x i8] c" -p Writes intermediate matrices in pbm format.\0A\00"
@.str.24 = [53 x i8] c" -r Compute a REDUCED row echelon form.\0A\00"
@.str.25 = [35 x i8] c" -s Splicing options:\0A\00"
@.str.26 = [62 x i8] c" 0: standard Faug\C3\A8re-Lachartre block method.\0A\00"
@.str.27 = [56 x i8] c" 1: not reducing A, for rank profiling.\0A\00"
@.str.28 = [100 x i8] c" 2: standard Faug\C3\A8re-Lachartre block method, completely multiline. (OLD VERSION)\0A\00"
@.str.29 = [99 x i8] c" 3: A and C are multiline, B and D are blocks, completely multiline. (OLD VERSION)\0A\00"
@.str.30 = [29 x i8] c" Default: 1.\0A\00"
@.str.31 = [41 x i8] c" -t THRDS Number of threads used.\0A\00"
@.str.32 = [37 x i8] c" -v LEVEL Level of verbosity:\0A\00"
@.str.33 = [50 x i8] c" 1 -> only error messages printed\0A\00"
@.str.34 = [52 x i8] c" 2 -> some meta information printed\0A\00"
@.str.35 = [60 x i8] c" 3 -> additionally meta information printed\0A\00"
@.str.36 = [70 x i8] c" Note: Everything >2 is time consuming and slows down\0A\00"
@.str.37 = [49 x i8] c" the overall computations.\0A\00"
define void @print_help() {
%1 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([6 x i8], [6 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.4, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.6, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([59 x i8], [59 x i8]* @.str.7, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.8, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.9, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.10, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([88 x i8], [88 x i8]* @.str.11, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([88 x i8], [88 x i8]* @.str.12, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([88 x i8], [88 x i8]* @.str.13, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([91 x i8], [91 x i8]* @.str.14, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.15, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.16, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.17, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([66 x i8], [66 x i8]* @.str.18, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([67 x i8], [67 x i8]* @.str.19, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.20, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.21, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([86 x i8], [86 x i8]* @.str.22, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.23, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([53 x i8], [53 x i8]* @.str.24, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.25, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([62 x i8], [62 x i8]* @.str.26, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.27, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([100 x i8], [100 x i8]* @.str.28, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([99 x i8], [99 x i8]* @.str.29, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.30, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.31, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([29 x i8], [29 x i8]* @.str.30, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.32, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.33, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.34, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([60 x i8], [60 x i8]* @.str.35, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.36, i64 0, i64 0))
%42 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.37, i64 0, i64 0))
%43 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [5 x i8] c"NAME\00"
@str.38 = [58 x i8] c" gbla - Linear algebra for Groebner basis computations\00"
@str.39 = [9 x i8] c"SYNOPSIS\00"
@str.40 = [28 x i8] c" gbla [options] [file..]\00"
@str.41 = [12 x i8] c"DESCRIPTION\00"
@str.42 = [65 x i8] c" Computes Gaussian Elimination of a structured hybrid sparse-\00"
@str.43 = [58 x i8] c" dense matrix coming from Groebner basis computations.\00"
@str.44 = [8 x i8] c"OPTIONS\00"
@str.45 = [54 x i8] c" -b Dimensions of a block in submatrices.\00"
@str.46 = [30 x i8] c" Default: 256.\00"
@str.47 = [87 x i8] c" NOTE: The block dimension must be a multiple of __GBLA_LOOP_UNROLL_BIG\00"
@str.48 = [87 x i8] c" which is by default 64. You can reset __GBLA_LOOP_UNROLL_BIG in \00"
@str.49 = [87 x i8] c" src/gb_config.h.in (you need to rebuild the library afterwards).\00"
@str.50 = [90 x i8] c" -d Reads in different matrix format (at the moment only for matrices arising\00"
@str.51 = [49 x i8] c" from the Prym-Green conjecture. \00"
@str.52 = [39 x i8] c" -f Free memory on the go.\00"
@str.53 = [55 x i8] c" Default: 1, memory is freed on the go.\00"
@str.54 = [65 x i8] c" Use 0 for keeping complete memory until the end.\00"
@str.55 = [66 x i8] c" -g GIT Outputs git commit hash if verbosity level is >0.\00"
@str.56 = [28 x i8] c" -h Print help.\00"
@str.57 = [49 x i8] c" -n Use the new format for matrices.\00"
@str.58 = [85 x i8] c" -o Use third party dense reducer for D. By default this is FFLAS-FFPACK\00"
@str.59 = [60 x i8] c" -p Writes intermediate matrices in pbm format.\00"
@str.60 = [52 x i8] c" -r Compute a REDUCED row echelon form.\00"
@str.61 = [34 x i8] c" -s Splicing options:\00"
@str.62 = [61 x i8] c" 0: standard Faug\C3\A8re-Lachartre block method.\00"
@str.63 = [55 x i8] c" 1: not reducing A, for rank profiling.\00"
@str.64 = [99 x i8] c" 2: standard Faug\C3\A8re-Lachartre block method, completely multiline. (OLD VERSION)\00"
@str.65 = [98 x i8] c" 3: A and C are multiline, B and D are blocks, completely multiline. (OLD VERSION)\00"
@str.67 = [40 x i8] c" -t THRDS Number of threads used.\00"
@str.68 = [28 x i8] c" Default: 1.\00"
@str.69 = [36 x i8] c" -v LEVEL Level of verbosity:\00"
@str.70 = [49 x i8] c" 1 -> only error messages printed\00"
@str.71 = [51 x i8] c" 2 -> some meta information printed\00"
@str.72 = [59 x i8] c" 3 -> additionally meta information printed\00"
@str.73 = [69 x i8] c" Note: Everything >2 is time consuming and slows down\00"
@str.74 = [48 x i8] c" the overall computations.\00"
define void @print_help() {
%1 = tail call i32 @putchar(i32 10)
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([5 x i8], [5 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.38, i64 0, i64 0))
%4 = tail call i32 @putchar(i32 10)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.39, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.40, i64 0, i64 0))
%7 = tail call i32 @putchar(i32 10)
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.41, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.42, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([58 x i8], [58 x i8]* @str.43, i64 0, i64 0))
%11 = tail call i32 @putchar(i32 10)
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str.44, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.45, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.46, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([87 x i8], [87 x i8]* @str.47, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([87 x i8], [87 x i8]* @str.48, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([87 x i8], [87 x i8]* @str.49, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([90 x i8], [90 x i8]* @str.50, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.51, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.52, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.53, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([65 x i8], [65 x i8]* @str.54, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([66 x i8], [66 x i8]* @str.55, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.56, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.57, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([85 x i8], [85 x i8]* @str.58, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.59, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([52 x i8], [52 x i8]* @str.60, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.61, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([61 x i8], [61 x i8]* @str.62, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.63, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([99 x i8], [99 x i8]* @str.64, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([98 x i8], [98 x i8]* @str.65, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.68, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.67, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([28 x i8], [28 x i8]* @str.68, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.69, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.70, i64 0, i64 0))
%39 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.71, i64 0, i64 0))
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([59 x i8], [59 x i8]* @str.72, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.73, i64 0, i64 0))
%42 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.74, i64 0, i64 0))
%43 = tail call i32 @putchar(i32 10)
ret void
}