/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef1, devExt_7^0 -> undef11, i_12^0 -> undef12, irp_11^0 -> undef13, loop_count_14^0 -> undef14, loop_max_13^0 -> undef15, lt_50^0 -> (0 + undef36), lt_51^0 -> undef31, nPacketsOld_9^0 -> undef33, nPackets_10^0 -> undef34, request_8^0 -> undef35, tmp_15^0 -> undef36, tmp___0_16^0 -> undef37, tmp___1_17^0 -> undef38, tmp___2_18^0 -> undef39}> (0 + lt_113^0), lt_45^0 -> undef65, lt_46^0 -> undef66, lt_47^0 -> undef67, lt_48^0 -> undef68, lt_49^0 -> undef69, lt_50^0 -> undef70}> undef87}> (0 + lt_113^0), lt_43^0 -> (0 + cnt_187^0), lt_44^0 -> undef147}> undef166}> undef202, lt_38^0 -> (0 + lt_90^0), lt_39^0 -> undef220, lt_40^0 -> undef221, lt_41^0 -> undef222, lt_42^0 -> undef223, lt_43^0 -> undef224}> (0 + undef245), __cil_tmp6_20^0 -> undef245, __retres5_19^0 -> undef248, lt_21^0 -> undef260, lt_45^0 -> undef268, lt_46^0 -> undef269, lt_47^0 -> undef270, lt_48^0 -> undef271, lt_49^0 -> undef272, lt_50^0 -> undef273}> Fresh variables: undef1, undef11, undef12, undef13, undef14, undef15, undef31, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef65, undef66, undef67, undef68, undef69, undef70, undef80, undef81, undef82, undef83, undef84, undef87, undef147, undef166, undef202, undef220, undef221, undef222, undef223, undef224, undef241, undef242, undef243, undef245, undef248, undef260, undef268, undef269, undef270, undef271, undef272, undef273, undef283, undef284, undef285, undef286, undef287, undef288, undef289, Undef variables: undef1, undef11, undef12, undef13, undef14, undef15, undef31, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef65, undef66, undef67, undef68, undef69, undef70, undef80, undef81, undef82, undef83, undef84, undef87, undef147, undef166, undef202, undef220, undef221, undef222, undef223, undef224, undef241, undef242, undef243, undef245, undef248, undef260, undef268, undef269, undef270, undef271, undef272, undef273, undef283, undef284, undef285, undef286, undef287, undef288, undef289, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef87, __disjvr_1^0 -> undef166}> Fresh variables: undef1, undef11, undef12, undef13, undef14, undef15, undef31, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef65, undef66, undef67, undef68, undef69, undef70, undef80, undef81, undef82, undef83, undef84, undef87, undef147, undef166, undef202, undef220, undef221, undef222, undef223, undef224, undef241, undef242, undef243, undef245, undef248, undef260, undef268, undef269, undef270, undef271, undef272, undef273, undef283, undef284, undef285, undef286, undef287, undef288, undef289, Undef variables: undef1, undef11, undef12, undef13, undef14, undef15, undef31, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef65, undef66, undef67, undef68, undef69, undef70, undef80, undef81, undef82, undef83, undef84, undef87, undef147, undef166, undef202, undef220, undef221, undef222, undef223, undef224, undef241, undef242, undef243, undef245, undef248, undef260, undef268, undef269, undef270, undef271, undef272, undef273, undef283, undef284, undef285, undef286, undef287, undef288, undef289, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: Variables: Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef87, __disjvr_1^0 -> undef166, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 7 , 2 ) ( 8 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Analyzing SCC {l8}... No cycles found. Proving termination of subgraph 2 Analyzing SCC {l7}... No cycles found. Program Terminates