NO Solver Timeout: 4 Global Timeout: 60 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_i -> ¿functionCall(__VERIFIER_nondet_int)}> main_i}> 0))> 0)> (main_j + 1)}> (main_i + 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}> main_i}> 0)> 0))> (main_j + 1)}> (main_i + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 11, 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, ()] | i | local variable | integer | | j | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: undef2}> 0), par{main_j -> (main_j + 1)}> 0)) /\ ((main_i + 1) < 10), par{main_i -> (main_i + 1), main_j -> (main_i + 1)}> 0)) /\ not(((main_i + 1) < 10)), par{main_i -> (main_i + 1)}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 11, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_j, rest remain the same}> 1 + main_i, main_j -> 1 + main_i, rest remain the same}> Variables: main_j, main_i Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef2, rest remain the same}> Graph 2 1 + main_i, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 1 ) ( 11 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003397 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001255s Ranking function: 8 - main_i New Graphs: Transitions: 1 + main_j, rest remain the same}> Variables: main_j Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000511s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001276s [40127 : 40130] [40127 : 40131] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010216s Time used: 0.009878 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001875s Time used: 1.00109 LOG: SAT solveNonLinear - Elapsed time: 1.012091s Cost: 1; Total time: 1.01097 Termination implied by a set of invariant(s): Invariant at l5: main_i <= main_j [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 1 + main_i, 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): 1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - main_j New Graphs: Transitions: 1 + main_j, rest remain the same}> Variables: main_j Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000512s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001772s [40127 : 40278] [40127 : 40279] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103158s Time used: 4.10179 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef2, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef2, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007400s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.007531s Cannot prove unreachability [40127 : 40458] [40127 : 40464] Successful child: 40458 Program does NOT terminate