52.27/26.62 NO 52.27/26.62 52.27/26.62 Solver Timeout: 4 52.27/26.62 Global Timeout: 300 52.27/26.62 Maximum number of concurrent processes: 900 52.27/26.62 ******************************************************************************************* 52.27/26.62 *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** 52.27/26.62 ******************************************************************************************* 52.27/26.62 52.27/26.62 52.27/26.62 List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : 52.27/26.62 52.27/26.62 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 52.27/26.62 + + 52.27/26.62 Init Location: 0 52.27/26.62 Transitions: 52.27/26.62 0, main_n -> ¿functionCall(__VERIFIER_nondet_int), main_i -> 0, main_j -> 1, main_t -> 0}> 52.27/26.62 52.27/26.62 52.27/26.62 52.27/26.62 (main_j + main_i), main_i -> main_j, main_j -> main_t}> 52.27/26.62 52.27/26.62 0}> 52.27/26.62 52.27/26.62 Fresh variables: 52.27/26.62 52.27/26.62 Undef variables: 52.27/26.62 52.27/26.62 Abstraction variables: 52.27/26.62 52.27/26.62 Exit nodes: 52.27/26.62 52.27/26.62 Accepting locations: 52.27/26.62 52.27/26.62 Asserts: 52.27/26.62 52.27/26.62 + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ 52.27/26.62 52.27/26.62 + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ 52.27/26.62 52.27/26.62 + After preprocess (paralelization): ++++++++++++++++++++++++++++++ 52.27/26.62 52.27/26.62 Init Location: 0 52.27/26.62 Transitions: 52.27/26.62 0}> 52.27/26.62 ¿functionCall(__VERIFIER_nondet_int)}> 52.27/26.62 varCall_1, main_i -> 0, main_j -> 1, main_t -> 0}> 52.27/26.62 52.27/26.62 52.27/26.62 52.27/26.62 (main_j + main_i), main_i -> main_j, main_j -> main_t}> 52.27/26.62 52.27/26.62 0}> 52.27/26.62 52.27/26.62 Fresh variables: 52.27/26.62 52.27/26.62 Undef variables: 52.27/26.62 52.27/26.62 Abstraction variables: 52.27/26.62 52.27/26.62 Exit nodes: 52.27/26.62 6, 52.27/26.62 Accepting locations: 52.27/26.62 52.27/26.62 Asserts: 52.27/26.62 52.27/26.62 + + 52.27/26.62 +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ 52.27/26.62 52.27/26.62 52.27/26.62 Function Return and Parameters Information [2 functions]: 52.27/26.62 function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int 52.27/26.62 __VERIFIER_nondet_int__func_return_ [function result] : int 52.27/26.62 function name: main [1 return + 0 parameters] demangled: main 52.27/26.62 main__func_return_ [function result] : int 52.27/26.62 52.27/26.62 52.27/26.62 AST Ident Scanner Information [6 idents]: 52.27/26.62 __VERIFIER_nondet_int | function | [integer, ()] | | 52.27/26.62 main | function | [integer, ()] | 52.27/26.62 n | local variable | integer | | 52.27/26.62 i | local variable | integer | | 52.27/26.62 j | local variable | integer | | 52.27/26.62 t | local variable | integer | | 52.27/26.62 52.27/26.62 Main function: main 52.27/26.62 Preprocessed LLVMGraph 52.27/26.62 Init Location: 0 52.27/26.62 Transitions: 52.27/26.62 52.27/26.62 52.27/26.62 main_j, main_j -> (main_j + main_i)}> 52.27/26.62 main_n), par{main_i -> main_j, main_j -> (main_j + main_i)}> 52.27/26.62 52.27/26.62 Fresh variables: 52.27/26.62 undef2, 52.27/26.62 52.27/26.62 Undef variables: 52.27/26.62 undef2, 52.27/26.62 52.27/26.62 Abstraction variables: 52.27/26.62 52.27/26.62 Exit nodes: 52.27/26.62 6, 52.27/26.62 Accepting locations: 52.27/26.62 52.27/26.62 Asserts: 52.27/26.62 52.27/26.62 ************************************************************* 52.27/26.62 ******************************************************************************************* 52.27/26.62 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 52.27/26.62 ******************************************************************************************* 52.27/26.62 52.27/26.62 Init Location: 0 52.27/26.62 Graph 0: 52.27/26.62 Transitions: 52.27/26.62 Variables: 52.27/26.62 52.27/26.62 Graph 1: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 52.27/26.62 Graph 2: 52.27/26.62 Transitions: 52.27/26.62 Variables: 52.27/26.62 52.27/26.62 Precedence: 52.27/26.62 Graph 0 52.27/26.62 52.27/26.62 Graph 1 52.27/26.62 52.27/26.62 52.27/26.62 Graph 2 52.27/26.62 52.27/26.62 52.27/26.62 Map Locations to Subgraph: 52.27/26.62 ( 0 , 0 ) 52.27/26.62 ( 2 , 1 ) 52.27/26.62 ( 6 , 2 ) 52.27/26.62 52.27/26.62 ******************************************************************************************* 52.27/26.62 ******************************** CHECKING ASSERTIONS ******************************** 52.27/26.62 ******************************************************************************************* 52.27/26.62 52.27/26.62 Proving termination of subgraph 0 52.27/26.62 Proving termination of subgraph 1 52.27/26.62 Checking unfeasibility... 52.27/26.62 Time used: 0.004274 52.27/26.62 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.001349s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.003840s 52.27/26.62 [63419 : 63421] 52.27/26.62 [63419 : 63422] 52.27/26.62 Successful child: 63421 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Ranking function: 3*main_n - main_i - 2*main_j 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.000769s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.003706s 52.27/26.62 [63419 : 63426] 52.27/26.62 [63419 : 63427] 52.27/26.62 Successful child: 63426 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 New Graphs: 52.27/26.62 INVARIANTS: 52.27/26.62 2: main_i <= main_j , 0 <= main_i , 1 <= main_i + main_j , 52.27/26.62 Quasi-INVARIANTS to narrow Graph: 52.27/26.62 2: 52.27/26.62 [63419 : 63431] 52.27/26.62 [63419 : 63432] 52.27/26.62 INVARIANTS: 52.27/26.62 2: 52.27/26.62 Quasi-INVARIANTS to narrow Graph: 52.27/26.62 2: main_j <= main_n + main_i , main_i <= 0 , main_n <= 1 + main_i , 52.27/26.62 Narrowing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: Narrow transition size 3 52.27/26.62 Narrowing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: Narrow transition size 3 52.27/26.62 invGraph after Narrowing: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.004089s 52.27/26.62 Ranking function: 3 - 8*main_i 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.002664s 52.27/26.62 Ranking function: 7 + 6*main_n - 2*main_i - 4*main_j 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.001487s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.011616s 52.27/26.62 [63419 : 63433] 52.27/26.62 [63419 : 63434] 52.27/26.62 Successful child: 63433 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 > It's unfeasible. Removing transition: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.000930s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.004024s 52.27/26.62 [63419 : 63438] 52.27/26.62 [63419 : 63439] 52.27/26.62 Solving with 1 template(s). 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetFirstSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016123s 52.27/26.62 Time used: 0.015422 52.27/26.62 Improving Solution with cost 1 ... 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetNextSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000891s 52.27/26.62 Time used: 1.00081 52.27/26.62 52.27/26.62 LOG: SAT solveNonLinear - Elapsed time: 1.017013s 52.27/26.62 Cost: 1; Total time: 1.01623 52.27/26.62 Termination implied by a set of invariant(s): 52.27/26.62 Invariant at l2: 0 <= main_i 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Quasi-ranking function: 50000 - main_i - main_j 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.000947s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.004274s 52.27/26.62 [63419 : 63443] 52.27/26.62 [63419 : 63444] 52.27/26.62 Solving with 1 template(s). 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetFirstSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017062s 52.27/26.62 Time used: 0.016155 52.27/26.62 Improving Solution with cost 1 ... 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetNextSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000615s 52.27/26.62 Time used: 1.00054 52.27/26.62 52.27/26.62 LOG: SAT solveNonLinear - Elapsed time: 1.017677s 52.27/26.62 Cost: 1; Total time: 1.01669 52.27/26.62 Termination implied by a set of invariant(s): 52.27/26.62 Invariant at l2: 0 <= main_j 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Quasi-ranking function: 50000 - 2*main_n - main_i - main_j 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.001062s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.007688s 52.27/26.62 [63419 : 63449] 52.27/26.62 [63419 : 63450] 52.27/26.62 Solving with 1 template(s). 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetFirstSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017084s 52.27/26.62 Time used: 0.016022 52.27/26.62 Improving Solution with cost 1 ... 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetNextSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000820s 52.27/26.62 Time used: 1.00073 52.27/26.62 52.27/26.62 LOG: SAT solveNonLinear - Elapsed time: 1.017904s 52.27/26.62 Cost: 1; Total time: 1.01675 52.27/26.62 Termination implied by a set of invariant(s): 52.27/26.62 Invariant at l2: 0 <= main_i 52.27/26.62 [ Invariant Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 [ Termination Graph ] 52.27/26.62 Strengthening and disabling transitions... 52.27/26.62 52.27/26.62 LOG: CALL solverLinear in Graph for feasibility 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear in Graph for feasibility 52.27/26.62 Strengthening transition (result): 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Quasi-ranking function: 50000 + main_n - main_i - main_j 52.27/26.62 New Graphs: 52.27/26.62 Transitions: 52.27/26.62 main_j, main_j -> main_i + main_j, rest remain the same}> 52.27/26.62 Variables: 52.27/26.62 main_n, main_i, main_j 52.27/26.62 Checking conditional termination of SCC {l2}... 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.001180s 52.27/26.62 52.27/26.62 LOG: CALL solveLinear 52.27/26.62 52.27/26.62 LOG: RETURN solveLinear - Elapsed time: 0.007997s 52.27/26.62 [63419 : 63454] 52.27/26.62 [63419 : 63455] 52.27/26.62 Solving with 1 template(s). 52.27/26.62 52.27/26.62 LOG: CALL solveNonLinearGetFirstSolution 52.27/26.62 52.27/26.62 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102416s 52.27/26.62 Time used: 4.10104 52.27/26.62 52.27/26.62 [63419 : 63459] 52.27/26.62 [63419 : 63463] 52.27/26.62 Successful child: 63463 52.27/26.62 52.27/26.62 Program does NOT terminate 52.27/26.62 EOF