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_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_k -> ¿functionCall(__VERIFIER_nondet_int), main_an -> ¿functionCall(__VERIFIER_nondet_int), main_bn -> ¿functionCall(__VERIFIER_nondet_int), main_tk -> ¿functionCall(__VERIFIER_nondet_int)}> = main_i))> = main_i)> = main_j)> = main_j))> = main_i))> = main_i)> = main_j))> = main_j)> = (main_tk + 1)))> = (main_tk + 1))> = main_i))> = main_i)> = main_j)> = main_j))> (main_j + main_k), main_tk -> main_k, main_k -> ¿functionCall(__VERIFIER_nondet_int)}> (main_i + 1)}> = main_i))> = main_i)> (main_i + 1)}> = main_j)> = main_j))> (main_j + main_k), main_tk -> main_k, main_k -> ¿functionCall(__VERIFIER_nondet_int)}> 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_5}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_6}> = main_i)> = main_i))> = main_j)> = main_j))> = main_i)> = main_i))> = main_j)> = main_j))> = (main_tk + 1))> = (main_tk + 1)))> = main_i)> = main_i))> = main_j)> = main_j))> ¿functionCall(__VERIFIER_nondet_int)}> (main_j + main_k), main_tk -> main_k}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_8}> (main_i + 1)}> = main_i)> = main_i))> (main_i + 1)}> = main_j)> = main_j))> (main_j + main_k), main_tk -> main_k}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_9}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 29, 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 [8 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | j | local variable | integer | | k | local variable | integer | | an | local variable | integer | | bn | local variable | integer | | tk | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef16 = 0), par{main_i -> (main_i + 1)}> = main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef16 = 1), par{main_j -> (main_j + main_k), main_k -> undef17, main_tk -> main_k}> = main_i) /\ (main_bn >= main_j) /\ not((main_k >= (main_tk + 1)))> = main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ (main_k >= (main_tk + 1)) /\ (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j), par{main_i -> (main_i + 1)}> = main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ not((main_k >= (main_tk + 1)))> = main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ (main_k >= (main_tk + 1)) /\ not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j), par{main_j -> (main_j + main_k), main_k -> undef18, main_tk -> main_k}> = main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ not((main_k >= (main_tk + 1)))> = main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ not((main_bn >= main_j))> Fresh variables: undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: 29, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 29 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.008344 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002412s Ranking function: -main_i + main_an New Graphs: Transitions: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000800s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003985s [11817 : 11819] [11817 : 11820] Successful child: 11819 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> New Graphs: LOG: CALL check - Post:main_k <= main_tk - Process 1 * Exit transition: * Postcondition : main_k <= main_tk LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000476s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000532s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_k <= main_tk , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002450s Ranking function: -main_i + main_an New Graphs: Transitions: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000973s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004434s [11817 : 11824] [11817 : 11825] Successful child: 11824 [ 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_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j + main_k, main_k -> undef18, main_tk -> main_k, 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_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Ranking function: -main_j + main_bn New Graphs: LOG: CALL check - Post:0 <= main_tk - Process 2 * Exit transition: * Postcondition : 0 <= main_tk LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000434s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000490s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_tk , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> 1 + main_i, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001800s Ranking function: -main_i + main_an New Graphs: Transitions: main_j + main_k, main_k -> undef17, main_tk -> main_k, rest remain the same}> main_j + main_k, main_k -> undef18, main_tk -> main_k, rest remain the same}> Variables: main_i, main_j, main_k, main_an, main_bn, main_tk Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001015s Ranking function: -main_tk New Graphs: Proving termination of subgraph 2 Analyzing SCC {l29}... No cycles found. Program Terminates