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)}> 0))> 0)> 0))> 0)> main_y, main_xtmp -> main_x}> ~(main_xtmp)}> 0)> 0))> = main_y)> = main_y))> (main_xtmp - main_y)}> main_xtmp}> (main_xtmp - main_y)}> main_xtmp}> main_tmp}> 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}> 0)> 0))> 0)> 0))> main_y, main_xtmp -> main_x}> ~(main_xtmp)}> 0)> 0))> = main_y)> = main_y))> (main_xtmp - main_y)}> main_xtmp}> (main_xtmp - main_y)}> main_xtmp}> main_tmp}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 27, 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 [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | tmp | local variable | integer | | xtmp | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef3 > 0) /\ (undef4 > 0) /\ not((main_y < 0)) /\ (undef3 > 0), par{main_tmp -> undef4, main_xtmp -> undef3}> 0) /\ not((undef3 > 0))> 0))> = main_y), par{main_xtmp -> (main_xtmp - main_y)}> = main_y)) /\ (main_xtmp > 0) /\ (main_tmp > 0) /\ (main_xtmp > 0) /\ not((main_xtmp < 0)) /\ (main_tmp > 0), par{main_y -> main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp}> = main_y)) /\ (main_xtmp > 0) /\ not((main_tmp > 0)), par{main_y -> main_xtmp}> = main_y)) /\ not((main_xtmp > 0)), par{main_y -> main_xtmp}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 27, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -main_y + main_xtmp, rest remain the same}> main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp, rest remain the same}> Variables: main_y, main_xtmp, main_tmp Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef4, main_xtmp -> undef3, rest remain the same}> Graph 2 main_xtmp, rest remain the same}> main_xtmp, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 13 , 1 ) ( 27 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003578 Checking conditional termination of SCC {l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000705s Ranking function: -1 + main_y New Graphs: Transitions: -main_y + main_xtmp, rest remain the same}> Variables: main_y, main_xtmp Checking conditional termination of SCC {l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000228s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000680s [4443 : 4445] [4443 : 4446] Successful child: 4445 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_xtmp, main_tmp -> main_xtmp, main_xtmp -> main_tmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> Ranking function: -main_y + main_xtmp New Graphs: INVARIANTS: 13: 1 <= main_y , Quasi-INVARIANTS to narrow Graph: 13: Proving termination of subgraph 2 Analyzing SCC {l27}... No cycles found. Program Terminates