/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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)}> = 2))> = 2)> (main_x - 1), main_y -> (main_y + main_x)}> = main_x))> = main_x)> (main_y - 1)}> (main_x - 1), main_y -> (main_y - main_x)}> 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}> = 2)> = 2))> (main_x - 1), main_y -> (main_y + main_x)}> = main_x)> = main_x))> ¿functionCall(__VERIFIER_nondet_int)}> (main_y - 1)}> (main_x - 1), main_y -> (main_y - main_x)}> 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 2), par{main_x -> (undef4 - 1), main_y -> (undef5 + (undef4 - 1))}> = 2)), par{main_x -> undef4, main_y -> undef5}> = main_x) /\ (undef6 = 0) /\ ((main_x - 1) >= 2), par{main_x -> ((main_x - 1) - 1), main_y -> ((main_y - (main_x - 1)) + ((main_x - 1) - 1))}> = main_x) /\ (undef6 = 0) /\ not(((main_x - 1) >= 2)), par{main_x -> (main_x - 1), main_y -> (main_y - (main_x - 1))}> = main_x) /\ (undef6 = 1), par{main_y -> (main_y - 1)}> = main_x)) /\ ((main_x - 1) >= 2), par{main_x -> ((main_x - 1) - 1), main_y -> ((main_y - (main_x - 1)) + ((main_x - 1) - 1))}> = main_x)) /\ not(((main_x - 1) >= 2)), par{main_x -> (main_x - 1), main_y -> (main_y - (main_x - 1))}> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 12, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -2 + main_x, main_y -> -1 + main_y, rest remain the same}> -1 + main_y, rest remain the same}> -2 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 -1 + undef4, main_y -> -1 + undef4 + undef5, rest remain the same}> Graph 2 undef4, main_y -> undef5, rest remain the same}> -1 + main_x, main_y -> 1 - main_x + main_y, rest remain the same}> -1 + main_x, main_y -> 1 - main_x + main_y, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 1 ) ( 12 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007323 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001778s Ranking function: (~(21) / 2) + (~(5) / 2)*main_x + 6*main_y New Graphs: Transitions: -1 + main_y, rest remain the same}> -2 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001325s Ranking function: -2 + (2 / 3)*main_x New Graphs: Transitions: -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000866s Ranking function: -main_x + main_y New Graphs: Proving termination of subgraph 2 Analyzing SCC {l12}... No cycles found. Program Terminates