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 -> 1, main_y -> 1}> = 0))> = 0)> (2 * main_x), main_y -> (3 * main_y)}> 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, main_x -> 1, main_y -> 1}> = 0)> = 0))> (2 * main_x), main_y -> (3 * main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: 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: = 0), par{main_x -> (2 * main_x), main_y -> (3 * main_y)}> = 0))> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_x, main_y -> 3*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 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002262 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000512s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001238s [20584 : 20588] [20584 : 20589] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008652s Time used: 0.008338 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035024s Time used: 0.035019 LOG: SAT solveNonLinear - Elapsed time: 0.043676s Cost: 1; Total time: 0.043357 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_x [ 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 -> 3*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 -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 2*main_x, main_y -> 3*main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000503s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001513s [20584 : 20624] [20584 : 20625] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011603s Time used: 0.01116 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000850s Time used: 1.00071 LOG: SAT solveNonLinear - Elapsed time: 1.012453s Cost: 1; Total time: 1.01187 Termination implied by a set of invariant(s): Invariant at l2: 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 -> 3*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 -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000646s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002327s [20584 : 20629] [20584 : 20630] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015059s Time used: 0.014392 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000679s Time used: 1.00052 LOG: SAT solveNonLinear - Elapsed time: 1.015739s Cost: 1; Total time: 1.01491 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 1 + 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 -> 3*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 -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 + main_x - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000648s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003399s [20584 : 20934] [20584 : 20935] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016658s Time used: 0.015847 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004358s Time used: 1.00433 LOG: SAT solveNonLinear - Elapsed time: 1.021016s Cost: 1; Total time: 1.02018 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 1 + 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 -> 3*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 -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003097s [20584 : 21020] [20584 : 21021] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102106s Time used: 4.10104 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044284s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.044412s Cannot prove unreachability [20584 : 21026] [20584 : 21030] Successful child: 21026 Program does NOT terminate