5.45/4.34 NO 5.45/4.34 5.45/4.34 Solver Timeout: 4 5.45/4.34 Global Timeout: 300 5.45/4.34 Maximum number of concurrent processes: 900 5.45/4.34 ******************************************************************************************* 5.45/4.34 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 5.45/4.34 ******************************************************************************************* 5.45/4.34 5.45/4.34 5.45/4.34 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 5.45/4.34 5.45/4.34 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 5.45/4.34 + + 5.45/4.34 Init Location: 0 5.45/4.34 Transitions: 5.45/4.34 0, main_c -> ¿functionCall(__VERIFIER_nondet_int), main_x -> ¿functionCall(__VERIFIER_nondet_int)}> 5.45/4.34 5.45/4.34 = 0))> 5.45/4.34 = 0)> 5.45/4.34 (main_x + main_c)}> 5.45/4.34 5.45/4.34 0}> 5.45/4.34 5.45/4.34 Fresh variables: 5.45/4.34 5.45/4.34 Undef variables: 5.45/4.34 5.45/4.34 Abstraction variables: 5.45/4.34 5.45/4.34 Exit nodes: 5.45/4.34 5.45/4.34 Accepting locations: 5.45/4.34 5.45/4.34 Asserts: 5.45/4.34 5.45/4.34 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 5.45/4.34 5.45/4.34 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 5.45/4.34 5.45/4.34 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 5.45/4.34 5.45/4.34 Init Location: 0 5.45/4.34 Transitions: 5.45/4.34 0}> 5.45/4.34 ¿functionCall(__VERIFIER_nondet_int)}> 5.45/4.34 varCall_1}> 5.45/4.34 ¿functionCall(__VERIFIER_nondet_int)}> 5.45/4.34 varCall_2}> 5.45/4.34 5.45/4.34 = 0)> 5.45/4.34 = 0))> 5.45/4.34 (main_x + main_c)}> 5.45/4.34 5.45/4.34 0}> 5.45/4.34 5.45/4.34 Fresh variables: 5.45/4.34 5.45/4.34 Undef variables: 5.45/4.34 5.45/4.34 Abstraction variables: 5.45/4.34 5.45/4.34 Exit nodes: 5.45/4.34 6, 5.45/4.34 Accepting locations: 5.45/4.34 5.45/4.34 Asserts: 5.45/4.34 5.45/4.34 + + 5.45/4.34 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 5.45/4.34 5.45/4.34 5.45/4.34 Function Return and Parameters Information [2 functions]: 5.45/4.34 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 5.45/4.34 __VERIFIER_nondet_int__func_return_ [function result] : int 5.45/4.34 function name: main [1 return + 0 parameters] demangled: main 5.45/4.34 main__func_return_ [function result] : int 5.45/4.34 5.45/4.34 5.45/4.34 AST Ident Scanner Information [4 idents]: 5.45/4.34 __VERIFIER_nondet_int | function | [integer, ()] | | 5.45/4.34 main | function | [integer, ()] | 5.45/4.34 c | local variable | integer | | 5.45/4.34 x | local variable | integer | | 5.45/4.34 5.45/4.34 Main function: main 5.45/4.34 Preprocessed LLVMGraph 5.45/4.34 Init Location: 0 5.45/4.34 Transitions: 5.45/4.34 5.45/4.34 = 0), par{main_x -> (main_x + main_c)}> 5.45/4.34 = 0))> 5.45/4.34 5.45/4.34 Fresh variables: 5.45/4.34 undef3, undef4, 5.45/4.34 5.45/4.34 Undef variables: 5.45/4.34 undef3, undef4, 5.45/4.34 5.45/4.34 Abstraction variables: 5.45/4.34 5.45/4.34 Exit nodes: 5.45/4.34 6, 5.45/4.34 Accepting locations: 5.45/4.34 5.45/4.34 Asserts: 5.45/4.34 5.45/4.34 ************************************************************* 5.45/4.34 ******************************************************************************************* 5.45/4.34 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.45/4.34 ******************************************************************************************* 5.45/4.34 5.45/4.34 Init Location: 0 5.45/4.34 Graph 0: 5.45/4.34 Transitions: 5.45/4.34 Variables: 5.45/4.34 5.45/4.34 Graph 1: 5.45/4.34 Transitions: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 Variables: 5.45/4.34 main_c, main_x 5.45/4.34 5.45/4.34 Graph 2: 5.45/4.34 Transitions: 5.45/4.34 Variables: 5.45/4.34 5.45/4.34 Precedence: 5.45/4.34 Graph 0 5.45/4.34 5.45/4.34 Graph 1 5.45/4.34 5.45/4.34 5.45/4.34 Graph 2 5.45/4.34 5.45/4.34 5.45/4.34 Map Locations to Subgraph: 5.45/4.34 ( 0 , 0 ) 5.45/4.34 ( 2 , 1 ) 5.45/4.34 ( 6 , 2 ) 5.45/4.34 5.45/4.34 ******************************************************************************************* 5.45/4.34 ******************************** CHECKING ASSERTIONS ******************************** 5.45/4.34 ******************************************************************************************* 5.45/4.34 5.45/4.34 Proving termination of subgraph 0 5.45/4.34 Proving termination of subgraph 1 5.45/4.34 Checking unfeasibility... 5.45/4.34 Time used: 0.002005 5.45/4.34 5.45/4.34 Checking conditional termination of SCC {l2}... 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000846s 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.001383s 5.45/4.34 [22595 : 22597] 5.45/4.34 [22595 : 22598] 5.45/4.34 Successful child: 22597 5.45/4.34 [ Invariant Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 5.45/4.34 LOG: CALL solverLinear in Graph for feasibility 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear in Graph for feasibility 5.45/4.34 Strengthening transition (result): 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 [ Termination Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 5.45/4.34 LOG: CALL solverLinear in Graph for feasibility 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear in Graph for feasibility 5.45/4.34 Strengthening transition (result): 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 Ranking function: main_x 5.45/4.34 New Graphs: 5.45/4.34 5.45/4.34 LOG: CALL check - Post:1 + main_c <= 0 - Process 1 5.45/4.34 * Exit transition: 5.45/4.34 * Postcondition : 1 + main_c <= 0 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000485s 5.45/4.34 > Postcondition is not implied! 5.45/4.34 5.45/4.34 LOG: RETURN check - Elapsed time: 0.000577s 5.45/4.34 INVARIANTS: 5.45/4.34 2: 5.45/4.34 Quasi-INVARIANTS to narrow Graph: 5.45/4.34 2: 1 + main_c <= 0 , 5.45/4.34 Narrowing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 5.45/4.34 LOG: Narrow transition size 1 5.45/4.34 invGraph after Narrowing: 5.45/4.34 Transitions: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 Variables: 5.45/4.34 main_c, main_x 5.45/4.34 Checking conditional termination of SCC {l2}... 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000527s 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.001633s 5.45/4.34 [22595 : 22602] 5.45/4.34 [22595 : 22603] 5.45/4.34 Successful child: 22602 5.45/4.34 [ Invariant Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 5.45/4.34 LOG: CALL solverLinear in Graph for feasibility 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear in Graph for feasibility 5.45/4.34 It's unfeasible. Removing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 [ Termination Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 > It's unfeasible. Removing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 New Graphs: 5.45/4.34 5.45/4.34 LOG: CALL check - Post:1 + main_c + main_x <= 0 - Process 2 5.45/4.34 * Exit transition: 5.45/4.34 * Postcondition : 1 + main_c + main_x <= 0 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000575s 5.45/4.34 > Postcondition is not implied! 5.45/4.34 5.45/4.34 LOG: RETURN check - Elapsed time: 0.000676s 5.45/4.34 INVARIANTS: 5.45/4.34 2: 5.45/4.34 Quasi-INVARIANTS to narrow Graph: 5.45/4.34 2: 1 + main_c + main_x <= 0 , 5.45/4.34 Narrowing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 5.45/4.34 LOG: Narrow transition size 1 5.45/4.34 invGraph after Narrowing: 5.45/4.34 Transitions: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 Variables: 5.45/4.34 main_c, main_x 5.45/4.34 Checking conditional termination of SCC {l2}... 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000605s 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.001971s 5.45/4.34 [22595 : 22607] 5.45/4.34 [22595 : 22608] 5.45/4.34 Successful child: 22607 5.45/4.34 [ Invariant Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 5.45/4.34 LOG: CALL solverLinear in Graph for feasibility 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear in Graph for feasibility 5.45/4.34 It's unfeasible. Removing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 [ Termination Graph ] 5.45/4.34 Strengthening and disabling transitions... 5.45/4.34 > It's unfeasible. Removing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 New Graphs: 5.45/4.34 5.45/4.34 LOG: CALL check - Post:1 + main_x <= 0 - Process 3 5.45/4.34 * Exit transition: 5.45/4.34 * Postcondition : 1 + main_x <= 0 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000528s 5.45/4.34 > Postcondition is not implied! 5.45/4.34 5.45/4.34 LOG: RETURN check - Elapsed time: 0.000637s 5.45/4.34 INVARIANTS: 5.45/4.34 2: 5.45/4.34 Quasi-INVARIANTS to narrow Graph: 5.45/4.34 2: 1 + main_x <= 0 , 5.45/4.34 Narrowing transition: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 5.45/4.34 LOG: Narrow transition size 1 5.45/4.34 invGraph after Narrowing: 5.45/4.34 Transitions: 5.45/4.34 main_c + main_x, rest remain the same}> 5.45/4.34 Variables: 5.45/4.34 main_c, main_x 5.45/4.34 Checking conditional termination of SCC {l2}... 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.000625s 5.45/4.34 5.45/4.34 LOG: CALL solveLinear 5.45/4.34 5.45/4.34 LOG: RETURN solveLinear - Elapsed time: 0.001967s 5.45/4.34 [22595 : 22612] 5.45/4.34 [22595 : 22613] 5.45/4.34 Solving with 1 template(s). 5.45/4.34 5.45/4.34 LOG: CALL solveNonLinearGetFirstSolution 5.45/4.34 5.45/4.34 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005413s 5.45/4.34 Time used: 0.005077 5.45/4.34 5.45/4.34 [22595 : 22617] 5.45/4.34 [22595 : 22621] 5.45/4.34 Successful child: 22621 5.45/4.34 5.45/4.34 Program does NOT terminate 5.45/4.34 EOF