INFO: No output directory specified (--dir) INFO: Using directory: "Test_box_20250815_183318" INFO: Regenerating c-file: Test_box.c DEBUG: CMD: /home/willend/micromamba/bin/mcstas -t -o ./Test_box.c Test_box.instr Warning: DECLARE block contains 2 assignments (= sign). Move them into an INITIALIZE section. May fail at compile. CFLAGS= -DFUNNEL ----------------------------------------------------------- Generating single GPU kernel or single CPU section layout: ----------------------------------------------------------- Generating GPU/CPU -DFUNNEL layout: Component test_sample is NOACC, CPUONLY=1 -> FUNNEL mode enabled, SPLIT within buffer. -> CPU section from component test_sample -> GPU kernel from component m4pi ----------------------------------------------------------- DEBUG: CMD: /home/willend/micromamba/bin/mcstas finished INFO: Linting generated code: ./Test_box.c DEBUG: CMD: cppcheck ./Test_box.c --check-level=exhaustive --force -DMCDEFAULT_NCOUNT=1000000 -UMC_PORTABLE -DND_BUFFER=10000000 -UNOABSORB_INF_NAN -UOMPI_MPI_H -DSIGABRT -DSIGBREAK -DSIGBUS -DSIGPE -DSIGHUP -DSIGILL -DSIGINT -DSIGKILL -DSIGUSR1 -DSIGUSR2 -DSIGPIPE -DSIGQUIT -DSIGSEGV -DSIGTRAP -DSIGURG -DSIGFPE -DSIGKILL -DSIGTERM -UTEST -UUSE_OPENCL -UWIN32 -UOPENACC -UGCCOFFLOAD -U_MSC_VER -U_MSC_EXTENSIONS -U_WIN32 -UWIN32 -D__unix__ -UDANSE -UFUNNEL -UMC_ANCIENT_COMPATIBILITY -UMC_POL_COMPAT -UNEUTRONICS -Uisnan -Uisinf Checking Test_box.c ... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1... Test_box.c:7811:5: error: Memory leak: temp_logger_with_data.logger_pointers [memleak] } else { ^ Test_box.c:7841:5: error: Memory leak: temp_abs_logger_with_data.abs_logger_pointers [memleak] } else { ^ Test_box.c:8472:5: error: Memory leak: temp_history.elements [memleak] } else { ^ Test_box.c:14717:5: error: Memory leak: removed_under_2.elements [memleak] }; ^ Test_box.c:7702:66: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate = 0;iterate < list->num_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7701:22: note: Assuming allocation function fails temp = malloc(list->num_elements * sizeof(int)); ^ Test_box.c:7701:22: note: Assignment 'temp=malloc(list->num_elements*sizeof(int))', assigned value is 0 temp = malloc(list->num_elements * sizeof(int)); ^ Test_box.c:7702:66: note: Null pointer dereference for (iterate = 0;iterate < list->num_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7705:92: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate = 0;iterate < list->num_elements;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7701:22: note: Assuming allocation function fails temp = malloc(list->num_elements * sizeof(int)); ^ Test_box.c:7701:22: note: Assignment 'temp=malloc(list->num_elements*sizeof(int))', assigned value is 0 temp = malloc(list->num_elements * sizeof(int)); ^ Test_box.c:7705:92: note: Null pointer dereference for (iterate = 0;iterate < list->num_elements;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7739:60: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7737:26: note: Assuming allocation function fails double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7737:26: note: Assignment 'temp=malloc(list->num_elements*sizeof(double))', assigned value is 0 double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7739:60: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7743:88: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7737:26: note: Assuming allocation function fails double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7737:26: note: Assignment 'temp=malloc(list->num_elements*sizeof(double))', assigned value is 0 double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7743:88: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7757:60: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7755:26: note: Assuming allocation function fails double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7755:26: note: Assignment 'temp=malloc(list->num_elements*sizeof(double))', assigned value is 0 double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7757:60: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:7761:88: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7755:26: note: Assuming allocation function fails double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7755:26: note: Assignment 'temp=malloc(list->num_elements*sizeof(double))', assigned value is 0 double *temp=malloc(list->num_elements*sizeof(double)); ^ Test_box.c:7761:88: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:7776:72: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = focus_data_array->elements[iterate]; ^ Test_box.c:7774:44: note: Assuming allocation function fails struct focus_data_struct *temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct)); ^ Test_box.c:7774:44: note: Assignment 'temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct))', assigned value is 0 struct focus_data_struct *temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct)); ^ Test_box.c:7776:72: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = focus_data_array->elements[iterate]; ^ Test_box.c:7780:112: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) focus_data_array->elements[iterate] = temp[iterate]; ^ Test_box.c:7774:44: note: Assuming allocation function fails struct focus_data_struct *temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct)); ^ Test_box.c:7774:44: note: Assignment 'temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct))', assigned value is 0 struct focus_data_struct *temp=malloc(focus_data_array->num_elements*sizeof(struct focus_data_struct)); ^ Test_box.c:7780:112: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) focus_data_array->elements[iterate] = temp[iterate]; ^ Test_box.c:7863:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_fp [nullPointerOutOfMemory] temp_fp[iterate] = list->conditional_functions[iterate]; ^ Test_box.c:7858:49: note: Assuming allocation function fails conditional_function_pointer *temp_fp=malloc(list->num_elements*sizeof(conditional_function_pointer)); ^ Test_box.c:7858:49: note: Assignment 'temp_fp=malloc(list->num_elements*sizeof(intconditional_function_pointer))', assigned value is 0 conditional_function_pointer *temp_fp=malloc(list->num_elements*sizeof(conditional_function_pointer)); ^ Test_box.c:7863:7: note: Null pointer dereference temp_fp[iterate] = list->conditional_functions[iterate]; ^ Test_box.c:7864:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_du [nullPointerOutOfMemory] temp_du[iterate] = list->p_data_unions[iterate]; ^ Test_box.c:7859:50: note: Assuming allocation function fails union conditional_data_union **temp_du=malloc(list->num_elements*sizeof(union conditional_data_union)); ^ Test_box.c:7859:50: note: Assignment 'temp_du=malloc(list->num_elements*sizeof(union conditional_data_union))', assigned value is 0 union conditional_data_union **temp_du=malloc(list->num_elements*sizeof(union conditional_data_union)); ^ Test_box.c:7864:7: note: Null pointer dereference temp_du[iterate] = list->p_data_unions[iterate]; ^ Test_box.c:7873:46: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_fp [nullPointerOutOfMemory] list->conditional_functions[iterate] = temp_fp[iterate]; ^ Test_box.c:7858:49: note: Assuming allocation function fails conditional_function_pointer *temp_fp=malloc(list->num_elements*sizeof(conditional_function_pointer)); ^ Test_box.c:7858:49: note: Assignment 'temp_fp=malloc(list->num_elements*sizeof(intconditional_function_pointer))', assigned value is 0 conditional_function_pointer *temp_fp=malloc(list->num_elements*sizeof(conditional_function_pointer)); ^ Test_box.c:7873:46: note: Null pointer dereference list->conditional_functions[iterate] = temp_fp[iterate]; ^ Test_box.c:7874:38: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_du [nullPointerOutOfMemory] list->p_data_unions[iterate] = temp_du[iterate]; ^ Test_box.c:7859:50: note: Assuming allocation function fails union conditional_data_union **temp_du=malloc(list->num_elements*sizeof(union conditional_data_union)); ^ Test_box.c:7859:50: note: Assignment 'temp_du=malloc(list->num_elements*sizeof(union conditional_data_union))', assigned value is 0 union conditional_data_union **temp_du=malloc(list->num_elements*sizeof(union conditional_data_union)); ^ Test_box.c:7874:38: note: Null pointer dereference list->p_data_unions[iterate] = temp_du[iterate]; ^ Test_box.c:7967:9: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] temp[iterate] = list->positions[iterate]; ^ Test_box.c:7962:20: note: Assuming allocation function fails temp = malloc(list->num_elements*sizeof(Coords*)); ^ Test_box.c:7962:20: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct Coords*))', assigned value is 0 temp = malloc(list->num_elements*sizeof(Coords*)); ^ Test_box.c:7967:9: note: Null pointer dereference temp[iterate] = list->positions[iterate]; ^ Test_box.c:7974:36: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] list->positions[iterate] = temp[iterate]; ^ Test_box.c:7962:20: note: Assuming allocation function fails temp = malloc(list->num_elements*sizeof(Coords*)); ^ Test_box.c:7962:20: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct Coords*))', assigned value is 0 temp = malloc(list->num_elements*sizeof(Coords*)); ^ Test_box.c:7974:36: note: Null pointer dereference list->positions[iterate] = temp[iterate]; ^ Test_box.c:7990:9: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] temp[iterate] = list->rotations[iterate]; ^ Test_box.c:7987:20: note: Assuming allocation function fails temp = malloc(list->num_elements*sizeof(Rotation*)); ^ Test_box.c:7987:20: note: Assignment 'temp=malloc(list->num_elements*sizeof(double(*)[3][3]))', assigned value is 0 temp = malloc(list->num_elements*sizeof(Rotation*)); ^ Test_box.c:7990:9: note: Null pointer dereference temp[iterate] = list->rotations[iterate]; ^ Test_box.c:7996:36: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] list->rotations[iterate] = temp[iterate]; ^ Test_box.c:7987:20: note: Assuming allocation function fails temp = malloc(list->num_elements*sizeof(Rotation*)); ^ Test_box.c:7987:20: note: Assignment 'temp=malloc(list->num_elements*sizeof(double(*)[3][3]))', assigned value is 0 temp = malloc(list->num_elements*sizeof(Rotation*)); ^ Test_box.c:7996:36: note: Null pointer dereference list->rotations[iterate] = temp[iterate]; ^ Test_box.c:8011:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8009:56: note: Assuming allocation function fails struct global_process_element_struct *temp=malloc(list->num_elements*sizeof(struct global_process_element_struct)); ^ Test_box.c:8009:56: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_process_element_struct))', assigned value is 0 struct global_process_element_struct *temp=malloc(list->num_elements*sizeof(struct global_process_element_struct)); ^ Test_box.c:8011:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8015:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8009:56: note: Assuming allocation function fails struct global_process_element_struct *temp=malloc(list->num_elements*sizeof(struct global_process_element_struct)); ^ Test_box.c:8009:56: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_process_element_struct))', assigned value is 0 struct global_process_element_struct *temp=malloc(list->num_elements*sizeof(struct global_process_element_struct)); ^ Test_box.c:8015:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8030:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8028:55: note: Assuming allocation function fails struct global_material_element_struct *temp=malloc(list->num_elements*sizeof(struct global_material_element_struct)); ^ Test_box.c:8028:55: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_material_element_struct))', assigned value is 0 struct global_material_element_struct *temp=malloc(list->num_elements*sizeof(struct global_material_element_struct)); ^ Test_box.c:8030:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8034:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8028:55: note: Assuming allocation function fails struct global_material_element_struct *temp=malloc(list->num_elements*sizeof(struct global_material_element_struct)); ^ Test_box.c:8028:55: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_material_element_struct))', assigned value is 0 struct global_material_element_struct *temp=malloc(list->num_elements*sizeof(struct global_material_element_struct)); ^ Test_box.c:8034:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8049:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8047:55: note: Assuming allocation function fails struct global_geometry_element_struct *temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct)); ^ Test_box.c:8047:55: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct))', assigned value is 0 struct global_geometry_element_struct *temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct)); ^ Test_box.c:8049:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8053:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8047:55: note: Assuming allocation function fails struct global_geometry_element_struct *temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct)); ^ Test_box.c:8047:55: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct))', assigned value is 0 struct global_geometry_element_struct *temp=malloc(list->num_elements*sizeof(struct global_geometry_element_struct)); ^ Test_box.c:8053:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8068:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8066:53: note: Assuming allocation function fails struct global_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct)); ^ Test_box.c:8066:53: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct))', assigned value is 0 struct global_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct)); ^ Test_box.c:8068:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8072:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8066:53: note: Assuming allocation function fails struct global_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct)); ^ Test_box.c:8066:53: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct))', assigned value is 0 struct global_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_logger_element_struct)); ^ Test_box.c:8072:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8087:60: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8085:59: note: Assuming allocation function fails struct global_abs_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct)); ^ Test_box.c:8085:59: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct))', assigned value is 0 struct global_abs_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct)); ^ Test_box.c:8087:60: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8091:88: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8085:59: note: Assuming allocation function fails struct global_abs_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct)); ^ Test_box.c:8085:59: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct))', assigned value is 0 struct global_abs_logger_element_struct *temp=malloc(list->num_elements*sizeof(struct global_abs_logger_element_struct)); ^ Test_box.c:8091:88: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8106:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8104:66: note: Assuming allocation function fails struct global_tagging_conditional_element_struct *temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct)); ^ Test_box.c:8104:66: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct))', assigned value is 0 struct global_tagging_conditional_element_struct *temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct)); ^ Test_box.c:8106:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8110:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8104:66: note: Assuming allocation function fails struct global_tagging_conditional_element_struct *temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct)); ^ Test_box.c:8104:66: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct))', assigned value is 0 struct global_tagging_conditional_element_struct *temp=malloc(list->num_elements*sizeof(struct global_tagging_conditional_element_struct)); ^ Test_box.c:8110:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8125:58: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8123:53: note: Assuming allocation function fails struct global_master_element_struct *temp=malloc(list->num_elements*sizeof(struct global_master_element_struct)); ^ Test_box.c:8123:53: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_master_element_struct))', assigned value is 0 struct global_master_element_struct *temp=malloc(list->num_elements*sizeof(struct global_master_element_struct)); ^ Test_box.c:8125:58: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = list->elements[iterate]; ^ Test_box.c:8129:86: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8123:53: note: Assuming allocation function fails struct global_master_element_struct *temp=malloc(list->num_elements*sizeof(struct global_master_element_struct)); ^ Test_box.c:8123:53: note: Assignment 'temp=malloc(list->num_elements*sizeof(struct global_master_element_struct))', assigned value is 0 struct global_master_element_struct *temp=malloc(list->num_elements*sizeof(struct global_master_element_struct)); ^ Test_box.c:8129:86: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) list->elements[iterate] = temp[iterate]; ^ Test_box.c:8148:61: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = loggers->p_logger_volume[iterate]; ^ Test_box.c:8146:53: note: Assuming allocation function fails struct logger_for_each_process_list *temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list)); ^ Test_box.c:8146:53: note: Assignment 'temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list))', assigned value is 0 struct logger_for_each_process_list *temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list)); ^ Test_box.c:8148:61: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = loggers->p_logger_volume[iterate]; ^ Test_box.c:8152:99: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) loggers->p_logger_volume[iterate] = temp[iterate]; ^ Test_box.c:8146:53: note: Assuming allocation function fails struct logger_for_each_process_list *temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list)); ^ Test_box.c:8146:53: note: Assignment 'temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list))', assigned value is 0 struct logger_for_each_process_list *temp=malloc(loggers->num_elements*sizeof(struct logger_for_each_process_list)); ^ Test_box.c:8152:99: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) loggers->p_logger_volume[iterate] = temp[iterate]; ^ Test_box.c:8199:65: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = abs_loggers->p_abs_logger[iterate]; ^ Test_box.c:8197:43: note: Assuming allocation function fails struct abs_logger_struct **temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct *)); ^ Test_box.c:8197:43: note: Assignment 'temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct*))', assigned value is 0 struct abs_logger_struct **temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct *)); ^ Test_box.c:8199:65: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) temp[iterate] = abs_loggers->p_abs_logger[iterate]; ^ Test_box.c:8204:104: warning: If memory allocation fails, then there is a possible null pointer dereference: temp [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements-1;iterate++) abs_loggers->p_abs_logger[iterate] = temp[iterate]; ^ Test_box.c:8197:43: note: Assuming allocation function fails struct abs_logger_struct **temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct *)); ^ Test_box.c:8197:43: note: Assignment 'temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct*))', assigned value is 0 struct abs_logger_struct **temp=malloc(abs_loggers->num_elements*sizeof(struct abs_logger_struct *)); ^ Test_box.c:8204:104: note: Null pointer dereference for (iterate=0;iteratenum_elements-1;iterate++) abs_loggers->p_abs_logger[iterate] = temp[iterate]; ^ Test_box.c:8498:13: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] fprintf(fp,"%d\t N I=%E \t", history->number_of_rays, history->intensity); ^ Test_box.c:8662:3: note: Assuming allocation function fails MPI_MASTER( ^ Test_box.c:8662:3: note: Assignment 'fp=fopen("union_history.dat","w")', assigned value is 0 MPI_MASTER( ^ Test_box.c:8662:3: note: Calling function 'fprintf_total_history', 2nd argument 'fp' value is 0 MPI_MASTER( ^ Test_box.c:8498:13: note: Null pointer dereference fprintf(fp,"%d\t N I=%E \t", history->number_of_rays, history->intensity); ^ Test_box.c:8662:3: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] MPI_MASTER( ^ Test_box.c:8662:3: note: Assuming allocation function fails MPI_MASTER( ^ Test_box.c:8662:3: note: Assignment 'fp=fopen("union_history.dat","w")', assigned value is 0 MPI_MASTER( ^ Test_box.c:8662:3: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:8784:73: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_lines [nullPointerOutOfMemory] for (iterate = 0;iterate < lines_master->number_of_lines;iterate++) temp_lines[iterate] = lines_master->lines[iterate]; ^ Test_box.c:8783:24: note: Assuming allocation function fails temp_lines = malloc(lines_master->number_of_lines*sizeof(struct line_segment)); ^ Test_box.c:8783:24: note: Assignment 'temp_lines=malloc(lines_master->number_of_lines*sizeof(struct line_segment))', assigned value is 0 temp_lines = malloc(lines_master->number_of_lines*sizeof(struct line_segment)); ^ Test_box.c:8784:73: note: Null pointer dereference for (iterate = 0;iterate < lines_master->number_of_lines;iterate++) temp_lines[iterate] = lines_master->lines[iterate]; ^ Test_box.c:8787:104: warning: If memory allocation fails, then there is a possible null pointer dereference: temp_lines [nullPointerOutOfMemory] for (iterate = 0;iterate < lines_master->number_of_lines;iterate++) lines_master->lines[iterate] = temp_lines[iterate]; ^ Test_box.c:8783:24: note: Assuming allocation function fails temp_lines = malloc(lines_master->number_of_lines*sizeof(struct line_segment)); ^ Test_box.c:8783:24: note: Assignment 'temp_lines=malloc(lines_master->number_of_lines*sizeof(struct line_segment))', assigned value is 0 temp_lines = malloc(lines_master->number_of_lines*sizeof(struct line_segment)); ^ Test_box.c:8787:104: note: Null pointer dereference for (iterate = 0;iterate < lines_master->number_of_lines;iterate++) lines_master->lines[iterate] = temp_lines[iterate]; ^ Test_box.c:8951:5: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] points[0] = coords_set(r1[0],r1[1],r1[2]); ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8951:5: note: Null pointer dereference points[0] = coords_set(r1[0],r1[1],r1[2]); ^ Test_box.c:8952:5: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] points[intersection_list.num_elements+1] = coords_set(r2[0],r2[1],r2[2]); ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8952:5: note: Null pointer dereference points[intersection_list.num_elements+1] = coords_set(r2[0],r2[1],r2[2]); ^ Test_box.c:8954:9: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] points[iterate].x = r1[0] + direction[0]*intersection_list.elements[iterate-1]; ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8954:9: note: Null pointer dereference points[iterate].x = r1[0] + direction[0]*intersection_list.elements[iterate-1]; ^ Test_box.c:8955:9: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] points[iterate].y = r1[1] + direction[1]*intersection_list.elements[iterate-1]; ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8955:9: note: Null pointer dereference points[iterate].y = r1[1] + direction[1]*intersection_list.elements[iterate-1]; ^ Test_box.c:8956:9: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] points[iterate].z = r1[2] + direction[2]*intersection_list.elements[iterate-1]; ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8956:9: note: Null pointer dereference points[iterate].z = r1[2] + direction[2]*intersection_list.elements[iterate-1]; ^ Test_box.c:8976:9: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] lines[iterate].point1 = points[iterate]; ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8976:9: note: Null pointer dereference lines[iterate].point1 = points[iterate]; ^ Test_box.c:8976:33: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] lines[iterate].point1 = points[iterate]; ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8976:33: note: Null pointer dereference lines[iterate].point1 = points[iterate]; ^ Test_box.c:8977:9: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] lines[iterate].point2 = points[iterate+1]; ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8977:9: note: Null pointer dereference lines[iterate].point2 = points[iterate+1]; ^ Test_box.c:8977:33: warning: If memory allocation fails, then there is a possible null pointer dereference: points [nullPointerOutOfMemory] lines[iterate].point2 = points[iterate+1]; ^ Test_box.c:8950:26: note: Assuming allocation function fails Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8950:26: note: Assignment 'points=malloc((intersection_list.num_elements+2)*sizeof(struct Coords))', assigned value is 0 Coords *points=malloc((intersection_list.num_elements+2)*sizeof(Coords)); ^ Test_box.c:8977:33: note: Null pointer dereference lines[iterate].point2 = points[iterate+1]; ^ Test_box.c:8978:27: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.x = 0.5*(lines[iterate].point1.x + lines[iterate].point2.x); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8978:27: note: Null pointer dereference midpoint.x = 0.5*(lines[iterate].point1.x + lines[iterate].point2.x); ^ Test_box.c:8978:53: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.x = 0.5*(lines[iterate].point1.x + lines[iterate].point2.x); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8978:53: note: Null pointer dereference midpoint.x = 0.5*(lines[iterate].point1.x + lines[iterate].point2.x); ^ Test_box.c:8979:27: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.y = 0.5*(lines[iterate].point1.y + lines[iterate].point2.y); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8979:27: note: Null pointer dereference midpoint.y = 0.5*(lines[iterate].point1.y + lines[iterate].point2.y); ^ Test_box.c:8979:53: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.y = 0.5*(lines[iterate].point1.y + lines[iterate].point2.y); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8979:53: note: Null pointer dereference midpoint.y = 0.5*(lines[iterate].point1.y + lines[iterate].point2.y); ^ Test_box.c:8980:27: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.z = 0.5*(lines[iterate].point1.z + lines[iterate].point2.z); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8980:27: note: Null pointer dereference midpoint.z = 0.5*(lines[iterate].point1.z + lines[iterate].point2.z); ^ Test_box.c:8980:53: warning: If memory allocation fails, then there is a possible null pointer dereference: lines [nullPointerOutOfMemory] midpoint.z = 0.5*(lines[iterate].point1.z + lines[iterate].point2.z); ^ Test_box.c:8965:38: note: Assuming allocation function fails struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8965:38: note: Assignment 'lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment))', assigned value is 0 struct line_segment *lines=malloc((intersection_list.num_elements+1)*sizeof(struct line_segment)); ^ Test_box.c:8980:53: note: Null pointer dereference midpoint.z = 0.5*(lines[iterate].point1.z + lines[iterate].point2.z); ^ Test_box.c:9192:16: warning: If memory allocation fails, then there is a possible null pointer dereference: union_output.p_box_storage [nullPointerOutOfMemory] *union_output.p_box_storage = *union_input->p_box_storage; ^ Test_box.c:9190:38: note: Assuming allocation function fails union_output.p_box_storage = malloc(sizeof(struct box_storage)); ^ Test_box.c:9190:38: note: Assignment 'union_output.p_box_storage=malloc(sizeof(struct box_storage))', assigned value is 0 union_output.p_box_storage = malloc(sizeof(struct box_storage)); ^ Test_box.c:9192:16: note: Null pointer dereference *union_output.p_box_storage = *union_input->p_box_storage; ^ Test_box.c:9203:16: warning: If memory allocation fails, then there is a possible null pointer dereference: union_output.p_cylinder_storage [nullPointerOutOfMemory] *union_output.p_cylinder_storage = *union_input->p_cylinder_storage; ^ Test_box.c:9201:43: note: Assuming allocation function fails union_output.p_cylinder_storage = malloc(sizeof(struct cylinder_storage)); ^ Test_box.c:9201:43: note: Assignment 'union_output.p_cylinder_storage=malloc(sizeof(struct cylinder_storage))', assigned value is 0 union_output.p_cylinder_storage = malloc(sizeof(struct cylinder_storage)); ^ Test_box.c:9203:16: note: Null pointer dereference *union_output.p_cylinder_storage = *union_input->p_cylinder_storage; ^ Test_box.c:9213:16: warning: If memory allocation fails, then there is a possible null pointer dereference: union_output.p_sphere_storage [nullPointerOutOfMemory] *union_output.p_sphere_storage = *union_input->p_sphere_storage; ^ Test_box.c:9211:41: note: Assuming allocation function fails union_output.p_sphere_storage = malloc(sizeof(struct sphere_storage)); ^ Test_box.c:9211:41: note: Assignment 'union_output.p_sphere_storage=malloc(sizeof(struct sphere_storage))', assigned value is 0 union_output.p_sphere_storage = malloc(sizeof(struct sphere_storage)); ^ Test_box.c:9213:16: note: Null pointer dereference *union_output.p_sphere_storage = *union_input->p_sphere_storage; ^ Test_box.c:9223:16: warning: If memory allocation fails, then there is a possible null pointer dereference: union_output.p_cone_storage [nullPointerOutOfMemory] *union_output.p_cone_storage = *union_input->p_cone_storage; ^ Test_box.c:9221:39: note: Assuming allocation function fails union_output.p_cone_storage = malloc(sizeof(struct cone_storage)); ^ Test_box.c:9221:39: note: Assignment 'union_output.p_cone_storage=malloc(sizeof(struct cone_storage))', assigned value is 0 union_output.p_cone_storage = malloc(sizeof(struct cone_storage)); ^ Test_box.c:9223:16: note: Null pointer dereference *union_output.p_cone_storage = *union_input->p_cone_storage; ^ Test_box.c:9233:16: warning: If memory allocation fails, then there is a possible null pointer dereference: union_output.p_mesh_storage [nullPointerOutOfMemory] *union_output.p_mesh_storage = *union_input->p_mesh_storage; ^ Test_box.c:9231:39: note: Assuming allocation function fails union_output.p_mesh_storage = malloc(sizeof(struct mesh_storage)); ^ Test_box.c:9231:39: note: Assignment 'union_output.p_mesh_storage=malloc(sizeof(struct mesh_storage))', assigned value is 0 union_output.p_mesh_storage = malloc(sizeof(struct mesh_storage)); ^ Test_box.c:9233:16: note: Null pointer dereference *union_output.p_mesh_storage = *union_input->p_mesh_storage; ^ Test_box.c:9291:9: warning: If memory allocation fails, then there is a possible null pointer dereference: output [nullPointerOutOfMemory] rotate(output[point_nr].x,output[point_nr].y,output[point_nr].z,cross_product.x,cross_product.y,cross_product.z,rotate_angle,direction.x,direction.y,direction.z); ^ Test_box.c:12602:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12602:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12604:22: note: Calling function 'points_on_circle', 1st argument 'circle_point_array' value is 0 points_on_circle(circle_point_array,cyl_top_point,cyl_direction,radius,number_of_points); ^ Test_box.c:9291:9: note: Null pointer dereference rotate(output[point_nr].x,output[point_nr].y,output[point_nr].z,cross_product.x,cross_product.y,cross_product.z,rotate_angle,direction.x,direction.y,direction.z); ^ Test_box.c:9292:9: warning: If memory allocation fails, then there is a possible null pointer dereference: output [nullPointerOutOfMemory] output[point_nr] = coords_add(output[point_nr],center); ^ Test_box.c:12602:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12602:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12604:22: note: Calling function 'points_on_circle', 1st argument 'circle_point_array' value is 0 points_on_circle(circle_point_array,cyl_top_point,cyl_direction,radius,number_of_points); ^ Test_box.c:9292:9: note: Null pointer dereference output[point_nr] = coords_add(output[point_nr],center); ^ Test_box.c:9292:39: warning: If memory allocation fails, then there is a possible null pointer dereference: output [nullPointerOutOfMemory] output[point_nr] = coords_add(output[point_nr],center); ^ Test_box.c:12602:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12602:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12604:22: note: Calling function 'points_on_circle', 1st argument 'circle_point_array' value is 0 points_on_circle(circle_point_array,cyl_top_point,cyl_direction,radius,number_of_points); ^ Test_box.c:9292:39: note: Null pointer dereference output[point_nr] = coords_add(output[point_nr],center); ^ Test_box.c:11802:43: warning: If memory allocation fails, then there is a possible null pointer dereference: circle_point_array [nullPointerOutOfMemory] if (geometry_box->within_function(circle_point_array[iterate],geometry_box) == 1) { ^ Test_box.c:11796:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:11796:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:11802:43: note: Null pointer dereference if (geometry_box->within_function(circle_point_array[iterate],geometry_box) == 1) { ^ Test_box.c:11810:43: warning: If memory allocation fails, then there is a possible null pointer dereference: circle_point_array [nullPointerOutOfMemory] if (geometry_box->within_function(circle_point_array[iterate],geometry_box) == 1) { ^ Test_box.c:11796:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:11796:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:11802:85: note: Assuming condition is false if (geometry_box->within_function(circle_point_array[iterate],geometry_box) == 1) { ^ Test_box.c:11810:43: note: Null pointer dereference if (geometry_box->within_function(circle_point_array[iterate],geometry_box) == 1) { ^ Test_box.c:12609:46: warning: If memory allocation fails, then there is a possible null pointer dereference: circle_point_array [nullPointerOutOfMemory] if (geometry_parent->within_function(circle_point_array[iterate],geometry_parent) == 0) { ^ Test_box.c:12602:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12602:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12609:46: note: Null pointer dereference if (geometry_parent->within_function(circle_point_array[iterate],geometry_parent) == 0) { ^ Test_box.c:12617:46: warning: If memory allocation fails, then there is a possible null pointer dereference: circle_point_array [nullPointerOutOfMemory] if (geometry_parent->within_function(circle_point_array[iterate],geometry_parent) == 0) { ^ Test_box.c:12602:32: note: Assuming allocation function fails circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12602:32: note: Assignment 'circle_point_array=malloc(number_of_points*sizeof(struct Coords))', assigned value is 0 circle_point_array = malloc(number_of_points * sizeof(Coords)); ^ Test_box.c:12609:91: note: Assuming condition is false if (geometry_parent->within_function(circle_point_array[iterate],geometry_parent) == 0) { ^ Test_box.c:12617:46: note: Null pointer dereference if (geometry_parent->within_function(circle_point_array[iterate],geometry_parent) == 0) { ^ Test_box.c:13433:3: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] temporary_children_lists[0].num_elements = number_of_volumes - 1; ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13433:3: note: Null pointer dereference temporary_children_lists[0].num_elements = number_of_volumes - 1; ^ Test_box.c:13434:3: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] temporary_children_lists[0].elements = malloc(temporary_children_lists[0].num_elements*sizeof(int)); ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13434:3: note: Null pointer dereference temporary_children_lists[0].elements = malloc(temporary_children_lists[0].num_elements*sizeof(int)); ^ Test_box.c:13434:49: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] temporary_children_lists[0].elements = malloc(temporary_children_lists[0].num_elements*sizeof(int)); ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13434:49: note: Null pointer dereference temporary_children_lists[0].elements = malloc(temporary_children_lists[0].num_elements*sizeof(int)); ^ Test_box.c:13438:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] temporary_children_lists[0].elements[parent-1] = parent; ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13438:7: note: Null pointer dereference temporary_children_lists[0].elements[parent-1] = parent; ^ Test_box.c:13447:3: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[0] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13447:3: note: Null pointer dereference true_children_lists[0] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13448:3: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[0]->num_elements = number_of_volumes - 1; ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13448:3: note: Null pointer dereference true_children_lists[0]->num_elements = number_of_volumes - 1; ^ Test_box.c:13449:3: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[0]->elements = malloc((number_of_volumes-1)*sizeof(int)); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13449:3: note: Null pointer dereference true_children_lists[0]->elements = malloc((number_of_volumes-1)*sizeof(int)); ^ Test_box.c:13455:7: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[0]->elements[parent-1] = parent; ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13455:7: note: Null pointer dereference true_children_lists[0]->elements[parent-1] = parent; ^ Test_box.c:13490:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] temporary_children_lists[parent].num_elements=0; ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13490:7: note: Null pointer dereference temporary_children_lists[parent].num_elements=0; ^ Test_box.c:13494:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:13430:36: note: Assuming allocation function fails temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13430:36: note: Assignment 'temporary_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13494:7: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:13618:5: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13618:5: note: Null pointer dereference true_children_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13619:5: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] true_children_lists[parent]->num_elements = 0; ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13619:5: note: Null pointer dereference true_children_lists[parent]->num_elements = 0; ^ Test_box.c:13620:64: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] allocate_list_from_temp(used_elements,true_temp_list_local,true_children_lists[parent]); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13620:64: note: Null pointer dereference allocate_list_from_temp(used_elements,true_temp_list_local,true_children_lists[parent]); ^ Test_box.c:13622:5: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15068:38: note: Calling function 'generate_children_lists', 2nd argument 'true_children_lists' value is 0 generate_children_lists(Volumes, true_children_lists, number_of_volumes,verbal); ^ Test_box.c:13622:5: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:13631:53: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_children_lists [nullPointerOutOfMemory] for(child=0;childnum_elements = number_of_volumes-1; ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13654:3: note: Null pointer dereference true_overlap_lists[0]->num_elements = number_of_volumes-1; ^ Test_box.c:13655:3: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] true_overlap_lists[0]->elements = malloc((number_of_volumes-1)*sizeof(int)); ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13655:3: note: Null pointer dereference true_overlap_lists[0]->elements = malloc((number_of_volumes-1)*sizeof(int)); ^ Test_box.c:13657:3: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[0] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13657:3: note: Null pointer dereference raw_overlap_lists[0] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13658:3: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[0]->num_elements = number_of_volumes; ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13658:3: note: Null pointer dereference raw_overlap_lists[0]->num_elements = number_of_volumes; ^ Test_box.c:13659:3: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[0]->elements = malloc(number_of_volumes*sizeof(int)); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13659:3: note: Null pointer dereference raw_overlap_lists[0]->elements = malloc(number_of_volumes*sizeof(int)); ^ Test_box.c:13660:3: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[0]->elements[0] = 0; // Volume 0 overlaps itself ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13660:3: note: Null pointer dereference raw_overlap_lists[0]->elements[0] = 0; // Volume 0 overlaps itself ^ Test_box.c:13664:7: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] true_overlap_lists[0]->elements[parent-1] = parent; ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13664:7: note: Null pointer dereference true_overlap_lists[0]->elements[parent-1] = parent; ^ Test_box.c:13665:7: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[0]->elements[parent] = parent; ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13665:7: note: Null pointer dereference raw_overlap_lists[0]->elements[parent] = parent; ^ Test_box.c:13669:3: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13669:3: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:13682:7: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] true_overlap_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13682:7: note: Null pointer dereference true_overlap_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13755:7: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13755:7: note: Null pointer dereference raw_overlap_lists[parent] = malloc(sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13756:7: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] raw_overlap_lists[parent]->num_elements = 0; ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13756:7: note: Null pointer dereference raw_overlap_lists[parent]->num_elements = 0; ^ Test_box.c:13757:61: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] allocate_list_from_temp(used_elements,temp_list_local,raw_overlap_lists[parent]); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:48: note: Calling function 'generate_overlap_lists', 2nd argument 'raw_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13757:61: note: Null pointer dereference allocate_list_from_temp(used_elements,temp_list_local,raw_overlap_lists[parent]); ^ Test_box.c:13760:7: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_overlap_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:13650:35: note: Assuming allocation function fails temporary_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13650:35: note: Assignment 'temporary_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list))', assigned value is 0 temporary_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list)); ^ Test_box.c:13760:7: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:13873:59: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] allocate_list_from_temp(used_elements,temp_list_local,true_overlap_lists[parent]); ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13873:59: note: Null pointer dereference allocate_list_from_temp(used_elements,temp_list_local,true_overlap_lists[parent]); ^ Test_box.c:13875:5: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15076:28: note: Calling function 'generate_overlap_lists', 1st argument 'true_overlap_lists' value is 0 generate_overlap_lists(true_overlap_lists, raw_overlap_lists, Volumes,number_of_volumes,verbal); ^ Test_box.c:13875:5: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:13881:53: warning: If memory allocation fails, then there is a possible null pointer dereference: temporary_overlap_lists [nullPointerOutOfMemory] for(child=1;childnum_elements; parent++) { ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:52: note: Calling function 'generate_grandparents_lists', 2nd argument 'parents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14430:29: note: Null pointer dereference for (parent = 0; parentnum_elements; parent++) { ^ Test_box.c:14432:27: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:52: note: Calling function 'generate_grandparents_lists', 2nd argument 'parents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14432:27: note: Null pointer dereference on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:14432:41: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:52: note: Calling function 'generate_grandparents_lists', 2nd argument 'parents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14432:41: note: Null pointer dereference on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:14432:84: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:52: note: Calling function 'generate_grandparents_lists', 2nd argument 'parents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14432:84: note: Null pointer dereference on_both_int_lists(parents_lists[parents_lists[iterate]->elements[parent]], parents_lists[iterate], &common); ^ Test_box.c:14441:61: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists [nullPointerOutOfMemory] allocate_list_from_temp(used_elements, temp_list_local, grandparents_lists[iterate]); ^ Test_box.c:15105:32: note: Assuming allocation function fails grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15105:32: note: Assignment 'grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:33: note: Calling function 'generate_grandparents_lists', 1st argument 'grandparents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14441:61: note: Null pointer dereference allocate_list_from_temp(used_elements, temp_list_local, grandparents_lists[iterate]); ^ Test_box.c:14444:5: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists [nullPointerOutOfMemory] MPI_MASTER( ^ Test_box.c:15105:32: note: Assuming allocation function fails grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15105:32: note: Assignment 'grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15106:33: note: Calling function 'generate_grandparents_lists', 1st argument 'grandparents_lists' value is 0 generate_grandparents_lists(grandparents_lists,parents_lists,number_of_volumes,verbal); ^ Test_box.c:14444:5: note: Null pointer dereference MPI_MASTER( ^ Test_box.c:14471:30: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] work_list.num_elements = true_overlap_lists[volume_index]->num_elements; ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:46: note: Calling function 'generate_destinations_lists_experimental', 1st argument 'true_overlap_lists' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14471:30: note: Null pointer dereference work_list.num_elements = true_overlap_lists[volume_index]->num_elements; ^ Test_box.c:14473:92: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] for (iterate=0;iterateelements[iterate]; ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:46: note: Calling function 'generate_destinations_lists_experimental', 1st argument 'true_overlap_lists' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14473:92: note: Null pointer dereference for (iterate=0;iterateelements[iterate]; ^ Test_box.c:14518:28: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:66: note: Calling function 'generate_destinations_lists_experimental', 2nd argument 'true_children_lists' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14518:28: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) ^ Test_box.c:14519:50: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] remove_element_in_list_by_value(&work_list,true_children_lists[volume_index]->elements[iterate]); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:66: note: Calling function 'generate_destinations_lists_experimental', 2nd argument 'true_children_lists' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14519:50: note: Null pointer dereference remove_element_in_list_by_value(&work_list,true_children_lists[volume_index]->elements[iterate]); ^ Test_box.c:14524:28: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists [nullPointerOutOfMemory] for (iterate=0;iteratenum_elements;iterate++) ^ Test_box.c:15119:46: note: Assuming allocation function fails true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15119:46: note: Assignment 'true_grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:116: note: Calling function 'generate_destinations_lists_experimental', 4th argument 'true_grandparents_lists_no_masks' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14524:28: note: Null pointer dereference for (iterate=0;iteratenum_elements;iterate++) ^ Test_box.c:14525:50: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists [nullPointerOutOfMemory] remove_element_in_list_by_value(&work_list,true_grandparents_lists[volume_index]->elements[iterate]); ^ Test_box.c:15119:46: note: Assuming allocation function fails true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15119:46: note: Assignment 'true_grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:116: note: Calling function 'generate_destinations_lists_experimental', 4th argument 'true_grandparents_lists_no_masks' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14525:50: note: Null pointer dereference remove_element_in_list_by_value(&work_list,true_grandparents_lists[volume_index]->elements[iterate]); ^ Test_box.c:14539:24: warning: If memory allocation fails, then there is a possible null pointer dereference: true_parents_lists [nullPointerOutOfMemory] if (on_int_list(*true_parents_lists[volume_index],work_list.elements[iterate])){ ^ Test_box.c:15098:41: note: Assuming allocation function fails true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15098:41: note: Assignment 'true_parents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15124:87: note: Calling function 'generate_destinations_lists_experimental', 3rd argument 'true_parents_lists_no_masks' value is 0 generate_destinations_lists_experimental(true_overlap_lists, true_children_lists, true_parents_lists_no_masks, true_grandparents_lists_no_masks, Volumes, number_of_volumes, verbal); ^ Test_box.c:14539:24: note: Null pointer dereference if (on_int_list(*true_parents_lists[volume_index],work_list.elements[iterate])){ ^ Test_box.c:14839:34: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] for (parent=0;parentgeometry.children.elements[child]]->num_elements;parent++) { ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15131:36: note: Calling function 'generate_direct_children_lists', 1st argument 'parents_lists' value is 0 generate_direct_children_lists(parents_lists,Volumes,number_of_volumes,verbal); ^ Test_box.c:14839:34: note: Null pointer dereference for (parent=0;parentgeometry.children.elements[child]]->num_elements;parent++) { ^ Test_box.c:14840:74: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] if (on_int_list(Volumes[volume_index]->geometry.children,parents_lists[Volumes[volume_index]->geometry.children.elements[child]]->elements[parent])) ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15131:36: note: Calling function 'generate_direct_children_lists', 1st argument 'parents_lists' value is 0 generate_direct_children_lists(parents_lists,Volumes,number_of_volumes,verbal); ^ Test_box.c:14840:74: note: Null pointer dereference if (on_int_list(Volumes[volume_index]->geometry.children,parents_lists[Volumes[volume_index]->geometry.children.elements[child]]->elements[parent])) ^ Test_box.c:15146:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] if (true_overlap_lists[iterate]->num_elements > 0) free(true_overlap_lists[iterate]->elements); ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15146:13: note: Null pointer dereference if (true_overlap_lists[iterate]->num_elements > 0) free(true_overlap_lists[iterate]->elements); ^ Test_box.c:15147:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_overlap_lists [nullPointerOutOfMemory] free(true_overlap_lists[iterate]); ^ Test_box.c:15072:32: note: Assuming allocation function fails true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15072:32: note: Assignment 'true_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15147:14: note: Null pointer dereference free(true_overlap_lists[iterate]); ^ Test_box.c:15150:13: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] if (raw_overlap_lists[iterate]->num_elements > 0) free(raw_overlap_lists[iterate]->elements); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15150:13: note: Null pointer dereference if (raw_overlap_lists[iterate]->num_elements > 0) free(raw_overlap_lists[iterate]->elements); ^ Test_box.c:15151:14: warning: If memory allocation fails, then there is a possible null pointer dereference: raw_overlap_lists [nullPointerOutOfMemory] free(raw_overlap_lists[iterate]); ^ Test_box.c:15074:31: note: Assuming allocation function fails raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15074:31: note: Assignment 'raw_overlap_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 raw_overlap_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15151:14: note: Null pointer dereference free(raw_overlap_lists[iterate]); ^ Test_box.c:15154:13: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] if (parents_lists[iterate]->num_elements > 0) free(parents_lists[iterate]->elements); ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15154:13: note: Null pointer dereference if (parents_lists[iterate]->num_elements > 0) free(parents_lists[iterate]->elements); ^ Test_box.c:15155:14: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists [nullPointerOutOfMemory] free(parents_lists[iterate]); ^ Test_box.c:15083:27: note: Assuming allocation function fails parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15083:27: note: Assignment 'parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15155:14: note: Null pointer dereference free(parents_lists[iterate]); ^ Test_box.c:15158:13: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists_no_masks [nullPointerOutOfMemory] if (parents_lists_no_masks[iterate]->num_elements > 0) free(parents_lists_no_masks[iterate]->elements); ^ Test_box.c:15088:36: note: Assuming allocation function fails parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15088:36: note: Assignment 'parents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15158:13: note: Null pointer dereference if (parents_lists_no_masks[iterate]->num_elements > 0) free(parents_lists_no_masks[iterate]->elements); ^ Test_box.c:15159:14: warning: If memory allocation fails, then there is a possible null pointer dereference: parents_lists_no_masks [nullPointerOutOfMemory] free(parents_lists_no_masks[iterate]); ^ Test_box.c:15088:36: note: Assuming allocation function fails parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15088:36: note: Assignment 'parents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15159:14: note: Null pointer dereference free(parents_lists_no_masks[iterate]); ^ Test_box.c:15162:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_parents_lists [nullPointerOutOfMemory] if (true_parents_lists[iterate]->num_elements > 0) free(true_parents_lists[iterate]->elements); ^ Test_box.c:15093:32: note: Assuming allocation function fails true_parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15093:32: note: Assignment 'true_parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15162:13: note: Null pointer dereference if (true_parents_lists[iterate]->num_elements > 0) free(true_parents_lists[iterate]->elements); ^ Test_box.c:15163:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_parents_lists [nullPointerOutOfMemory] free(true_parents_lists[iterate]); ^ Test_box.c:15093:32: note: Assuming allocation function fails true_parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15093:32: note: Assignment 'true_parents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_parents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15163:14: note: Null pointer dereference free(true_parents_lists[iterate]); ^ Test_box.c:15166:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_parents_lists_no_masks [nullPointerOutOfMemory] if (true_parents_lists_no_masks[iterate]->num_elements > 0) free(true_parents_lists_no_masks[iterate]->elements); ^ Test_box.c:15098:41: note: Assuming allocation function fails true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15098:41: note: Assignment 'true_parents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15166:13: note: Null pointer dereference if (true_parents_lists_no_masks[iterate]->num_elements > 0) free(true_parents_lists_no_masks[iterate]->elements); ^ Test_box.c:15167:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_parents_lists_no_masks [nullPointerOutOfMemory] free(true_parents_lists_no_masks[iterate]); ^ Test_box.c:15098:41: note: Assuming allocation function fails true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15098:41: note: Assignment 'true_parents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_parents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15167:14: note: Null pointer dereference free(true_parents_lists_no_masks[iterate]); ^ Test_box.c:15170:13: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists [nullPointerOutOfMemory] if (grandparents_lists[iterate]->num_elements > 0) free(grandparents_lists[iterate]->elements); ^ Test_box.c:15105:32: note: Assuming allocation function fails grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15105:32: note: Assignment 'grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15170:13: note: Null pointer dereference if (grandparents_lists[iterate]->num_elements > 0) free(grandparents_lists[iterate]->elements); ^ Test_box.c:15171:14: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists [nullPointerOutOfMemory] free(grandparents_lists[iterate]); ^ Test_box.c:15105:32: note: Assuming allocation function fails grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15105:32: note: Assignment 'grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15171:14: note: Null pointer dereference free(grandparents_lists[iterate]); ^ Test_box.c:15174:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists [nullPointerOutOfMemory] if (true_grandparents_lists[iterate]->num_elements > 0) free(true_grandparents_lists[iterate]->elements); ^ Test_box.c:15115:37: note: Assuming allocation function fails true_grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15115:37: note: Assignment 'true_grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15174:13: note: Null pointer dereference if (true_grandparents_lists[iterate]->num_elements > 0) free(true_grandparents_lists[iterate]->elements); ^ Test_box.c:15175:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists [nullPointerOutOfMemory] free(true_grandparents_lists[iterate]); ^ Test_box.c:15115:37: note: Assuming allocation function fails true_grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15115:37: note: Assignment 'true_grandparents_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15175:14: note: Null pointer dereference free(true_grandparents_lists[iterate]); ^ Test_box.c:15178:13: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists_no_masks [nullPointerOutOfMemory] if (grandparents_lists_no_masks[iterate]->num_elements > 0) free(grandparents_lists_no_masks[iterate]->elements); ^ Test_box.c:15110:41: note: Assuming allocation function fails grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15110:41: note: Assignment 'grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15178:13: note: Null pointer dereference if (grandparents_lists_no_masks[iterate]->num_elements > 0) free(grandparents_lists_no_masks[iterate]->elements); ^ Test_box.c:15179:14: warning: If memory allocation fails, then there is a possible null pointer dereference: grandparents_lists_no_masks [nullPointerOutOfMemory] free(grandparents_lists_no_masks[iterate]); ^ Test_box.c:15110:41: note: Assuming allocation function fails grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15110:41: note: Assignment 'grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15179:14: note: Null pointer dereference free(grandparents_lists_no_masks[iterate]); ^ Test_box.c:15182:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists_no_masks [nullPointerOutOfMemory] if (true_grandparents_lists_no_masks[iterate]->num_elements > 0) free(true_grandparents_lists_no_masks[iterate]->elements); ^ Test_box.c:15119:46: note: Assuming allocation function fails true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15119:46: note: Assignment 'true_grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15182:13: note: Null pointer dereference if (true_grandparents_lists_no_masks[iterate]->num_elements > 0) free(true_grandparents_lists_no_masks[iterate]->elements); ^ Test_box.c:15183:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_grandparents_lists_no_masks [nullPointerOutOfMemory] free(true_grandparents_lists_no_masks[iterate]); ^ Test_box.c:15119:46: note: Assuming allocation function fails true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15119:46: note: Assignment 'true_grandparents_lists_no_masks=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_grandparents_lists_no_masks = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15183:14: note: Null pointer dereference free(true_grandparents_lists_no_masks[iterate]); ^ Test_box.c:15186:13: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] if (true_children_lists[iterate]->num_elements > 0) free(true_children_lists[iterate]->elements); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15186:13: note: Null pointer dereference if (true_children_lists[iterate]->num_elements > 0) free(true_children_lists[iterate]->elements); ^ Test_box.c:15187:14: warning: If memory allocation fails, then there is a possible null pointer dereference: true_children_lists [nullPointerOutOfMemory] free(true_children_lists[iterate]); ^ Test_box.c:15066:33: note: Assuming allocation function fails true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15066:33: note: Assignment 'true_children_lists=malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*))', assigned value is 0 true_children_lists = malloc(number_of_volumes*sizeof(struct pointer_to_1d_int_list*)); ^ Test_box.c:15187:14: note: Null pointer dereference free(true_children_lists[iterate]); ^ Test_box.c:15375:11: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] fprintf(fp,"r_old x, r_old y, r_old z, old t, r x, r y, r z, new t, weight change, volume index, neutron id \n"); ^ Test_box.c:15374:13: note: Assuming allocation function fails fp = fopen("Union_absorption.dat","w"); ^ Test_box.c:15374:13: note: Assignment 'fp=fopen("Union_absorption.dat","w")', assigned value is 0 fp = fopen("Union_absorption.dat","w"); ^ Test_box.c:15375:11: note: Null pointer dereference fprintf(fp,"r_old x, r_old y, r_old z, old t, r x, r y, r z, new t, weight change, volume index, neutron id \n"); ^ Test_box.c:15377:10: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] fclose(fp); ^ Test_box.c:15374:13: note: Assuming allocation function fails fp = fopen("Union_absorption.dat","w"); ^ Test_box.c:15374:13: note: Assignment 'fp=fopen("Union_absorption.dat","w")', assigned value is 0 fp = fopen("Union_absorption.dat","w"); ^ Test_box.c:15377:10: note: Null pointer dereference fclose(fp); ^ Test_box.c:15390:13: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] fprintf(fp,"%g, %g, %g, %g, %g, %g, %g, %g, %e, %i, %i \n", ^ Test_box.c:15383:13: note: Assuming allocation function fails fp = fopen("Union_absorption.dat","a"); ^ Test_box.c:15383:13: note: Assignment 'fp=fopen("Union_absorption.dat","a")', assigned value is 0 fp = fopen("Union_absorption.dat","a"); ^ Test_box.c:15390:13: note: Null pointer dereference fprintf(fp,"%g, %g, %g, %g, %g, %g, %g, %g, %e, %i, %i \n", ^ Test_box.c:15398:10: warning: If resource allocation fails, then there is a possible null pointer dereference: fp [nullPointerOutOfResources] fclose(fp); ^ Test_box.c:15383:13: note: Assuming allocation function fails fp = fopen("Union_absorption.dat","a"); ^ Test_box.c:15383:13: note: Assignment 'fp=fopen("Union_absorption.dat","a")', assigned value is 0 fp = fopen("Union_absorption.dat","a"); ^ Test_box.c:15398:10: note: Null pointer dereference fclose(fp); ^ Test_box.c:9006:12: warning: Uninitialized variable: draw_order.lines [uninitvar] return draw_order; ^ Test_box.c:8990:36: note: Assuming condition is false if (draw_order.number_of_lines > 0) { ^ Test_box.c:9006:12: note: Uninitialized variable: draw_order.lines return draw_order; ^ Test_box.c:12465:66: error: Uninitialized variable: square_center [uninitvar] Coords box_end_point = coords_sub(coords_set(0,0,-z_depth/2),square_center); ^ Test_box.c:13338:25: error: Uninitialized variable: temp_pointer [uninitvar] ListA = temp_pointer; ^ Test_box.c:14689:79: warning: Uninitialized variable: logic_list.elements [uninitvar] Volumes[N_volume]->geometry.destinations_list.num_elements = sum_int_list(logic_list); ^ Test_box.c:14672:32: note: Assuming condition is false if (logic_list.num_elements>0) logic_list.elements = malloc(logic_list.num_elements*sizeof(int)); ^ Test_box.c:14689:79: note: Uninitialized variable: logic_list.elements Volumes[N_volume]->geometry.destinations_list.num_elements = sum_int_list(logic_list); ^ Test_box.c:12465:66: error: Uninitialized struct member: square_center.x [uninitStructMember] Coords box_end_point = coords_sub(coords_set(0,0,-z_depth/2),square_center); ^ Test_box.c:12465:66: error: Uninitialized struct member: square_center.y [uninitStructMember] Coords box_end_point = coords_sub(coords_set(0,0,-z_depth/2),square_center); ^ Test_box.c:12465:66: error: Uninitialized struct member: square_center.z [uninitStructMember] Coords box_end_point = coords_sub(coords_set(0,0,-z_depth/2),square_center); ^ Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;MULTICORE... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_AF_HB_1D_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_INCOHERENTPHONON_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_NCRYSTAL_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_PHONONSIMPLE_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_POWDER_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_SINGLE_CRYSTAL_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_TEMPLATE_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;PROCESS_TEXTURE_DETECTOR... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;SIGKILL;SIGUSR1;SIGUSR2... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;USE_MPI... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;USE_MPI;USE_NEXUS... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;USE_NEXUS... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;Union_trace_verbal_setting... Test_box.c:20872:17: error: printf format string requires 2 parameters but only 1 is given. [wrongPrintfScanfArgNum] printf("chance to get through this length of absorber: %f \%\n", 100*exp(-Volumes[current_volume]->p_physics->my_a*length_to_boundery)); ^ Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__APPLE__;__GNUC__... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__APPLE__;__unix__... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__FreeBSD__... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__GNUC__... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__GNUC__;__clang__... Checking Test_box.c: MCDEFAULT_NCOUNT=1000000;ND_BUFFER=10000000;SIGABRT=1;SIGBREAK=1;SIGBUS=1;SIGPE=1;SIGHUP=1;SIGILL=1;SIGINT=1;SIGKILL=1;SIGUSR1=1;SIGUSR2=1;SIGPIPE=1;SIGQUIT=1;SIGSEGV=1;SIGTRAP=1;SIGURG=1;SIGFPE=1;SIGKILL=1;SIGTERM=1;__unix__=1;__dest_os... DEBUG: CMD: cppcheck finished INFO: End of linting ./Test_box.c