/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> 0))> 0)> 0))> 0)> main_x)> main_x))> main_z, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_z -> (main_x - 1)}> (main_z - 1), main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> (main_x - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> 0)> 0))> 0)> 0))> 0)> 0))> main_x)> main_x))> main_z}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4, main_z -> (main_x - 1)}> (main_z - 1)}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_5, main_y -> (main_x - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 12, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_y > 0) /\ (main_z > 0) /\ (main_y > main_x), par{main_x -> undef9, main_y -> main_z, main_z -> (undef9 - 1)}> 0) /\ (main_y > 0) /\ (main_z > 0) /\ not((main_y > main_x)), par{main_x -> undef10, main_y -> (undef10 - 1), main_z -> (main_z - 1)}> 0) /\ (main_y > 0) /\ not((main_z > 0))> 0) /\ not((main_y > 0))> 0))> Fresh variables: undef6, undef7, undef8, undef9, undef10, Undef variables: undef6, undef7, undef8, undef9, undef10, Abstraction variables: Exit nodes: 12, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef9, main_y -> main_z, main_z -> -1 + undef9, rest remain the same}> undef10, main_y -> -1 + undef10, main_z -> -1 + main_z, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 12 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004758 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001458s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013116s [61075 : 61076] [61075 : 61077] Successful child: 61077 Ranking function: main_z Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: undef9, main_y -> main_z, main_z -> -1 + undef9, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001170s Ranking function: -1 + (~(1) / 2)*main_x + (1 / 2)*main_y + (1 / 2)*main_z New Graphs: Proving termination of subgraph 2 Analyzing SCC {l12}... No cycles found. Program Terminates