High level conclusions

Fuzzers reach 46.11% of cyclomatic complexity.

Fuzzers reach 38.11% of all functions.

Fuzzer write_all_graphml is blocked:

The runtime code coverage of write_all_graphml covers 29.78% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer read_graphml is blocked:

The runtime code coverage of read_graphml covers 17.44% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer linear_algos_directed is blocked:

The runtime code coverage of linear_algos_directed covers 29.97% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer misc_algos_weighted is blocked:

The runtime code coverage of misc_algos_weighted covers 28.58% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Fuzzer write_all_gml is blocked:

The runtime code coverage of write_all_gml covers 29.89% of its statically reachable code. This means there is some place that blocks the fuzzer to continue exploring more code at run time.

Reachability and coverage overview

Functions statically reachable by fuzzers

2659 / 6977

Cyclomatic complexity statically reachable by fuzzers

31531 / 68379

Runtime code coverage of functions

1478 / 6977

The following table shows data about each function in the project. The functions included in this table correspond to all functions that exist in the executables of the fuzzers. As such, there may be functions that are from third-party libraries.

For further technical details on the meaning of columns in the below table, please see the Glossary .

Func name	Functions filename	Args	Function call depth	Reached by Fuzzers	Fuzzers runtime hit	Func lines hit %	I Count	BB Count	Cyclomatic complexity	Functions reached	Reached by functions	Accumulated cyclomatic complexity	Undiscovered complexity

Fuzzer: read_graphdb

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	55	21.3%
gold	[1:9]	3	1.16%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	200	77.5%
All colors	258	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00182	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00125	/src/igraph/src/graph/type_indexededgelist.c:401
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00013	/src/igraph/src/core/error.c:213
3	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	3	149	igraph_add_vertices	call site: 00138	/src/igraph/src/graph/type_indexededgelist.c:421
3	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	3	286	igraph_add_edges	call site: 00233	/src/igraph/src/graph/type_indexededgelist.c:319
0	42	1 : View List ['igraph_error']	0	42	igraph_i_attribute_init	call site: 00116	/src/igraph/src/graph/attributes.c:619
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00031	/src/igraph/src/core/vector.pmt:145
0	15	1 : View List ['igraph_vector_int_null']	0	15	igraph_i_create_start_vectors	call site: 00241	/src/igraph/src/graph/type_indexededgelist.c:1068
0	0	None	49	1279	igraph_add_edges	call site: 00180	/src/igraph/src/graph/type_indexededgelist.c:267
0	0	None	16	16	IGRAPH_FINALLY_REAL	call site: 00034	/src/igraph/src/core/error.c:322
0	0	None	12	12	IGRAPH_FINALLY_ENTER	call site: 00139	/src/igraph/src/core/error.c:380
0	0	None	3	1127	igraph_add_edges	call site: 00187	/src/igraph/src/graph/type_indexededgelist.c:281

Runtime coverage analysis

Covered functions

42

Functions that are reachable but not covered

24

Reachable functions

66

Percentage of reachable functions covered

63.64%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphdb.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/graphdb.c	3
/src/igraph/src/core/vector.pmt	12
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_dimacs_flow

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	42	12.7%
gold	[1:9]	3	0.90%
yellow	[10:29]	4	1.21%
greenyellow	[30:49]	1	0.30%
lawngreen	50+	280	84.8%
All colors	330	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:203
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:213
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00210	/src/igraph/src/graph/type_indexededgelist.c:425
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00249	/src/igraph/src/graph/type_indexededgelist.c:273
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00199	/src/igraph/src/graph/type_indexededgelist.c:401
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_init	call site: 00030	/src/igraph/src/core/vector.pmt:145
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00027	/src/igraph/src/core/vector.pmt:145
0	21	1 : View List ['igraph_error']	0	21	igraph_i_attribute_init	call site: 00191	/src/igraph/src/graph/attributes.c:621
0	21	1 : View List ['igraph_error']	0	21	igraph_add_vertices	call site: 00213	/src/igraph/src/graph/type_indexededgelist.c:432
0	15	1 : View List ['igraph_vector_int_null']	0	15	igraph_i_create_start_vectors	call site: 00308	/src/igraph/src/graph/type_indexededgelist.c:1068
0	0	None	16	16	IGRAPH_FINALLY_REAL	call site: 00035	/src/igraph/src/core/error.c:322
0	0	None	12	12	IGRAPH_FINALLY_ENTER	call site: 00207	/src/igraph/src/core/error.c:380

Runtime coverage analysis

Covered functions

71

Functions that are reachable but not covered

24

Reachable functions

83

Percentage of reachable functions covered

71.08%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dimacs_flow.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector.pmt	19
/src/igraph/src/io/dimacs.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_edgelist

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	178	39.0%
gold	[1:9]	2	0.43%
yellow	[10:29]	5	1.09%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	271	59.4%
All colors	456	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
43	43	1 : View List ['igraph_vector_int_append']	43	273	igraph_i_eit_create_allfromto	call site: 00292	/src/igraph/src/graph/iterators.c:1661
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00016	/src/igraph/src/core/error.c:213
3	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	3	149	igraph_add_vertices	call site: 00157	/src/igraph/src/graph/type_indexededgelist.c:421
3	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	3	286	igraph_add_edges	call site: 00251	/src/igraph/src/graph/type_indexededgelist.c:319
2	2	1 : View List ['calloc']	10	75	igraph_i_parse_integer	call site: 00063	/src/igraph/src/io/parse_utils.c:65
0	42	1 : View List ['igraph_error']	0	42	igraph_i_attribute_init	call site: 00137	/src/igraph/src/graph/attributes.c:619
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00200	/src/igraph/src/graph/type_indexededgelist.c:273
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00146	/src/igraph/src/graph/type_indexededgelist.c:401
0	21	1 : View List ['igraph_error']	0	21	igraph_vector_int_init	call site: 00015	/src/igraph/src/core/vector.pmt:145
0	21	1 : View List ['igraph_error']	0	21	igraph_edge	call site: 00444	/src/igraph/src/graph/type_common.c:135
0	21	1 : View List ['igraph_error']	0	21	igraph_i_fskip_whitespace	call site: 00045	/src/igraph/src/io/parse_utils.c:165
0	15	1 : View List ['igraph_vector_int_null']	0	15	igraph_i_create_start_vectors	call site: 00259	/src/igraph/src/graph/type_indexededgelist.c:1068

Runtime coverage analysis

Covered functions

53

Functions that are reachable but not covered

37

Reachable functions

90

Percentage of reachable functions covered

58.89%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_edgelist.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/io/edgelist.c	2
/src/igraph/src/core/vector.pmt	13
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/parse_utils.c	3
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	4
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	9

Fuzzer: read_lgl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	258	28.4%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	650	71.5%
All colors	908	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:203
95	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	95	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
43	43	1 : View List ['igraph_vector_int_append']	43	273	igraph_i_eit_create_allfromto	call site: 00647	/src/igraph/src/graph/iterators.c:1661
35	394	5 : View List ['igraph_eit_destroy', 'igraph_vector_resize', 'igraph_eit_create', 'IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN']	35	436	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1755
32	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1099
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:213
10	14	2 : View List ['igraph_lgl_yyrealloc', 'igraph_fatal']	10	14	yy_get_next_buffer	call site: 00139	/src/igraph/build/src/io/parsers/lgl-lexer.c:1400
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00800	/src/igraph/src/core/error.c:472
2	2	1 : View List ['__errno_location']	2	2	igraph_lgl_yylex_init_extra	call site: 00085	/src/igraph/build/src/io/parsers/lgl-lexer.c:2169
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:264
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00512	/src/igraph/src/graph/type_indexededgelist.c:425
0	61	2 : View List ['igraph_error', 'igraph_strvector_resize']	0	61	igraph_strvector_append	call site: 00443	/src/igraph/src/core/strvector.c:334

Runtime coverage analysis

Covered functions

170

Functions that are reachable but not covered

42

Reachable functions

186

Percentage of reachable functions covered

77.42%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_lgl.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/lgl.c	4
/src/igraph/src/core/vector.pmt	20
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/core/memory.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: vertex_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	649	45.8%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	768	54.1%
All colors	1417	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
784	1904	23 : View List ['igraph_buckets_add', 'igraph_vector_int_null', 'igraph_vector_resize', 'igraph_vector_int_clear', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_dqueue_int_pop', 'igraph_vector_init', 'igraph_destroy', 'igraph_buckets_empty', 'igraph_vector_int_tail', 'igraph_create', 'igraph_dqueue_int_empty', 'igraph_dqueue_int_push', 'igraph_is_dag', 'igraph_vector_int_pop_back', 'igraph_vector_int_empty', 'igraph_buckets_popmax', 'igraph_buckets_clear', 'igraph_dqueue_int_init', 'igraph_vector_int_init', 'igraph_vector_int_push_back']	784	2235	igraph_maxflow	call site: 00806	/src/igraph/src/flow/flow.c:753
175	193	5 : View List ['igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	281	igraph_to_undirected	call site: 01323	/src/igraph/src/misc/conversion.c:657
43	113	3 : View List ['igraph_vector_bool_init', 'igraph_vector_int_resize', 'igraph_vector_bool_destroy']	986	2764	igraph_maxflow	call site: 00806	/src/igraph/src/flow/flow.c:683
42	86	3 : View List ['igraph_error', 'igraph_vector_int_reserve', 'igraph_vector_int_size']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:569
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01175	/src/igraph/src/graph/attributes.c:638
33	389	4 : View List ['igraph_eit_create', 'igraph_es_destroy', 'igraph_es_all', 'igraph_eit_destroy']	180	1007	igraph_to_undirected	call site: 01261	/src/igraph/src/misc/conversion.c:532
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
21	21	1 : View List ['igraph_error']	21	21	igraph_vector_init	call site: 00754	/src/igraph/src/core/vector.pmt:145

Runtime coverage analysis

Covered functions

113

Functions that are reachable but not covered

64

Reachable functions

177

Percentage of reachable functions covered

63.84%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	27
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	3
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/random/random.c	11
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2473	65.3%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	2	0.05%
lawngreen	50+	1310	34.6%
All colors	3785	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
3344	3344	2 : View List ['igraph_i_personalized_pagerank_arpack', 'igraph_arpack_options_get_default']	3344	3344	igraph_personalized_pagerank	call site: 01668	/src/igraph/src/centrality/pagerank.c:461
744	1003	7 : View List ['transitivity_local_undirected1', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'IGRAPH_FINALLY_CLEAN', 'transitivity_local_undirected2', 'igraph_vit_create', 'igraph_vit_destroy']	744	1003	igraph_transitivity_local_undirected	call site: 01467	/src/igraph/src/properties/triangles.c:380
421	421	1 : View List ['igraph_i_closeness_cutoff_weighted']	421	421	igraph_closeness_cutoff	call site: 01078	/src/igraph/src/centrality/closeness.c:347
418	418	1 : View List ['igraph_i_harmonic_centrality_weighted']	418	418	igraph_harmonic_centrality_cutoff	call site: 01193	/src/igraph/src/centrality/closeness.c:729
333	333	1 : View List ['adjacent_triangles1']	333	333	igraph_count_adjacent_triangles	call site: 01662	/src/igraph/src/properties/triangles.c:530
175	206	6 : View List ['igraph_vector_int_destroy', 'igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	301	igraph_simplify	call site: 03640	/src/igraph/src/operators/simplify.c:177
175	193	5 : View List ['igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	281	igraph_to_undirected	call site: 03462	/src/igraph/src/misc/conversion.c:657
88	100	4 : View List ['igraph_error', 'igraph_warning', 'igraph_vector_min', 'igraph_vector_size']	88	100	igraph_i_betweenness_check_weights	call site: 00232	/src/igraph/src/centrality/betweenness.c:430
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 00531	/src/igraph/src/core/stack.pmt:213
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00078	/src/igraph/src/graph/attributes.c:619
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 03433	/src/igraph/src/graph/attributes.c:638
31	43	7 : View List ['operator new[](unsigned long)', 'igraph_vector_min', '_ZNSt3__16__math5isnanB8ne180100EUa9enable_ifILb1EEd', 'std::__1::unique_ptr >::operator[][abi:ne180100](unsigned long) const', '_ZNSt3__110unique_ptrIA_dNS_14default_deleteIS1_EEE5resetB8ne180100IPdTnNS_9enable_ifIXsr28_CheckArrayPointerConversionIT_EE5valueEiE4typeELi0EEEvS8_', 'igraph_vector_size', 'igraph_vector_sum']	313	1447	igraph_i_personalized_pagerank_prpack	call site: 03074	/src/igraph/src/centrality/prpack.cpp:49

Runtime coverage analysis

Covered functions

181

Functions that are reachable but not covered

306

Reachable functions

521

Percentage of reachable functions covered

41.27%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	50
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	17
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	8
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	18
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/properties/triangles.c	12
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/paths/sparsifier.c	3
/src/igraph/src/core/bitset.c	4
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/centrality/truss.cpp	4
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/loops.c	1

Fuzzer: read_dl

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	175	24.2%
gold	[1:9]	1	0.13%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	4	0.55%
lawngreen	50+	541	75.0%
All colors	721	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:203
32	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1099
23	23	1 : View List ['igraph_attribute_record_check_type']	23	205	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:152
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:213
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00459	/src/igraph/src/core/error.c:472
2	2	1 : View List ['__errno_location']	2	2	igraph_dl_yylex_init_extra	call site: 00089	/src/igraph/build/src/io/parsers/dl-lexer.c:2436
0	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
0	61	2 : View List ['igraph_error', 'igraph_strvector_resize']	0	61	igraph_strvector_append	call site: 00545	/src/igraph/src/core/strvector.c:334
0	49	2 : View List ['igraph_strvector_set', 'igraph_strvector_size']	0	131	igraph_attribute_record_resize	call site: 00000	/src/igraph/src/graph/attributes.c:361
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_edges	call site: 00644	/src/igraph/src/graph/type_indexededgelist.c:273
0	23	1 : View List ['igraph_errorf']	0	23	igraph_add_vertices	call site: 00597	/src/igraph/src/graph/type_indexededgelist.c:401
0	23	1 : View List ['igraph_errorf']	0	23	igraph_i_parse_real	call site: 00265	/src/igraph/src/io/parse_utils.c:150

Runtime coverage analysis

Covered functions

151

Functions that are reachable but not covered

33

Reachable functions

167

Percentage of reachable functions covered

80.24%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_dl.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	14
/src/igraph/src/io/dl.c	2
/src/igraph/src/core/vector.pmt	21
/src/igraph/src/core/strvector.c	15
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/build/src/io/parsers/dl-lexer.c	22
/src/igraph/build/src/io/parsers/dl-parser.c	5
/src/igraph/src/io/dl-parser.y	5
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1

Fuzzer: read_pajek

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	511	40.4%
gold	[1:9]	2	0.15%
yellow	[10:29]	1	0.07%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	750	59.3%
All colors	1264	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:203
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:213
15	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	15	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1724
15	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	15	92	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1786
12	55	2 : View List ['igraph_vector_append', 'igraph_vector_clear']	12	76	igraph_i_cattribute_get_numeric_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1662
12	55	2 : View List ['igraph_vector_bool_append', 'igraph_vector_bool_clear']	12	76	igraph_i_cattribute_get_bool_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1693
12	55	2 : View List ['igraph_vector_append', 'igraph_vector_clear']	12	76	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1755
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00217	/src/igraph/src/core/error.c:472
2	2	1 : View List ['__errno_location']	2	2	igraph_pajek_yylex_init_extra	call site: 00165	/src/igraph/build/src/io/parsers/pajek-lexer.c:2619
0	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:264
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00797	/src/igraph/src/graph/type_indexededgelist.c:425

Runtime coverage analysis

Covered functions

204

Functions that are reachable but not covered

48

Reachable functions

224

Percentage of reachable functions covered

78.57%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_pajek.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	23
/src/igraph/src/io/pajek.c	4
/src/igraph/src/core/vector.pmt	24
/src/igraph/src/core/trie.c	9
/src/igraph/src/core/strvector.c	11
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/bitset.c	5
/src/igraph/build/src/io/parsers/pajek-lexer.c	22
/src/igraph/build/src/io/parsers/pajek-parser.c	5
/src/igraph/src/io/pajek-parser.y	19
/src/igraph/src/io/parse_utils.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/core/printing.c	1

Fuzzer: read_ncol

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	301	33.3%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	601	66.6%
All colors	902	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
229	229	1 : View List ['igraph_attribute_record_list_init_copy']	229	592	igraph_i_cattribute_init	call site: 00000	/src/igraph/src/graph/cattributes.c:203
223	349	7 : View List ['igraph_strvector_resize', 'igraph_strvector_get', 'igraph_strvector_set', 'IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN', 'igraph_vit_create', 'igraph_vit_destroy']	223	412	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1724
95	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	95	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
35	394	5 : View List ['igraph_eit_destroy', 'igraph_vector_resize', 'igraph_eit_create', 'IGRAPH_FINALLY_REAL', 'IGRAPH_FINALLY_CLEAN']	35	436	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1755
32	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	32	86	igraph_i_attribute_record_list_expand_if_full	call site: 00000	/src/igraph/src/graph/../core/typed_list.pmt:1099
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00017	/src/igraph/src/core/error.c:213
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00243	/src/igraph/src/core/error.c:472
2	2	1 : View List ['__errno_location']	2	2	igraph_ncol_yylex_init_extra	call site: 00249	/src/igraph/build/src/io/parsers/ncol-lexer.c:2163
0	224	3 : View List ['igraph_strvector_get', 'igraph_strvector_size', 'igraph_trie_get']	16	2216	igraph_read_graph_ncol	call site: 00081	/src/igraph/src/io/ncol.c:130
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:264
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00525	/src/igraph/src/graph/type_indexededgelist.c:425
0	61	2 : View List ['igraph_error', 'igraph_strvector_resize']	0	61	igraph_strvector_append	call site: 00450	/src/igraph/src/core/strvector.c:334

Runtime coverage analysis

Covered functions

164

Functions that are reachable but not covered

46

Reachable functions

186

Percentage of reachable functions covered

75.27%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_ncol.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	18
/src/igraph/src/io/ncol.c	4
/src/igraph/src/core/vector.pmt	22
/src/igraph/src/core/trie.c	11
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/memory.c	1
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	10
/src/igraph/src/core/printing.c	1

Fuzzer: weighted_centrality

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2520	65.4%
gold	[1:9]	1	0.02%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1331	34.5%
All colors	3852	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
3344	3344	2 : View List ['igraph_i_personalized_pagerank_arpack', 'igraph_arpack_options_get_default']	3344	3344	igraph_personalized_pagerank	call site: 01454	/src/igraph/src/centrality/pagerank.c:461
872	1347	21 : View List ['igraph_adjlist_init', 'igraph_vector_resize', 'igraph_vector_null', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_dqueue_int_destroy', 'igraph_dqueue_int_pop', 'IGRAPH_FINALLY_CLEAN', 'igraph_allow_interruption', 'igraph_dqueue_int_empty', 'igraph_dqueue_int_clear', 'igraph_vector_int_resize', 'igraph_adjlist_destroy', 'igraph_vector_int_destroy', 'igraph_dqueue_int_push', 'igraph_dqueue_int_init', 'igraph_vector_int_init', 'igraph_vit_create', 'igraph_vit_destroy', 'igraph_progress']	872	1347	igraph_closeness_cutoff	call site: 01080	/src/igraph/src/centrality/closeness.c:347
444	444	1 : View List ['transitivity_barrat1']	444	444	igraph_transitivity_barrat	call site: 03766	/src/igraph/src/properties/triangles.c:942
433	433	1 : View List ['igraph_i_harmonic_centrality_unweighted']	433	433	igraph_harmonic_centrality_cutoff	call site: 01195	/src/igraph/src/centrality/closeness.c:729
350	350	1 : View List ['igraph_adjlist_init']	809	2313	igraph_betweenness_subset	call site: 00761	/src/igraph/src/centrality/betweenness.c:935
350	350	1 : View List ['igraph_adjlist_init']	765	1736	igraph_betweenness_cutoff	call site: 00245	/src/igraph/src/centrality/betweenness.c:568
126	710	12 : View List ['igraph_vector_int_destroy', 'igraph_vector_resize', 'igraph_vector_null', 'igraph_incident', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_reserve', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vit_create', 'igraph_vit_destroy']	126	710	igraph_strength	call site: 01537	/src/igraph/src/properties/degrees.c:644
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 03089	/src/igraph/src/graph/attributes.c:264
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 00533	/src/igraph/src/core/stack.pmt:213
74	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 03098	/src/igraph/src/graph/../core/typed_list.pmt:1099
53	65	3 : View List ['igraph_error', 'igraph_vector_ptr_size', 'igraph_vector_ptr_reserve']	53	65	igraph_vector_ptr_push_back	call site: 03224	/src/igraph/src/core/vector_ptr.c:366
23	35	2 : View List ['igraph_vector_size', 'igraph_errorf']	23	35	igraph_transitivity_barrat	call site: 03739	/src/igraph/src/properties/triangles.c:918

Runtime coverage analysis

Covered functions

232

Functions that are reachable but not covered

302

Reachable functions

546

Percentage of reachable functions covered

44.69%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_centrality.cpp	1
/src/igraph/src/core/error.c	19
/src/igraph/src/core/vector.pmt	48
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/random/random.c	6
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	16
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/centrality/betweenness.c	9
/src/igraph/src/graph/adjlist.c	16
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/stack.pmt	8
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/indheap.c	16
/src/igraph/src/math/utils.c	1
/src/igraph/src/core/dqueue.pmt	6
/src/igraph/src/centrality/closeness.c	5
/src/igraph/src/paths/shortest_paths.c	6
/src/igraph/src/centrality/pagerank.c	5
/src/igraph/src/linalg/arpack.c	10
/src/igraph/src/core/matrix.pmt	5
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/math/complex.c	6
/src/igraph/vendor/lapack/dnaupd.c	1
/src/igraph/vendor/lapack/arscnd.c	1
/src/igraph/vendor/f2c/s_cmp.c	1
/src/igraph/vendor/lapack/dlamch.c	1
/src/igraph/vendor/lapack/fortran_intrinsics.c	7
/src/igraph/vendor/lapack/lsame.c	1
/src/igraph/vendor/lapack/dnaup2.c	1
/src/igraph/vendor/f2c/pow_dd.c	1
/src/igraph/vendor/lapack/dgetv0.c	1
/src/igraph/vendor/lapack/dlarnv.c	1
/src/igraph/vendor/lapack/dlaruv.c	1
/src/igraph/vendor/lapack/dcopy.c	1
/src/igraph/vendor/lapack/ddot.c	1
/src/igraph/vendor/lapack/dnrm2.c	1
/src/igraph/vendor/lapack/dgemv.c	1
/src/igraph/vendor/lapack/xerbla.c	1
/src/igraph/vendor/f2c/wsfe.c	1
/src/igraph/vendor/f2c/err.c	5
/src/igraph/vendor/f2c/sfe.c	2
/src/igraph/vendor/f2c/sig_die.c	1
/src/igraph/vendor/f2c/close.c	2
/src/igraph/vendor/f2c/endfile.c	1
/src/igraph/vendor/f2c/open.c	4
/src/igraph/vendor/f2c/util.c	2
/src/igraph/vendor/f2c/fmt.c	13
/src/igraph/vendor/lapack/len_trim.c	1
/src/igraph/vendor/f2c/i_len.c	1
/src/igraph/vendor/f2c/s_stop.c	1
/src/igraph/vendor/lapack/dvout.c	1
/src/igraph/vendor/lapack/dnaitr.c	1
/src/igraph/vendor/lapack/dlabad.c	1
/src/igraph/vendor/f2c/d_lg10.c	1
/src/igraph/vendor/lapack/ivout.c	1
/src/igraph/vendor/lapack/dscal.c	1
/src/igraph/vendor/lapack/dlascl.c	1
/src/igraph/vendor/lapack/disnan.c	1
/src/igraph/vendor/lapack/dlaisnan.c	1
/src/igraph/vendor/lapack/daxpy.c	1
/src/igraph/vendor/lapack/dlanhs.c	1
/src/igraph/vendor/lapack/dlassq.c	1
/src/igraph/vendor/lapack/dmout.c	1
/src/igraph/vendor/lapack/dneigh.c	1
/src/igraph/vendor/lapack/dlacpy.c	1
/src/igraph/vendor/lapack/dlahqr.c	1
/src/igraph/vendor/lapack/dlarfg.c	1
/src/igraph/vendor/lapack/dlapy2.c	1
/src/igraph/vendor/f2c/d_sign.c	1
/src/igraph/vendor/lapack/dlanv2.c	1
/src/igraph/vendor/lapack/drot.c	1
/src/igraph/vendor/lapack/dtrevc.c	1
/src/igraph/vendor/lapack/dlaln2.c	1
/src/igraph/vendor/lapack/dladiv.c	3
/src/igraph/vendor/lapack/idamax.c	1
/src/igraph/vendor/lapack/dngets.c	1
/src/igraph/vendor/lapack/dsortc.c	1
/src/igraph/vendor/lapack/dnconv.c	1
/src/igraph/vendor/f2c/s_copy.c	1
/src/igraph/vendor/lapack/dnapps.c	1
/src/igraph/vendor/lapack/dlaset.c	1
/src/igraph/vendor/lapack/dlartg.c	1
/src/igraph/vendor/f2c/pow_di.c	1
/src/igraph/vendor/lapack/dlarf.c	1
/src/igraph/vendor/lapack/iladlc.c	1
/src/igraph/vendor/lapack/iladlr.c	1
/src/igraph/vendor/lapack/dger.c	1
/src/igraph/vendor/lapack/dneupd.c	1
/src/igraph/vendor/lapack/dtrsen.c	1
/src/igraph/vendor/lapack/dlange.c	1
/src/igraph/vendor/lapack/dtrexc.c	1
/src/igraph/vendor/lapack/dlaexc.c	1
/src/igraph/vendor/lapack/dlasy2.c	1
/src/igraph/vendor/lapack/dswap.c	1
/src/igraph/vendor/lapack/dlarfx.c	1
/src/igraph/vendor/lapack/dtrsyl.c	1
/src/igraph/vendor/lapack/dlacn2.c	1
/src/igraph/vendor/lapack/dasum.c	1
/src/igraph/vendor/f2c/i_dnnt.c	1
/src/igraph/vendor/lapack/dgeqr2.c	1
/src/igraph/vendor/lapack/dorm2r.c	1
/src/igraph/vendor/lapack/dtrmm.c	1
/src/igraph/src/centrality/prpack.cpp	1
/src/igraph/src/centrality/prpack/prpack_igraph_graph.h	2
/src/igraph/src/centrality/prpack/prpack_base_graph.cpp	4
/src/igraph/src/centrality/prpack/prpack_igraph_graph.cpp	1
/src/igraph/src/centrality/prpack/prpack_solver.cpp	15
/src/igraph/src/centrality/prpack/prpack_utils.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_ge_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_result.cpp	2
/src/igraph/src/centrality/prpack/prpack_preprocessed_gs_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_schur_graph.cpp	5
/src/igraph/src/centrality/prpack/prpack_preprocessed_scc_graph.cpp	5
/usr/local/bin/../include/c++/v1/stdexcept	1
/src/igraph/src/properties/constraint.c	1
/src/igraph/src/graph/cattributes.c	8
/src/igraph/src/graph/../core/typed_list.pmt	7
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/triangles.c	8
/src/igraph/src/properties/loops.c	1

Fuzzer: community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1188	36.8%
gold	[1:9]	5	0.15%
yellow	[10:29]	2	0.06%
greenyellow	[30:49]	2	0.06%
lawngreen	50+	2024	62.8%
All colors	3221	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
584	584	2 : View List ['brent_opt', 'estimate_minmax_r']	626	732	igraph_community_voronoi	call site: 02178	/src/igraph/src/community/voronoi.c:615
564	564	1 : View List ['igraph_i_ecc3_2']	564	564	igraph_ecc	call site: 02081	/src/igraph/src/properties/ecc.c:372
454	468	2 : View List ['igraph_ecount', 'igraph_i_connected_components_strong']	475	489	igraph_is_connected	call site: 03125	/src/igraph/src/connectivity/components.c:464
440	440	1 : View List ['igraph_i_voronoi']	461	523	igraph_voronoi	call site: 02284	/src/igraph/src/paths/voronoi.c:408
282	282	1 : View List ['igraph_has_mutual']	595	2252	igraph_community_fluid_communities	call site: 03161	/src/igraph/src/community/fluid.c:96
175	206	6 : View List ['igraph_vector_int_destroy', 'igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	301	igraph_simplify	call site: 01924	/src/igraph/src/operators/simplify.c:177
175	193	5 : View List ['igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	281	igraph_to_undirected	call site: 02452	/src/igraph/src/misc/conversion.c:657
168	733	13 : View List ['igraph_dqueue_int_push', 'igraph_vector_int_init_range', 'igraph_neighbors', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_dqueue_int_destroy', 'igraph_dqueue_int_pop', 'igraph_dqueue_int_init', 'igraph_vector_int_init', 'igraph_dqueue_int_empty', 'igraph_vector_int_shuffle', 'igraph_vector_int_resize']	168	839	igraph_community_label_propagation	call site: 00647	/src/igraph/src/community/label_propagation.c:699
109	305	9 : View List ['igraph_i_attribute_combine_vertices', 'igraph_vector_int_destroy', 'igraph_vector_int_list_init', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_list_destroy', 'igraph_vector_int_list_get_ptr', 'igraph_vector_int_init', 'igraph_vector_int_push_back']	109	362	igraph_contract_vertices	call site: 01548	/src/igraph/src/operators/contract.c:121
105	806	10 : View List ['igraph_vector_int_destroy', 'igraph_connected_components', 'igraph_matrix_int_resize', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_edge']	105	806	igraph_community_eb_get_merges	call site: 01180	/src/igraph/src/community/edge_betweenness.c:267
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 01069	/src/igraph/src/core/stack.pmt:213
50	134	4 : View List ['igraph_inclist_init_empty', 'igraph_vector_min', 'igraph_2wheap_init', 'igraph_vector_size']	526	2557	igraph_community_edge_betweenness	call site: 00994	/src/igraph/src/community/edge_betweenness.c:536

Runtime coverage analysis

Covered functions

309

Functions that are reachable but not covered

95

Reachable functions

435

Percentage of reachable functions covered

78.16%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	58
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	11
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	9
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/misc/mixing.c	1
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/leiden.c	8
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/fluid.c	1

Fuzzer: vertex_separators

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	645	23.6%
gold	[1:9]	0	0.0%
yellow	[10:29]	1	0.03%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2078	76.2%
All colors	2724	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
175	206	6 : View List ['igraph_vector_int_destroy', 'igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	301	igraph_simplify	call site: 01728	/src/igraph/src/operators/simplify.c:177
126	568	7 : View List ['igraph_dqueue_int_push', 'igraph_vector_int_size', 'igraph_error', 'igraph_dqueue_int_pop', 'igraph_i_lazy_adjlist_get_real', 'igraph_dqueue_int_head', 'igraph_dqueue_int_empty']	126	629	igraph_bfs	call site: 02196	/src/igraph/src/graph/visitors.c:201
97	305	9 : View List ['igraph_i_attribute_combine_vertices', 'igraph_vector_int_destroy', 'igraph_vector_int_list_init', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_list_destroy', 'igraph_vector_int_list_get_ptr', 'igraph_vector_int_init', 'igraph_vector_int_push_back']	97	362	igraph_contract_vertices	call site: 01935	/src/igraph/src/operators/contract.c:121
87	181	7 : View List ['igraph_i_attribute_get_info', 'igraph_i_attribute_permute_vertices', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_init', 'igraph_i_attribute_copy']	87	256	igraph_permute_vertices	call site: 02009	/src/igraph/src/operators/permute.c:111
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01372	/src/igraph/src/graph/attributes.c:638
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	35	2 : View List ['igraph_vector_int_size', 'igraph_errorf']	23	35	igraph_contract_vertices	call site: 01918	/src/igraph/src/operators/contract.c:74
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
21	53	2 : View List ['igraph_error', 'igraph_vector_int_reserve']	21	53	igraph_vector_int_append	call site: 00825	/src/igraph/src/core/vector.pmt:2395

Runtime coverage analysis

Covered functions

249

Functions that are reachable but not covered

50

Reachable functions

299

Percentage of reachable functions covered

83.28%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/vertex_separators.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	44
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	11
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	21
/src/igraph/src/connectivity/separators.c	10
/src/igraph/src/graph/adjlist.c	11
/src/igraph/src/graph/iterators.c	18
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	11
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/flow/flow_conversion.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/graph/basic_query.c	1
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	2
/src/igraph/src/random/random.c	11
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/flow/st-cuts.c	8
/src/igraph/src/operators/contract.c	1
/src/igraph/src/operators/permute.c	2
/src/igraph/src/core/marked_queue.c	8
/src/igraph/src/core/estack.c	5
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/connectivity/cohesive_blocks.c	4
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/properties/degrees.c	1

Fuzzer: basic_properties_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	402	37.1%
gold	[1:9]	2	0.18%
yellow	[10:29]	5	0.46%
greenyellow	[30:49]	2	0.18%
lawngreen	50+	671	62.0%
All colors	1082	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
529	529	1 : View List ['igraph_i_is_eulerian_directed']	550	550	igraph_is_eulerian	call site: 00757	/src/igraph/src/paths/eulerian.c:338
454	468	2 : View List ['igraph_ecount', 'igraph_i_connected_components_strong']	475	489	igraph_is_connected	call site: 00363	/src/igraph/src/connectivity/components.c:464
314	314	1 : View List ['igraph_is_dag']	314	314	igraph_is_acyclic	call site: 00591	/src/igraph/src/properties/trees.c:741
113	269	4 : View List ['igraph_error', 'igraph_copy', 'igraph_add_edges', 'IGRAPH_FINALLY_REAL']	113	424	igraph_is_chordal	call site: 01019	/src/igraph/src/misc/chordality.c:453
56	56	2 : View List ['igraph_error', 'igraph_vector_bool_resize']	56	87	igraph_is_bipartite	call site: 00350	/src/igraph/src/misc/bipartite.c:1072
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	1 : View List ['igraph_errorf']	23	35	igraph_is_chordal	call site: 00947	/src/igraph/src/misc/chordality.c:303
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
21	62	2 : View List ['igraph_error', 'igraph_vector_int_push_back']	21	62	igraph_i_is_forest	call site: 00630	/src/igraph/src/properties/trees.c:601

Runtime coverage analysis

Covered functions

95

Functions that are reachable but not covered

34

Reachable functions

129

Percentage of reachable functions covered

73.64%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_undirected.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	19
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	9
/src/igraph/src/graph/attributes.c	5
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	2
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/bipartite.c	1
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/connectivity/components.c	6
/src/igraph/src/core/bitset.c	2
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/trees.c	6
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/misc/chordality.c	2
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: weighted_community

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1299	33.8%
gold	[1:9]	5	0.13%
yellow	[10:29]	7	0.18%
greenyellow	[30:49]	1	0.02%
lawngreen	50+	2527	65.8%
All colors	3839	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
584	584	2 : View List ['brent_opt', 'estimate_minmax_r']	626	732	igraph_community_voronoi	call site: 02360	/src/igraph/src/community/voronoi.c:615
564	564	1 : View List ['igraph_i_ecc3_2']	564	564	igraph_ecc	call site: 02263	/src/igraph/src/properties/ecc.c:372
454	468	2 : View List ['igraph_ecount', 'igraph_i_connected_components_strong']	475	489	igraph_is_connected	call site: 03291	/src/igraph/src/connectivity/components.c:464
440	440	1 : View List ['igraph_i_voronoi']	461	523	igraph_voronoi	call site: 02464	/src/igraph/src/paths/voronoi.c:408
168	733	13 : View List ['igraph_dqueue_int_push', 'igraph_vector_int_init_range', 'igraph_neighbors', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_dqueue_int_destroy', 'igraph_dqueue_int_pop', 'igraph_dqueue_int_init', 'igraph_vector_int_init', 'igraph_dqueue_int_empty', 'igraph_vector_int_shuffle', 'igraph_vector_int_resize']	168	839	igraph_community_label_propagation	call site: 00880	/src/igraph/src/community/label_propagation.c:699
126	710	12 : View List ['igraph_vector_int_destroy', 'igraph_vector_resize', 'igraph_vector_null', 'igraph_incident', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_reserve', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vit_create', 'igraph_vit_destroy']	126	710	igraph_strength	call site: 00491	/src/igraph/src/properties/degrees.c:644
105	806	10 : View List ['igraph_vector_int_destroy', 'igraph_connected_components', 'igraph_matrix_int_resize', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vector_int_resize', 'igraph_edge']	105	806	igraph_community_eb_get_merges	call site: 01399	/src/igraph/src/community/edge_betweenness.c:267
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 00256	/src/igraph/src/graph/attributes.c:264
86	86	3 : View List ['igraph_stack_int_reserve', 'igraph_stack_int_size', 'igraph_error']	86	86	igraph_stack_int_push	call site: 01289	/src/igraph/src/core/stack.pmt:213
74	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 00266	/src/igraph/src/graph/../core/typed_list.pmt:1099
50	134	4 : View List ['igraph_inclist_init_empty', 'igraph_vector_min', 'igraph_2wheap_init', 'igraph_vector_size']	526	2557	igraph_community_edge_betweenness	call site: 01215	/src/igraph/src/community/edge_betweenness.c:536
45	45	1 : View List ['igraph_i_sparsemat_colsums_cc']	45	45	igraph_sparsemat_colsums	call site: 01680	/src/igraph/src/core/sparsemat.c:2812

Runtime coverage analysis

Covered functions

493

Functions that are reachable but not covered

138

Reachable functions

743

Percentage of reachable functions covered

81.43%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/weighted_community.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	63
/src/igraph/src/graph/attributes.c	26
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	18
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/matrix.pmt	13
/src/igraph/src/graph/cattributes.c	9
/src/igraph/src/graph/../core/typed_list.pmt	8
/src/igraph/src/core/strvector.c	8
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	2
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/community/label_propagation.c	3
/src/igraph/src/graph/adjlist.c	11
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/dqueue.pmt	8
/src/igraph/src/community/walktrap/walktrap.cpp	1
/src/igraph/src/community/walktrap/walktrap_graph.cpp	8
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	3
/src/igraph/src/core/progress.c	1
/src/igraph/src/community/walktrap/walktrap_communities.cpp	17
/src/igraph/src/community/walktrap/walktrap_heap.cpp	9
/src/igraph/src/community/community_misc.c	9
/src/igraph/src/community/edge_betweenness.c	5
/src/igraph/src/core/indheap.c	16
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/math/utils.c	1
/src/igraph/src/community/modularity.c	3
/src/igraph/src/core/sparsemat.c	24
/src/igraph/vendor/cs/cs_util.c	4
/src/igraph/vendor/cs/cs_malloc.c	4
/src/igraph/vendor/cs/cs_entry.c	1
/src/igraph/vendor/cs/cs_compress.c	1
/src/igraph/vendor/cs/cs_cumsum.c	1
/src/igraph/vendor/cs/cs_dupl.c	1
/src/igraph/src/operators/contract.c	1
/src/igraph/src/core/typed_list.pmt	8
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/community/voronoi.c	9
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/paths/voronoi.c	3
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/community/fast_modularity.c	12
/src/igraph/src/community/leiden.c	8
/src/igraph/src/community/louvain.c	9
/src/igraph/src/community/spinglass/clustertool.cpp	3
/src/igraph/src/community/spinglass/NetDataTypes.h	101
/src/igraph/src/community/spinglass/NetRoutines.cpp	1
/src/igraph/src/community/spinglass/NetDataTypes.cpp	4
/src/igraph/src/community/spinglass/pottsmodel_2.cpp	17
/src/igraph/src/community/spinglass/pottsmodel_2.h	3

Fuzzer: basic_properties_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	236	26.9%
gold	[1:9]	0	0.0%
yellow	[10:29]	7	0.79%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	634	72.2%
All colors	877	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
526	526	1 : View List ['igraph_i_is_eulerian_undirected']	547	547	igraph_is_eulerian	call site: 00750	/src/igraph/src/paths/eulerian.c:338
233	233	1 : View List ['igraph_i_is_connected_weak']	254	254	igraph_is_connected	call site: 00346	/src/igraph/src/connectivity/components.c:464
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
21	62	2 : View List ['igraph_error', 'igraph_vector_int_push_back']	21	62	igraph_i_is_forest	call site: 00623	/src/igraph/src/properties/trees.c:601
21	21	1 : View List ['igraph_error']	21	21	igraph_stack_int_init	call site: 00634	/src/igraph/src/core/stack.pmt:51
21	21	1 : View List ['igraph_error']	21	21	igraph_vector_int_init	call site: 00010	/src/igraph/src/core/vector.pmt:145
10	10	1 : View List ['igraph_fatal']	10	10	igraph_i_property_cache_set_bool_checked	call site: 00256	/src/igraph/src/graph/caching.c:127
0	49	2 : View List ['igraph_has_loop', 'igraph_i_property_cache_get_bool']	0	49	igraph_has_mutual	call site: 00269	/src/igraph/src/properties/multiplicity.c:490

Runtime coverage analysis

Covered functions

94

Functions that are reachable but not covered

22

Reachable functions

116

Percentage of reachable functions covered

81.03%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/basic_properties_directed.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	11
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	3
/src/igraph/src/properties/loops.c	1
/src/igraph/src/graph/adjlist.c	7
/src/igraph/src/properties/complete.c	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/graph/iterators.c	4
/src/igraph/src/core/progress.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/src/properties/trees.c	5
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/paths/eulerian.c	3
/src/igraph/src/properties/basic_properties.c	1

Fuzzer: linear_algos_undirected

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	1031	30.2%
gold	[1:9]	5	0.14%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	2369	69.5%
All colors	3405	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
951	951	2 : View List ['igraph_i_is_eulerian_directed', 'igraph_i_eulerian_path_directed']	951	1014	igraph_eulerian_cycle	call site: 02243	/src/igraph/src/paths/eulerian.c:603
951	951	2 : View List ['igraph_i_is_eulerian_directed', 'igraph_i_eulerian_path_directed']	951	1014	igraph_eulerian_path	call site: 02103	/src/igraph/src/paths/eulerian.c:665
529	529	1 : View List ['igraph_i_is_eulerian_directed']	529	550	igraph_is_eulerian	call site: 01995	/src/igraph/src/paths/eulerian.c:338
471	471	1 : View List ['igraph_i_realize_directed_degree_sequence(igraph_t*, igraph_vector_int_t const*, igraph_vector_int_t const*, unsigned int, igraph_realize_degseq_t)']	471	471	igraph_realize_degree_sequence	call site: 01374	/src/igraph/src/misc/degree_sequence.cpp:801
454	468	2 : View List ['igraph_ecount', 'igraph_i_connected_components_strong']	454	489	igraph_is_connected	call site: 00727	/src/igraph/src/connectivity/components.c:464
172	217	6 : View List ['igraph_i_is_graphical_directed_loopy_multi', 'igraph_vector_int_size', 'igraph_error', 'igraph_i_is_graphical_directed_loopless_multi', 'igraph_i_is_graphical_directed_loopy_simple', 'igraph_i_is_graphical_directed_simple']	172	217	igraph_is_graphical	call site: 01290	/src/igraph/src/misc/graphicality.c:119
133	206	6 : View List ['igraph_vector_int_destroy', 'igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	133	301	igraph_simplify	call site: 03174	/src/igraph/src/operators/simplify.c:177
43	43	1 : View List ['igraph_vector_int_append']	43	273	igraph_i_eit_create_allfromto	call site: 01054	/src/igraph/src/graph/iterators.c:1661
26	65	4 : View List ['igraph_rng_default', 'time', 'igraph_rng_seed', 'igraph_rng_get_integer']	32	2861	igraph_pseudo_diameter	call site: 01650	/src/igraph/src/paths/distances.c:538
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00011	/src/igraph/src/core/error.c:213

Runtime coverage analysis

Covered functions

305

Functions that are reachable but not covered

81

Reachable functions

390

Percentage of reachable functions covered

79.23%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_undirected.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	56
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	20
/src/igraph/src/core/memory.c	2
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	14
/src/igraph/src/core/matrix.pmt	4
/src/igraph/src/misc/feedback_arc_set.c	2
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	11
/src/igraph/src/core/bitset.c	3
/src/igraph/src/graph/adjlist.c	16
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/interruption.c	1
/src/igraph/src/misc/chordality.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/properties/girth.c	1
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/progress.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	4
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	1
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	12
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	3
/src/igraph/src/paths/distances.c	2
/src/igraph/src/random/random.c	12
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/misc/coloring.c	7
/src/igraph/src/core/indheap.c	23
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/core/genheap.c	14
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/operators/subgraph.c	5
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/properties/trees.c	3
/src/igraph/src/constructors/prufer.c	1
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1

Fuzzer: edge_connectivity

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	642	45.6%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	764	54.3%
All colors	1406	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
713	1904	23 : View List ['igraph_buckets_add', 'igraph_vector_int_null', 'igraph_vector_resize', 'igraph_vector_int_clear', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_dqueue_int_pop', 'igraph_vector_init', 'igraph_destroy', 'igraph_buckets_empty', 'igraph_vector_int_tail', 'igraph_create', 'igraph_dqueue_int_empty', 'igraph_dqueue_int_push', 'igraph_is_dag', 'igraph_vector_int_pop_back', 'igraph_vector_int_empty', 'igraph_buckets_popmax', 'igraph_buckets_clear', 'igraph_dqueue_int_init', 'igraph_vector_int_init', 'igraph_vector_int_push_back']	713	2235	igraph_maxflow	call site: 00763	/src/igraph/src/flow/flow.c:753
175	193	5 : View List ['igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	281	igraph_to_undirected	call site: 01312	/src/igraph/src/misc/conversion.c:657
107	366	11 : View List ['igraph_vector_int_destroy', 'igraph_vector_int_append', 'igraph_vector_int_clear', 'free', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_push_back', 'igraph_vector_int_resize', 'calloc', 'igraph_edge']	107	366	igraph_i_mincut_undirected	call site: 00736	/src/igraph/src/flow/flow.c:1395
43	113	3 : View List ['igraph_vector_bool_init', 'igraph_vector_int_resize', 'igraph_vector_bool_destroy']	903	2764	igraph_maxflow	call site: 00763	/src/igraph/src/flow/flow.c:683
42	86	3 : View List ['igraph_error', 'igraph_vector_int_reserve', 'igraph_vector_int_size']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:569
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01273	/src/igraph/src/graph/attributes.c:638
33	389	4 : View List ['igraph_eit_create', 'igraph_es_destroy', 'igraph_es_all', 'igraph_eit_destroy']	180	1007	igraph_to_undirected	call site: 01247	/src/igraph/src/misc/conversion.c:532
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	2 : View List ['igraph_error', 'realloc']	23	23	igraph_vector_reserve	call site: 00726	/src/igraph/src/core/vector.pmt:470
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273

Runtime coverage analysis

Covered functions

130

Functions that are reachable but not covered

45

Reachable functions

175

Percentage of reachable functions covered

74.29%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/edge_connectivity.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	30
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/graph/type_indexededgelist.c	15
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	7
/src/igraph/src/core/vector.c	2
/src/igraph/src/flow/flow.c	13
/src/igraph/src/connectivity/components.c	5
/src/igraph/src/core/bitset.c	2
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	6
/src/igraph/src/graph/iterators.c	14
/src/igraph/src/core/progress.c	1
/src/igraph/src/core/cutheap.c	11
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/buckets.c	14
/src/igraph/src/properties/dag.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/core/typed_list.pmt	8

Fuzzer: read_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	214	16.2%
gold	[1:9]	22	1.67%
yellow	[10:29]	3	0.22%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1074	81.7%
All colors	1313	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:213
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00350	/src/igraph/src/core/error.c:472
2	2	1 : View List ['__errno_location']	2	2	igraph_gml_yylex_init_extra	call site: 00055	/src/igraph/build/src/io/parsers/gml-lexer.c:2235
0	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:264
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1724
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1786
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 00910	/src/igraph/src/graph/type_indexededgelist.c:425
0	61	2 : View List ['igraph_error', 'igraph_strvector_resize']	0	61	igraph_strvector_append	call site: 00000	/src/igraph/src/core/strvector.c:334
0	55	2 : View List ['igraph_vector_append', 'igraph_vector_clear']	0	76	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1755
0	50	2 : View List ['igraph_error', 'igraph_strvector_init']	0	68	igraph_trie_init	call site: 00451	/src/igraph/src/core/trie.c:67
0	49	2 : View List ['igraph_strvector_set', 'igraph_strvector_size']	0	131	igraph_attribute_record_resize	call site: 00712	/src/igraph/src/graph/attributes.c:361

Runtime coverage analysis

Covered functions

228

Functions that are reachable but not covered

45

Reachable functions

236

Percentage of reachable functions covered

80.93%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	5
/src/igraph/src/core/vector.pmt	30
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	12
/src/igraph/src/core/strvector.c	11
/src/igraph/src/core/trie.c	10
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	8
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/graph/iterators.c	3
/src/igraph/src/internal/qsort.c	4

Fuzzer: write_all_gml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	3059	57.3%
gold	[1:9]	27	0.50%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	12	0.22%
lawngreen	50+	2240	41.9%
All colors	5338	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
844	844	1 : View List ['xmlFreeDoc']	848	1449	igraph_read_graph_graphml	call site: 04742	/src/igraph/src/io/graphml.c:1557
45	66	2 : View List ['igraph_error', 'igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:985
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1019
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1140
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1152
45	45	1 : View List ['igraph_i_graphml_handle_unknown_start_tag']	45	66	igraph_i_graphml_sax_handler_start_element_ns_inner	call site: 00000	/src/igraph/src/io/graphml.c:1164
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00010	/src/igraph/src/core/error.c:213
14	227	9 : View List ['check_name', 'igraph_strvector_destroy', 'igraph_vss_1', 'igraph_degree_1', 'igraph_strvector_get', 'igraph_strvector_init', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_i_attribute_get_string_vertex_attr']	14	288	igraph_write_graph_lgl	call site: 04917	/src/igraph/src/io/lgl.c:430
10	14	2 : View List ['igraph_lgl_yyrealloc', 'igraph_fatal']	10	14	yy_get_next_buffer	call site: 00090	/src/igraph/build/src/io/parsers/lgl-lexer.c:1400
6	109	4 : View List ['igraph_vector_bool_init', 'igraph_i_attribute_get_bool_vertex_attr', 'igraph_vector_int_init', 'igraph_vector_bool_destroy']	18	2160	igraph_write_graph_pajek	call site: 01793	/src/igraph/src/io/pajek.c:488
6	6	3 : View List ['time', 'strlen', 'ctime']	37	3058	igraph_write_graph_gml	call site: 01477	/src/igraph/src/io/gml.c:952
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00350	/src/igraph/src/core/error.c:472

Runtime coverage analysis

Covered functions

331

Functions that are reachable but not covered

645

Reachable functions

920

Percentage of reachable functions covered

29.89%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_gml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/gml.c	15
/src/igraph/src/io/gml-tree.c	16
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/vector.pmt	37
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/core/memory.c	1
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/trie.c	12
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.0/threads.c	9
/src/libxml2-2.14.0/dict.c	21
/src/libxml2-2.14.0/error.c	17
/src/libxml2-2.14.0/xmlmemory.c	1
/src/libxml2-2.14.0/globals.c	21
/src/libxml2-2.14.0/encoding.c	15
/src/libxml2-2.14.0/xpath.c	2
/src/libxml2-2.14.0/xmlIO.c	16
/src/libxml2-2.14.0/catalog.c	33
/src/libxml2-2.14.0/parser.c	144
/src/libxml2-2.14.0/parserInternals.c	38
/src/libxml2-2.14.0/SAX2.c	6
/src/libxml2-2.14.0/buf.c	19
/src/libxml2-2.14.0/hash.c	26
/src/libxml2-2.14.0/xmlstring.c	16
/src/libxml2-2.14.0/include/private/memory.h	1
/src/libxml2-2.14.0/tree.c	66
/src/libxml2-2.14.0/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.0/valid.c	40
/src/libxml2-2.14.0/list.c	3
/src/libxml2-2.14.0/xmlregexp.c	4
/src/libxml2-2.14.0/entities.c	10
/src/libxml2-2.14.0/chvalid.c	1
/src/libxml2-2.14.0/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1

Fuzzer: misc_algos_weighted

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4550	72.5%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1722	27.4%
All colors	6272	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
398	398	1 : View List ['igraph_radius']	398	398	igraph_radius_dijkstra	call site: 01553	/src/igraph/src/paths/distances.c:446
373	373	1 : View List ['igraph_eccentricity']	373	373	igraph_eccentricity_dijkstra	call site: 01580	/src/igraph/src/paths/distances.c:323
301	301	1 : View List ['igraph_i_random_walk_adjlist']	301	301	igraph_random_walk	call site: 05394	/src/igraph/src/paths/random_walk.c:342
210	1532	17 : View List ['igraph_vss_all', 'igraph_vector_resize', 'igraph_neighbors', 'igraph_vector_int_clear', 'igraph_vector_null', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_maxdegree', 'igraph_vector_init', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_destroy', 'igraph_vector_int_destroy', 'igraph_degree', 'igraph_vector_int_init', 'igraph_vit_create', 'igraph_vit_destroy']	210	1532	igraph_avg_nearest_neighbor_degree	call site: 00774	/src/igraph/src/properties/degrees.c:280
180	433	8 : View List ['igraph_vector_int_null', 'igraph_neighbors', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_sort_ind', 'igraph_vector_int_init', 'igraph_vector_int_resize']	180	508	igraph_i_feedback_arc_set_eades	call site: 05362	/src/igraph/src/misc/feedback_arc_set.c:714
173	173	1 : View List ['igraph_i_minimum_spanning_tree_unweighted']	173	173	igraph_i_minimum_spanning_tree_prim	call site: 01670	/src/igraph/src/misc/spanning_trees.c:189
173	173	1 : View List ['igraph_i_minimum_spanning_tree_unweighted']	173	173	igraph_i_minimum_spanning_tree_kruskal	call site: 01762	/src/igraph/src/misc/spanning_trees.c:349
126	710	12 : View List ['igraph_vector_int_destroy', 'igraph_vector_resize', 'igraph_vector_null', 'igraph_incident', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_reserve', 'IGRAPH_FINALLY_CLEAN', 'igraph_vector_int_init', 'igraph_vit_create', 'igraph_vit_destroy']	126	710	igraph_strength	call site: 00388	/src/igraph/src/properties/degrees.c:644
105	105	1 : View List ['igraph_error']	105	105	igraph_attribute_record_check_type	call site: 05836	/src/igraph/src/graph/attributes.c:264
74	86	3 : View List ['igraph_error', 'igraph_attribute_record_list_reserve', 'igraph_attribute_record_list_size']	74	86	igraph_i_attribute_record_list_expand_if_full	call site: 05841	/src/igraph/src/graph/../core/typed_list.pmt:1099
53	65	3 : View List ['igraph_error', 'igraph_vector_ptr_size', 'igraph_vector_ptr_reserve']	53	65	igraph_vector_ptr_push_back	call site: 05960	/src/igraph/src/core/vector_ptr.c:366
33	389	4 : View List ['igraph_eit_create', 'igraph_es_destroy', 'igraph_es_all', 'igraph_eit_destroy']	180	1007	igraph_to_undirected	call site: 05976	/src/igraph/src/misc/conversion.c:532

Runtime coverage analysis

Covered functions

286

Functions that are reachable but not covered

657

Reachable functions

920

Percentage of reachable functions covered

28.59%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos_weighted.cpp	1
/src/igraph/src/core/error.c	18
/src/igraph/src/core/vector.pmt	61
/src/igraph/src/graph/attributes.c	22
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	15
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	18
/src/igraph/src/core/matrix.pmt	7
/src/igraph/src/misc/conversion.c	3
/src/igraph/src/properties/spectral.c	2
/src/igraph/src/graph/iterators.c	16
/src/igraph/src/properties/degrees.c	6
/src/igraph/src/misc/mixing.c	3
/src/igraph/src/paths/distances.c	8
/src/igraph/src/graph/adjlist.c	17
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/interruption.c	1
/src/igraph/src/core/indheap.c	27
/src/igraph/src/paths/shortest_paths.c	9
/src/igraph/src/core/progress.c	1
/src/igraph/src/paths/unweighted.c	4
/src/igraph/src/paths/dijkstra.c	4
/src/igraph/src/misc/feedback_arc_set.c	9
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/core/bitset.c	4
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/graph/visitors.c	1
/src/igraph/src/properties/dag.c	1
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/src/core/stack.pmt	8
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/paths/bellman_ford.c	1
/src/igraph/src/paths/widest_paths.c	1
/src/igraph/src/misc/other.c	1
/src/igraph/src/graph/cattributes.c	7
/src/igraph/src/graph/../core/typed_list.pmt	6
/src/igraph/src/core/strvector.c	8
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/sparsifier.c	3

Fuzzer: linear_algos_directed

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	4162	64.6%
gold	[1:9]	2	0.03%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	54	0.83%
lawngreen	50+	2224	34.5%
All colors	6442	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
949	949	2 : View List ['igraph_i_is_eulerian_undirected', 'igraph_i_eulerian_path_undirected']	949	1012	igraph_eulerian_cycle	call site: 05747	/src/igraph/src/paths/eulerian.c:603
949	949	2 : View List ['igraph_i_is_eulerian_undirected', 'igraph_i_eulerian_path_undirected']	949	1012	igraph_eulerian_path	call site: 05601	/src/igraph/src/paths/eulerian.c:665
573	573	1 : View List ['igraph_i_realize_undirected_degree_sequence(igraph_t*, igraph_vector_int_t const*, unsigned int, igraph_realize_degseq_t)']	573	573	igraph_realize_degree_sequence	call site: 01162	/src/igraph/src/misc/degree_sequence.cpp:801
526	526	1 : View List ['igraph_i_is_eulerian_undirected']	526	547	igraph_is_eulerian	call site: 05533	/src/igraph/src/paths/eulerian.c:338
159	159	4 : View List ['igraph_i_is_graphical_undirected_simple', 'igraph_i_is_graphical_undirected_loopy_simple', 'igraph_i_is_graphical_undirected_loopless_multi', 'igraph_i_is_graphical_undirected_multi_loops']	159	159	igraph_is_graphical	call site: 01078	/src/igraph/src/misc/graphicality.c:119
133	206	6 : View List ['igraph_vector_int_destroy', 'igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	133	301	igraph_simplify	call site: 06217	/src/igraph/src/operators/simplify.c:177
96	433	8 : View List ['igraph_vector_int_null', 'igraph_neighbors', 'igraph_vector_int_size', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_vector_int_sort_ind', 'igraph_vector_int_init', 'igraph_vector_int_resize']	96	508	igraph_i_feedback_arc_set_eades	call site: 05512	/src/igraph/src/misc/feedback_arc_set.c:714
26	65	4 : View List ['igraph_rng_default', 'time', 'igraph_rng_seed', 'igraph_rng_get_integer']	32	2861	igraph_pseudo_diameter	call site: 01464	/src/igraph/src/paths/distances.c:538
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00011	/src/igraph/src/core/error.c:213
14	40	3 : View List ['igraph_ecount', 'igraph_vector_size', 'igraph_vector_is_all_finite']	14494	15121	igraph_feedback_arc_set	call site: 02029	/src/igraph/src/misc/feedback_arc_set.c:353
11	11	1 : View List ['igraph_i_rng_get_uint64_bounded']	11	11	igraph_i_rng_get_uint_bounded	call site: 01475	/src/igraph/src/random/random.c:542
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 00719	/src/igraph/src/core/error.c:472

Runtime coverage analysis

Covered functions

276

Functions that are reachable but not covered

647

Reachable functions

924

Percentage of reachable functions covered

29.98%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/linear_algos_directed.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/core/vector.pmt	57
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	4
/src/igraph/src/graph/type_indexededgelist.c	21
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	3
/src/igraph/src/core/typed_list.pmt	14
/src/igraph/src/core/matrix.pmt	4
/src/igraph/src/misc/feedback_arc_set.c	10
/src/igraph/src/core/stack.pmt	9
/src/igraph/src/connectivity/components.c	7
/src/igraph/src/core/bitset.c	4
/src/igraph/src/core/dqueue.pmt	9
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	16
/src/igraph/src/graph/iterators.c	21
/src/igraph/src/core/progress.c	1
/src/igraph/src/centrality/coreness.c	1
/src/igraph/src/misc/mixing.c	2
/src/igraph/src/properties/degrees.c	3
/src/igraph/src/properties/multiplicity.c	5
/src/igraph/src/properties/loops.c	3
/src/igraph/src/properties/basic_properties.c	2
/src/igraph/src/misc/graphicality.c	11
/src/igraph/src/misc/degree_sequence.cpp	14
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/paths/unweighted.c	3
/src/igraph/src/paths/distances.c	2
/src/igraph/src/random/random.c	12
/src/igraph/src/graph/visitors.c	3
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/misc/conversion.c	1
/src/igraph/src/flow/st-cuts.c	9
/src/igraph/src/properties/trees.c	1
/src/igraph/src/properties/dag.c	2
/src/igraph/src/misc/spanning_trees.c	7
/src/igraph/src/core/indheap.c	11
/src/igraph/src/internal/qsort.c	4
/src/igraph/vendor/glpk/env/error.c	4
/src/igraph/vendor/glpk/env/env.c	4
/src/igraph/vendor/glpk/env/tls.c	2
/src/igraph/src/internal/glpk_support.c	4
/src/igraph/vendor/glpk/env/dlsup.c	1
/src/igraph/vendor/glpk/env/stdout.c	4
/src/igraph/vendor/glpk/draft/glpapi09.c	12
/src/igraph/vendor/glpk/api/prob1.c	19
/src/igraph/vendor/glpk/env/alloc.c	5
/src/igraph/vendor/glpk/misc/dmp.c	5
/src/igraph/vendor/glpk/misc/avl.c	6
/src/igraph/vendor/glpk/draft/bfd.c	11
/src/igraph/vendor/glpk/bflib/fhvint.c	7
/src/igraph/vendor/glpk/bflib/lufint.c	3
/src/igraph/vendor/glpk/bflib/sva.c	9
/src/igraph/vendor/glpk/bflib/scfint.c	7
/src/igraph/vendor/glpk/bflib/btfint.c	5
/src/igraph/vendor/glpk/draft/glpapi06.c	14
/src/igraph/vendor/glpk/draft/glpios01.c	21
/src/igraph/vendor/glpk/env/time.c	2
/src/igraph/vendor/glpk/env/stdc.c	1
/src/igraph/vendor/glpk/misc/jd.c	2
/src/igraph/vendor/glpk/draft/glpios03.c	16
/src/igraph/vendor/glpk/draft/glpios12.c	4
/src/igraph/vendor/glpk/api/prob5.c	3
/src/igraph/vendor/glpk/api/prob4.c	5
/src/igraph/vendor/glpk/intopt/mirgen.c	21
/src/igraph/vendor/glpk/intopt/spv.c	8
/src/igraph/vendor/glpk/intopt/covgen.c	14
/src/igraph/vendor/glpk/api/prob2.c	12
/src/igraph/vendor/glpk/misc/fvs.c	6
/src/igraph/vendor/glpk/intopt/cfg2.c	2
/src/igraph/vendor/glpk/intopt/cfg1.c	9
/src/igraph/vendor/glpk/intopt/cfg.c	7
/src/igraph/vendor/glpk/draft/glpios02.c	8
/src/igraph/vendor/glpk/draft/glpapi12.c	13
/src/igraph/vendor/glpk/bflib/luf.c	10
/src/igraph/vendor/glpk/bflib/sgf.c	7
/src/igraph/vendor/glpk/bflib/btf.c	7
/src/igraph/vendor/glpk/misc/mc21a.c	1
/src/igraph/vendor/glpk/misc/mc13d.c	1
/src/igraph/vendor/glpk/simplex/spxprim.c	10
/src/igraph/vendor/glpk/simplex/spxprob.c	7
/src/igraph/vendor/glpk/simplex/spxat.c	6
/src/igraph/vendor/glpk/simplex/spxnt.c	8
/src/igraph/vendor/glpk/simplex/spxchuzc.c	7
/src/igraph/vendor/glpk/simplex/spxlp.c	12
/src/igraph/vendor/glpk/bflib/fhv.c	3
/src/igraph/vendor/glpk/bflib/scf.c	11
/src/igraph/vendor/glpk/bflib/ifu.c	6
/src/igraph/vendor/glpk/simplex/spxchuzr.c	5
/src/igraph/vendor/glpk/simplex/spydual.c	12
/src/igraph/vendor/glpk/simplex/spychuzr.c	7
/src/igraph/vendor/glpk/simplex/spychuzc.c	5
/src/igraph/vendor/glpk/npp/npp1.c	21
/src/igraph/vendor/glpk/npp/npp5.c	7
/src/igraph/vendor/glpk/npp/npp2.c	10
/src/igraph/vendor/glpk/npp/npp3.c	20
/src/igraph/vendor/glpk/draft/glpscl.c	13
/src/igraph/vendor/glpk/misc/round2n.c	1
/src/igraph/vendor/glpk/api/advbas.c	2
/src/igraph/vendor/glpk/misc/triang.c	1
/src/igraph/vendor/glpk/misc/gcd.c	2
/src/igraph/vendor/glpk/intopt/fpump.c	2
/src/igraph/vendor/glpk/misc/rng.c	5
/src/igraph/vendor/glpk/misc/rng1.c	2
/src/igraph/vendor/glpk/draft/glpapi13.c	3
/src/igraph/vendor/glpk/proxy/proxy1.c	1
/src/igraph/vendor/glpk/proxy/proxy.c	16
/src/igraph/vendor/glpk/npp/npp4.c	10
/src/igraph/vendor/glpk/draft/glpios09.c	12
/src/igraph/vendor/glpk/draft/glpapi10.c	1
/src/igraph/vendor/glpk/intopt/gmigen.c	2
/src/igraph/vendor/glpk/intopt/gmicut.c	1
/src/igraph/vendor/glpk/misc/ks.c	8
/src/igraph/vendor/glpk/misc/mt1.c	3
/src/igraph/vendor/glpk/intopt/clqcut.c	1
/src/igraph/vendor/glpk/misc/wclique.c	2
/src/igraph/vendor/glpk/misc/wclique1.c	2
/src/igraph/vendor/glpk/draft/glpios11.c	3
/src/igraph/src/paths/eulerian.c	7
/src/igraph/src/graph/../core/typed_list.pmt	10
/src/igraph/src/graph/graph_list.c	2
/src/igraph/src/operators/subgraph.c	4
/src/igraph/src/operators/simplify.c	1
/src/igraph/src/core/fixed_vectorlist.c	2
/src/igraph/src/paths/all_shortest_paths.c	1
/src/igraph/src/operators/add_edge.c	1
/src/igraph/src/operators/rewire.c	2
/src/igraph/src/graph/basic_query.c	1

Fuzzer: read_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	2725	79.2%
gold	[1:9]	7	0.20%
yellow	[10:29]	20	0.58%
greenyellow	[30:49]	1	0.02%
lawngreen	50+	686	19.9%
All colors	3439	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00009	/src/igraph/src/core/error.c:213
12	55	2 : View List ['igraph_vector_append', 'igraph_vector_clear']	12	76	igraph_i_cattribute_get_numeric_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1662
12	55	2 : View List ['igraph_vector_bool_append', 'igraph_vector_bool_clear']	12	76	igraph_i_cattribute_get_bool_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1693
12	55	2 : View List ['igraph_vector_append', 'igraph_vector_clear']	12	76	igraph_i_cattribute_get_numeric_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1755
12	55	2 : View List ['igraph_vector_bool_append', 'igraph_vector_bool_clear']	12	76	igraph_i_cattribute_get_bool_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1818
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 02834	/src/igraph/src/core/error.c:472
2	665	9 : View List ['igraph_trie_get', 'strcmp', 'igraph_vector_ptr_push_back', 'igraph_errorf', 'igraph_error', 'igraph_vector_ptr_size', 'igraph_attribute_record_init', 'igraph_trie_check', 'igraph_vector_ptr_get']	2	706	igraph_i_graphml_add_attribute_key	call site: 00000	/src/igraph/src/io/graphml.c:687
0	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
0	105	1 : View List ['igraph_error']	0	105	igraph_attribute_record_check_type	call site: 00000	/src/igraph/src/graph/attributes.c:264
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_vertex_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1724
0	71	2 : View List ['igraph_strvector_clear', 'igraph_strvector_append']	0	92	igraph_i_cattribute_get_string_edge_attr	call site: 00000	/src/igraph/src/graph/cattributes.c:1786
0	70	1 : View List ['igraph_vector_int_resize']	0	131	igraph_add_vertices	call site: 02912	/src/igraph/src/graph/type_indexededgelist.c:425

Runtime coverage analysis

Covered functions

210

Functions that are reachable but not covered

615

Reachable functions

745

Percentage of reachable functions covered

17.45%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/read_graphml.cpp	1
/src/igraph/src/core/error.c	21
/src/igraph/src/graph/attributes.c	25
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.0/threads.c	9
/src/libxml2-2.14.0/dict.c	21
/src/libxml2-2.14.0/error.c	17
/src/libxml2-2.14.0/xmlmemory.c	1
/src/libxml2-2.14.0/globals.c	21
/src/libxml2-2.14.0/encoding.c	15
/src/libxml2-2.14.0/xpath.c	2
/src/libxml2-2.14.0/xmlIO.c	16
/src/libxml2-2.14.0/catalog.c	33
/src/igraph/src/core/vector.pmt	25
/src/igraph/src/core/vector_ptr.c	7
/src/igraph/src/core/strvector.c	12
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	7
/src/libxml2-2.14.0/parser.c	144
/src/libxml2-2.14.0/parserInternals.c	38
/src/libxml2-2.14.0/SAX2.c	6
/src/libxml2-2.14.0/buf.c	19
/src/libxml2-2.14.0/hash.c	26
/src/libxml2-2.14.0/xmlstring.c	16
/src/libxml2-2.14.0/include/private/memory.h	1
/src/libxml2-2.14.0/tree.c	66
/src/libxml2-2.14.0/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.0/valid.c	40
/src/libxml2-2.14.0/list.c	3
/src/libxml2-2.14.0/xmlregexp.c	4
/src/libxml2-2.14.0/entities.c	10
/src/libxml2-2.14.0/chvalid.c	1
/src/libxml2-2.14.0/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	11
/src/igraph/src/graph/type_indexededgelist.c	12
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/core/printing.c	1
/src/igraph/src/graph/iterators.c	11
/src/igraph/src/graph/type_common.c	1

Fuzzer: misc_algos

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	632	30.3%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	1449	69.6%
All colors	2081	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
564	564	1 : View List ['igraph_i_ecc3_2']	564	564	igraph_ecc	call site: 01031	/src/igraph/src/properties/ecc.c:372
301	301	1 : View List ['igraph_i_random_walk_adjlist']	301	301	igraph_random_walk	call site: 01463	/src/igraph/src/paths/random_walk.c:342
175	193	5 : View List ['igraph_i_attribute_combine_edges', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_fixed_vectorlist_convert', 'igraph_fixed_vectorlist_destroy']	175	281	igraph_to_undirected	call site: 01996	/src/igraph/src/misc/conversion.c:657
81	93	3 : View List ['igraph_error', 'igraph_vector_size', 'igraph_vector_min']	382	688	igraph_random_walk	call site: 01457	/src/igraph/src/paths/random_walk.c:324
42	93	4 : View List ['igraph_error', 'igraph_i_attribute_permute_edges', 'igraph_vector_int_init', 'IGRAPH_FINALLY_REAL']	42	332	igraph_delete_edges	call site: 01860	/src/igraph/src/graph/type_indexededgelist.c:553
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00078	/src/igraph/src/graph/attributes.c:619
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_copy	call site: 01650	/src/igraph/src/graph/attributes.c:638
33	389	4 : View List ['igraph_eit_create', 'igraph_es_destroy', 'igraph_es_all', 'igraph_eit_destroy']	180	1007	igraph_to_undirected	call site: 01938	/src/igraph/src/misc/conversion.c:532
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00106	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00207	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00150	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00087	/src/igraph/src/graph/type_indexededgelist.c:401

Runtime coverage analysis

Covered functions

216

Functions that are reachable but not covered

53

Reachable functions

266

Percentage of reachable functions covered

80.08%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/misc_algos.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	40
/src/igraph/src/random/random.c	14
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	3
/src/igraph/src/graph/type_indexededgelist.c	20
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	8
/src/igraph/src/graph/attributes.c	9
/src/igraph/src/core/vector.c	2
/src/igraph/src/core/typed_list.pmt	28
/src/igraph/src/misc/cycle_bases.c	6
/src/igraph/src/graph/iterators.c	20
/src/igraph/src/connectivity/components.c	3
/src/igraph/src/core/bitset.c	7
/src/igraph/src/core/dqueue.pmt	7
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/adjlist.c	15
/src/igraph/src/core/progress.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/misc/order_cycle.cpp	1
/src/igraph/src/misc/motifs.c	3
/src/igraph/src/core/stack.pmt	10
/src/igraph/src/properties/triangles.c	2
/src/igraph/src/properties/ecc.c	5
/src/igraph/src/connectivity/reachability.c	3
/src/igraph/src/core/bitset_list.c	2
/src/igraph/src/paths/simple_paths.c	1
/src/igraph/src/paths/random_walk.c	4
/src/igraph/src/core/vector_ptr.c	6
/src/igraph/src/operators/subgraph.c	7
/src/igraph/src/operators/reverse.c	1
/src/igraph/src/misc/conversion.c	2
/src/igraph/src/core/fixed_vectorlist.c	2

Fuzzer: bliss

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	187	29.0%
gold	[1:9]	0	0.0%
yellow	[10:29]	0	0.0%
greenyellow	[30:49]	0	0.0%
lawngreen	50+	457	70.9%
All colors	644	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
44	56	3 : View List ['igraph_error', 'igraph_vector_int_size', 'igraph_errorf']	44	56	(anonymousnamespace)::bliss_set_colors(bliss::AbstractGraph*,igraph_vector_int_tconst*)	call site: 00000	/src/igraph/src/isomorphism/bliss.cc:144
42	86	3 : View List ['igraph_error', 'igraph_vector_int_reserve', 'igraph_vector_int_size']	42	86	igraph_vector_int_push_back	call site: 00155	/src/igraph/src/core/vector.pmt:569
42	42	1 : View List ['igraph_error']	42	42	igraph_i_attribute_init	call site: 00075	/src/igraph/src/graph/attributes.c:619
24	123	5 : View List ['igraph_i_attribute_add_vertices', 'IGRAPH_FINALLY_ENTER', 'igraph_error', 'IGRAPH_FINALLY_EXIT', 'igraph_vector_int_resize']	24	149	igraph_add_vertices	call site: 00103	/src/igraph/src/graph/type_indexededgelist.c:421
24	94	3 : View List ['igraph_error', 'igraph_i_attribute_add_edges', 'igraph_vector_int_resize']	24	286	igraph_add_edges	call site: 00204	/src/igraph/src/graph/type_indexededgelist.c:319
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_edges	call site: 00147	/src/igraph/src/graph/type_indexededgelist.c:273
23	23	1 : View List ['igraph_errorf']	23	23	igraph_add_vertices	call site: 00084	/src/igraph/src/graph/type_indexededgelist.c:401
21	21	1 : View List ['igraph_error']	21	21	igraph_vector_int_init	call site: 00010	/src/igraph/src/core/vector.pmt:145
10	10	1 : View List ['igraph_fatal']	10	10	igraph_i_property_cache_set_bool_checked	call site: 00257	/src/igraph/src/graph/caching.c:127
8	8	4 : View List ['std::runtime_error::runtime_error(char const*)', '__cxa_throw', '__cxa_allocate_exception', '__cxa_free_exception']	8	8	(anonymousnamespace)::bliss_from_igraph(igraph_tconst*)	call site: 00000	/src/igraph/src/isomorphism/bliss.cc:83
8	8	4 : View List ['std::runtime_error::runtime_error(char const*)', '__cxa_throw', '__cxa_allocate_exception', '__cxa_free_exception']	8	8	bliss::Digraph::add_edge(unsignedint,unsignedint)	call site: 00000	/src/igraph/src/isomorphism/bliss/graph.cc:1909
8	8	4 : View List ['std::runtime_error::runtime_error(char const*)', '__cxa_throw', '__cxa_allocate_exception', '__cxa_free_exception']	8	8	bliss::Graph::add_edge(unsignedint,unsignedint)	call site: 00000	/src/igraph/src/isomorphism/bliss/graph.cc:3720

Runtime coverage analysis

Covered functions

232

Functions that are reachable but not covered

72

Reachable functions

316

Percentage of reachable functions covered

77.22%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/bliss.cpp	1
/src/igraph/src/core/error.c	16
/src/igraph/src/core/vector.pmt	11
/src/igraph/src/constructors/basic_constructors.c	1
/src/igraph/src/graph/type_common.c	1
/src/igraph/src/graph/type_indexededgelist.c	10
/src/igraph/src/core/memory.c	1
/src/igraph/src/graph/caching.c	7
/src/igraph/src/graph/attributes.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/properties/multiplicity.c	1
/src/igraph/src/core/typed_list.pmt	7
/src/igraph/src/isomorphism/bliss.cc	7
/src/igraph/src/isomorphism/bliss/graph.cc	23
/src/igraph/src/isomorphism/bliss/partition.cc	16
/src/igraph/src/isomorphism/bliss/kstack.hh	6
/src/igraph/src/isomorphism/bliss/kqueue.hh	7
/src/igraph/src/isomorphism/bliss/heap.cc	3
/src/igraph/src/isomorphism/bliss/uintseqhash.hh	5
/src/igraph/src/isomorphism/bliss/orbit.cc	9
/src/igraph/src/isomorphism/bliss/graph.hh	3
/src/igraph/src/isomorphism/bliss/stats.hh	10
/src/igraph/src/isomorphism/bliss/bignum.hh	5
/src/igraph/vendor/mini-gmp/mini-gmp.c	32
/src/igraph/src/isomorphism/bliss/partition.hh	8
/src/igraph/src/isomorphism/bliss/uintseqhash.cc	1
/src/igraph/src/isomorphism/bliss/orbit.hh	1

Fuzzer: write_all_graphml

Call tree

The calltree shows the control flow of the fuzzer. This is overlaid with coverage information to display how much of the potential code a fuzzer can reach is in fact covered at runtime. In the following there is a link to a detailed calltree visualisation as well as a bitmap showing a high-level view of the calltree. For further information about these topics please see the glossary for full calltree and calltree overview

Call tree overview bitmap:

The distribution of callsites in terms of coloring is

Color	Runtime hitcount	Callsite count	Percentage
red	0	3039	56.9%
gold	[1:9]	32	0.59%
yellow	[10:29]	68	1.27%
greenyellow	[30:49]	10	0.18%
lawngreen	50+	2189	41.0%
All colors	5338	100

Fuzz blockers

The followings are the branches where fuzzer fails to bypass.

Unique non-covered Complexity	Unique Reachable Complexities	Unique Reachable Functions	All non-covered Complexity	All Reachable Complexity	Function Name	Function Callsite	Blocked Branch
19	19	1 : View List ['igraph_error_handler_abort']	19	19	igraph_error	call site: 00009	/src/igraph/src/core/error.c:213
14	227	9 : View List ['check_name', 'igraph_strvector_destroy', 'igraph_vss_1', 'igraph_degree_1', 'igraph_strvector_get', 'igraph_strvector_init', 'IGRAPH_FINALLY_REAL', 'igraph_error', 'igraph_i_attribute_get_string_vertex_attr']	14	288	igraph_write_graph_lgl	call site: 04917	/src/igraph/src/io/lgl.c:430
10	14	2 : View List ['igraph_lgl_yyrealloc', 'igraph_fatal']	10	14	yy_get_next_buffer	call site: 03868	/src/igraph/build/src/io/parsers/lgl-lexer.c:1400
6	6	3 : View List ['time', 'strlen', 'ctime']	28	3058	igraph_write_graph_gml	call site: 03526	/src/igraph/src/io/gml.c:952
4	4	1 : View List ['igraph_warning_handler_print']	4	4	igraph_warning	call site: 02834	/src/igraph/src/core/error.c:472
2	665	9 : View List ['igraph_trie_get', 'strcmp', 'igraph_vector_ptr_push_back', 'igraph_errorf', 'igraph_error', 'igraph_vector_ptr_size', 'igraph_attribute_record_init', 'igraph_trie_check', 'igraph_vector_ptr_get']	2	706	igraph_i_graphml_add_attribute_key	call site: 00000	/src/igraph/src/io/graphml.c:687
2	2	1 : View List ['__errno_location']	2	2	igraph_gml_yylex_init_extra	call site: 03835	/src/igraph/build/src/io/parsers/gml-lexer.c:2235
2	2	1 : View List ['__errno_location']	2	2	igraph_lgl_yylex_init_extra	call site: 04952	/src/igraph/build/src/io/parsers/lgl-lexer.c:2169
2	2	1 : View List ['__errno_location']	2	2	igraph_ncol_yylex_init_extra	call site: 05196	/src/igraph/build/src/io/parsers/ncol-lexer.c:2163
0	224	3 : View List ['igraph_strvector_get', 'igraph_strvector_size', 'igraph_trie_get']	14	2216	igraph_read_graph_ncol	call site: 05188	/src/igraph/src/io/ncol.c:130
0	116	2 : View List ['igraph_error', 'igraph_attribute_record_resize']	0	116	igraph_i_cattribute_find_or_create	call site: 00000	/src/igraph/src/graph/cattributes.c:162
0	109	4 : View List ['igraph_vector_bool_init', 'igraph_i_attribute_get_bool_vertex_attr', 'igraph_vector_int_init', 'igraph_vector_bool_destroy']	12	2160	igraph_write_graph_pajek	call site: 04449	/src/igraph/src/io/pajek.c:488

Runtime coverage analysis

Covered functions

345

Functions that are reachable but not covered

646

Reachable functions

920

Percentage of reachable functions covered

29.78%

NB: The sum of covered functions and functions that are reachable but not covered need not be equal to Reachable functions . This is because the reachability analysis is an approximation and thus at runtime some functions may be covered that are not included in the reachability analysis. This is a limitation of our static analysis capabilities.

Function name	source code lines	source lines hit	percentage hit

Files reached

filename	functions hit
/src/igraph/./fuzzing/write_all_graphml.cpp	1
/src/igraph/src/core/error.c	22
/src/igraph/src/graph/attributes.c	27
/src/igraph/src/io/graphml.c	11
/src/libxml2-2.14.0/threads.c	9
/src/libxml2-2.14.0/dict.c	21
/src/libxml2-2.14.0/error.c	17
/src/libxml2-2.14.0/xmlmemory.c	1
/src/libxml2-2.14.0/globals.c	21
/src/libxml2-2.14.0/encoding.c	15
/src/libxml2-2.14.0/xpath.c	2
/src/libxml2-2.14.0/xmlIO.c	16
/src/libxml2-2.14.0/catalog.c	33
/src/igraph/src/core/vector.pmt	37
/src/igraph/src/core/vector_ptr.c	9
/src/igraph/src/core/strvector.c	14
/src/igraph/src/core/memory.c	1
/src/igraph/src/core/trie.c	12
/src/libxml2-2.14.0/parser.c	144
/src/libxml2-2.14.0/parserInternals.c	38
/src/libxml2-2.14.0/SAX2.c	6
/src/libxml2-2.14.0/buf.c	19
/src/libxml2-2.14.0/hash.c	26
/src/libxml2-2.14.0/xmlstring.c	16
/src/libxml2-2.14.0/include/private/memory.h	1
/src/libxml2-2.14.0/tree.c	66
/src/libxml2-2.14.0/HTMLparser.c	2
/usr/include/x86_64-linux-gnu/bits/stdlib-bsearch.h	1
/src/libxml2-2.14.0/valid.c	40
/src/libxml2-2.14.0/list.c	3
/src/libxml2-2.14.0/xmlregexp.c	4
/src/libxml2-2.14.0/entities.c	10
/src/libxml2-2.14.0/chvalid.c	1
/src/libxml2-2.14.0/uri.c	35
/usr/include/x86_64-linux-gnu/sys/stat.h	1
/usr/include/pthread.h	1
/src/igraph/src/core/interruption.c	1
/src/igraph/src/graph/../core/typed_list.pmt	13
/src/igraph/src/graph/type_indexededgelist.c	13
/src/igraph/src/graph/caching.c	4
/src/igraph/src/core/vector.c	1
/src/igraph/src/io/leda.c	1
/src/igraph/src/graph/iterators.c	13
/src/igraph/src/core/printing.c	2
/src/igraph/src/graph/type_common.c	2
/src/igraph/src/io/dot.c	3
/src/igraph/src/io/gml.c	15
/src/igraph/src/math/safe_intop.c	1
/src/igraph/src/internal/qsort.c	4
/src/igraph/src/io/gml-tree.c	16
/src/igraph/build/src/io/parsers/gml-lexer.c	22
/src/igraph/build/src/io/parsers/gml-parser.c	5
/src/igraph/src/io/gml-parser.y	8
/src/igraph/src/io/parse_utils.c	1
/src/igraph/src/io/pajek.c	2
/src/igraph/src/io/lgl.c	4
/src/igraph/build/src/io/parsers/lgl-lexer.c	22
/src/igraph/build/src/io/parsers/lgl-parser.c	5
/src/igraph/src/io/lgl-parser.y	1
/src/igraph/src/io/ncol.c	4
/src/igraph/build/src/io/parsers/ncol-lexer.c	22
/src/igraph/build/src/io/parsers/ncol-parser.c	5
/src/igraph/src/io/ncol-parser.y	1