46.77/21.04 NO 46.77/21.04 46.93/21.04 Solver Timeout: 4 46.93/21.04 Global Timeout: 300 46.93/21.04 Maximum number of concurrent processes: 900 46.93/21.04 ******************************************************************************************* 46.93/21.04 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 46.93/21.04 ******************************************************************************************* 46.93/21.04 46.93/21.04 46.93/21.04 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 46.93/21.04 46.93/21.04 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 46.93/21.04 + + 46.93/21.04 Init Location: 0 46.93/21.04 Transitions: 46.93/21.04 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 46.93/21.04 46.93/21.04 0))> 46.93/21.04 0)> 46.93/21.04 (main_x + main_y), main_y -> (main_y + 1)}> 46.93/21.04 46.93/21.04 0}> 46.93/21.04 46.93/21.04 Fresh variables: 46.93/21.04 46.93/21.04 Undef variables: 46.93/21.04 46.93/21.04 Abstraction variables: 46.93/21.04 46.93/21.04 Exit nodes: 46.93/21.04 46.93/21.04 Accepting locations: 46.93/21.04 46.93/21.04 Asserts: 46.93/21.04 46.93/21.04 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 46.93/21.04 46.93/21.04 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 46.93/21.04 46.93/21.04 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 46.93/21.04 46.93/21.04 Init Location: 0 46.93/21.04 Transitions: 46.93/21.04 0}> 46.93/21.04 ¿functionCall(__VERIFIER_nondet_int)}> 46.93/21.04 varCall_1}> 46.93/21.04 ¿functionCall(__VERIFIER_nondet_int)}> 46.93/21.04 varCall_2}> 46.93/21.04 46.93/21.04 0)> 46.93/21.04 0))> 46.93/21.04 (main_x + main_y), main_y -> (main_y + 1)}> 46.93/21.04 46.93/21.04 0}> 46.93/21.04 46.93/21.04 Fresh variables: 46.93/21.04 46.93/21.04 Undef variables: 46.93/21.04 46.93/21.04 Abstraction variables: 46.93/21.04 46.93/21.04 Exit nodes: 46.93/21.04 6, 46.93/21.04 Accepting locations: 46.93/21.04 46.93/21.04 Asserts: 46.93/21.04 46.93/21.04 + + 46.93/21.04 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 46.93/21.04 46.93/21.04 46.93/21.04 Function Return and Parameters Information [2 functions]: 46.93/21.04 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 46.93/21.04 __VERIFIER_nondet_int__func_return_ [function result] : int 46.93/21.04 function name: main [1 return + 0 parameters] demangled: main 46.93/21.04 main__func_return_ [function result] : int 46.93/21.04 46.93/21.04 46.93/21.04 AST Ident Scanner Information [4 idents]: 46.93/21.04 __VERIFIER_nondet_int | function | [integer, ()] | | 46.93/21.04 main | function | [integer, ()] | 46.93/21.04 x | local variable | integer | | 46.93/21.04 y | local variable | integer | | 46.93/21.04 46.93/21.04 Main function: main 46.93/21.04 Preprocessed LLVMGraph 46.93/21.04 Init Location: 0 46.93/21.04 Transitions: 46.93/21.04 46.93/21.04 0), par{main_x -> (main_x + main_y), main_y -> (main_y + 1)}> 46.93/21.04 0))> 46.93/21.04 46.93/21.04 Fresh variables: 46.93/21.04 undef3, undef4, 46.93/21.04 46.93/21.04 Undef variables: 46.93/21.04 undef3, undef4, 46.93/21.04 46.93/21.04 Abstraction variables: 46.93/21.04 46.93/21.04 Exit nodes: 46.93/21.04 6, 46.93/21.04 Accepting locations: 46.93/21.04 46.93/21.04 Asserts: 46.93/21.04 46.93/21.04 ************************************************************* 46.93/21.04 ******************************************************************************************* 46.93/21.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 46.93/21.04 ******************************************************************************************* 46.93/21.04 46.93/21.04 Init Location: 0 46.93/21.04 Graph 0: 46.93/21.04 Transitions: 46.93/21.04 Variables: 46.93/21.04 46.93/21.04 Graph 1: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 46.93/21.04 Graph 2: 46.93/21.04 Transitions: 46.93/21.04 Variables: 46.93/21.04 46.93/21.04 Precedence: 46.93/21.04 Graph 0 46.93/21.04 46.93/21.04 Graph 1 46.93/21.04 46.93/21.04 46.93/21.04 Graph 2 46.93/21.04 46.93/21.04 46.93/21.04 Map Locations to Subgraph: 46.93/21.04 ( 0 , 0 ) 46.93/21.04 ( 2 , 1 ) 46.93/21.04 ( 6 , 2 ) 46.93/21.04 46.93/21.04 ******************************************************************************************* 46.93/21.04 ******************************** CHECKING ASSERTIONS ******************************** 46.93/21.04 ******************************************************************************************* 46.93/21.04 46.93/21.04 Proving termination of subgraph 0 46.93/21.04 Proving termination of subgraph 1 46.93/21.04 Checking unfeasibility... 46.93/21.04 Time used: 0.001998 46.93/21.04 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000709s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.001660s 46.93/21.04 [63253 : 63255] 46.93/21.04 [63253 : 63256] 46.93/21.04 Successful child: 63255 46.93/21.04 [ Invariant Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 It's unfeasible. Removing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 [ Termination Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 > It's unfeasible. Removing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 New Graphs: 46.93/21.04 46.93/21.04 LOG: CALL check - Post:1 + main_x <= 0 - Process 1 46.93/21.04 * Exit transition: 46.93/21.04 * Postcondition : 1 + main_x <= 0 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000477s 46.93/21.04 > Postcondition is not implied! 46.93/21.04 46.93/21.04 LOG: RETURN check - Elapsed time: 0.000565s 46.93/21.04 INVARIANTS: 46.93/21.04 2: 46.93/21.04 Quasi-INVARIANTS to narrow Graph: 46.93/21.04 2: 1 + main_x <= 0 , 46.93/21.04 Narrowing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 46.93/21.04 LOG: Narrow transition size 1 46.93/21.04 invGraph after Narrowing: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000676s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.001783s 46.93/21.04 [63253 : 63260] 46.93/21.04 [63253 : 63261] 46.93/21.04 Successful child: 63260 46.93/21.04 [ Invariant Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 It's unfeasible. Removing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 [ Termination Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 > It's unfeasible. Removing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 New Graphs: 46.93/21.04 46.93/21.04 LOG: CALL check - Post:main_x <= 0 - Process 2 46.93/21.04 * Exit transition: 46.93/21.04 * Postcondition : main_x <= 0 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000542s 46.93/21.04 > Postcondition is not implied! 46.93/21.04 46.93/21.04 LOG: RETURN check - Elapsed time: 0.000636s 46.93/21.04 INVARIANTS: 46.93/21.04 2: 46.93/21.04 Quasi-INVARIANTS to narrow Graph: 46.93/21.04 2: main_x <= 0 , 46.93/21.04 Narrowing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 46.93/21.04 LOG: Narrow transition size 1 46.93/21.04 invGraph after Narrowing: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000683s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.001764s 46.93/21.04 [63253 : 63265] 46.93/21.04 [63253 : 63266] 46.93/21.04 Successful child: 63265 46.93/21.04 [ Invariant Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 [ Termination Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Ranking function: main_x 46.93/21.04 New Graphs: 46.93/21.04 46.93/21.04 LOG: CALL check - Post:main_x + main_y <= 0 - Process 3 46.93/21.04 * Exit transition: 46.93/21.04 * Postcondition : main_x + main_y <= 0 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000511s 46.93/21.04 > Postcondition is not implied! 46.93/21.04 46.93/21.04 LOG: RETURN check - Elapsed time: 0.000621s 46.93/21.04 INVARIANTS: 46.93/21.04 2: 46.93/21.04 Quasi-INVARIANTS to narrow Graph: 46.93/21.04 2: main_x + main_y <= 0 , 46.93/21.04 Narrowing transition: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 46.93/21.04 LOG: Narrow transition size 1 46.93/21.04 invGraph after Narrowing: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000584s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.001982s 46.93/21.04 [63253 : 63270] 46.93/21.04 [63253 : 63271] 46.93/21.04 Solving with 1 template(s). 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetFirstSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006895s 46.93/21.04 Time used: 0.006501 46.93/21.04 Improving Solution with cost 1 ... 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetNextSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016385s 46.93/21.04 Time used: 0.016378 46.93/21.04 46.93/21.04 LOG: SAT solveNonLinear - Elapsed time: 0.023280s 46.93/21.04 Cost: 1; Total time: 0.022879 46.93/21.04 Quasi-ranking function: 50000 - main_y 46.93/21.04 New Graphs: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000633s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.002702s 46.93/21.04 [63253 : 63275] 46.93/21.04 [63253 : 63276] 46.93/21.04 Solving with 1 template(s). 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetFirstSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008691s 46.93/21.04 Time used: 0.008222 46.93/21.04 Improving Solution with cost 1 ... 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetNextSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014886s 46.93/21.04 Time used: 0.01488 46.93/21.04 46.93/21.04 LOG: SAT solveNonLinear - Elapsed time: 0.023576s 46.93/21.04 Cost: 1; Total time: 0.023102 46.93/21.04 Termination implied by a set of invariant(s): 46.93/21.04 Invariant at l2: 0 <= main_x 46.93/21.04 [ Invariant Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 [ Termination Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Quasi-ranking function: 50000 - 2*main_x + 50001*main_y 46.93/21.04 New Graphs: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000773s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.006406s 46.93/21.04 [63253 : 63280] 46.93/21.04 [63253 : 63281] 46.93/21.04 Solving with 1 template(s). 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetFirstSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010576s 46.93/21.04 Time used: 0.010082 46.93/21.04 Improving Solution with cost 1 ... 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetNextSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020013s 46.93/21.04 Time used: 0.020007 46.93/21.04 46.93/21.04 LOG: SAT solveNonLinear - Elapsed time: 0.030589s 46.93/21.04 Cost: 1; Total time: 0.030089 46.93/21.04 Termination implied by a set of invariant(s): 46.93/21.04 Invariant at l2: 0 <= 1 + main_x 46.93/21.04 [ Invariant Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 [ Termination Graph ] 46.93/21.04 Strengthening and disabling transitions... 46.93/21.04 46.93/21.04 LOG: CALL solverLinear in Graph for feasibility 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear in Graph for feasibility 46.93/21.04 Strengthening transition (result): 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Quasi-ranking function: 50000 - main_x 46.93/21.04 New Graphs: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000889s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.004810s 46.93/21.04 [63253 : 63286] 46.93/21.04 [63253 : 63287] 46.93/21.04 Solving with 1 template(s). 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetFirstSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009243s 46.93/21.04 Time used: 0.008653 46.93/21.04 Improving Solution with cost 1 ... 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetNextSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017416s 46.93/21.04 Time used: 0.01741 46.93/21.04 46.93/21.04 LOG: SAT solveNonLinear - Elapsed time: 0.026659s 46.93/21.04 Cost: 1; Total time: 0.026063 46.93/21.04 Quasi-ranking function: 50000 - main_x - main_y 46.93/21.04 New Graphs: 46.93/21.04 Transitions: 46.93/21.04 main_x + main_y, main_y -> 1 + main_y, rest remain the same}> 46.93/21.04 Variables: 46.93/21.04 main_x, main_y 46.93/21.04 Checking conditional termination of SCC {l2}... 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.000741s 46.93/21.04 46.93/21.04 LOG: CALL solveLinear 46.93/21.04 46.93/21.04 LOG: RETURN solveLinear - Elapsed time: 0.004170s 46.93/21.04 [63253 : 63291] 46.93/21.04 [63253 : 63292] 46.93/21.04 Solving with 1 template(s). 46.93/21.04 46.93/21.04 LOG: CALL solveNonLinearGetFirstSolution 46.93/21.04 46.93/21.04 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010695s 46.93/21.04 Time used: 0.01022 46.93/21.04 46.93/21.04 [63253 : 63296] 46.93/21.04 [63253 : 63300] 46.93/21.04 Successful child: 63296 46.93/21.04 46.93/21.04 Program does NOT terminate 46.93/21.04 EOF