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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 1)> 1))> 0))> 0)> ((main_x + main_x) + main_y), main_y -> (main_y - 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}> 1)> 1))> 0)> 0))> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 8, 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: 1)> 1))> 0), par{main_x -> ((main_x + main_x) + main_y), main_y -> (main_y - 1)}> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 8, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002384 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000528s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001561s [36423 : 36425] [36423 : 36426] Successful child: 36425 [ 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: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000422s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000524s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + main_x <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000493s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001685s [36423 : 36430] [36423 : 36431] Successful child: 36430 [ 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: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 2 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000599s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: main_x <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000494s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001686s [36423 : 36435] [36423 : 36436] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009500s Time used: 0.009161 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028642s Time used: 0.028637 LOG: SAT solveNonLinear - Elapsed time: 0.038142s Cost: 1; Total time: 0.037798 Quasi-ranking function: 50000 + main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000556s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002257s [36423 : 36440] [36423 : 36441] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010540s Time used: 0.010076 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026194s Time used: 0.026188 LOG: SAT solveNonLinear - Elapsed time: 0.036734s Cost: 1; Total time: 0.036264 Termination implied by a set of invariant(s): Invariant at l3: 1 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x + main_y, main_y -> -1 + main_y, 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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002517s [36423 : 36445] [36423 : 36446] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011687s Time used: 0.011177 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019318s Time used: 0.019313 LOG: SAT solveNonLinear - Elapsed time: 0.031005s Cost: 1; Total time: 0.03049 Termination implied by a set of invariant(s): Invariant at l3: 0 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x + main_y, main_y -> -1 + main_y, 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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - 2*main_x - main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000757s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003127s [36423 : 36450] [36423 : 36451] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011067s Time used: 0.010488 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030634s Time used: 0.030628 LOG: SAT solveNonLinear - Elapsed time: 0.041701s Cost: 1; Total time: 0.041116 Termination implied by a set of invariant(s): Invariant at l3: 1 <= main_x + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x + main_y, main_y -> -1 + main_y, 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): 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x + main_y New Graphs: Transitions: 2*main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000830s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003865s [36423 : 36455] [36423 : 36456] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013489s Time used: 0.012993 [36423 : 36460] [36423 : 36464] Successful child: 36460 Program does NOT terminate