NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (0 + undef10), ___cil_tmp4_8^0 -> undef10, ___retres3_7^0 -> undef12}> ((0 + (~(1) * d_6^0)) + i_5^0)}> (0 + undef31), ___cil_tmp4_8^0 -> undef31, ___retres3_7^0 -> undef33}> (0 + undef44), ___cil_tmp2_10^0 -> undef44, ___retres1_9^0 -> undef46}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + (~(1) * d_6^0)) + i_5^0)}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002234 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000842s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001376s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004130s Time used: 0.004011 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005999s Time used: 0.005694 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016002s Time used: 0.015998 LOG: SAT solveNonLinear - Elapsed time: 0.022001s Cost: 1; Total time: 0.021692 Failed at location 3: 1 + i_5^0 <= 0 Before Improving: Quasi-invariant at l3: 1 + i_5^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002437s Remaining time after improvement: 0.998484 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + i_5^0 <= 0 [ 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: -d_6^0 + i_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -d_6^0 + i_5^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + i_5^0 <= 0 and entry LOG: CALL check - Post:1 + i_5^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + i_5^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000370s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000442s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + i_5^0 <= 0 , Narrowing transition: -d_6^0 + i_5^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000777s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001414s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003622s Time used: 0.003501 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006445s Time used: 0.006175 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001753s Time used: 4.0015 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004352s Time used: 1.00057 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010033s Time used: 0.006646 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012533s Time used: 0.012515 LOG: SAT solveNonLinear - Elapsed time: 0.022566s Cost: 1; Total time: 0.019161 Termination implied by a set of invariant(s): Invariant at l3: 1 + d_6^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, 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): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000517s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001941s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006440s Time used: 0.006295 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002681s Time used: 4.00249 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005802s Time used: 4.00089 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.026725s Time used: 1.00087 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011335s Time used: 0.008289 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011795s Time used: 0.01179 LOG: SAT solveNonLinear - Elapsed time: 0.023130s Cost: 1; Total time: 0.020079 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + i_5^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, 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): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 - d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002502s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007892s Time used: 0.007738 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003637s Time used: 4.00343 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007020s Time used: 4.00111 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027087s Time used: 1.00096 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012229s Time used: 0.009123 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010587s Time used: 0.010582 LOG: SAT solveNonLinear - Elapsed time: 0.022816s Cost: 1; Total time: 0.019705 Quasi-ranking function: 50000 + d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000744s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002855s Trying to remove transition: -d_6^0 + i_5^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006774s Time used: 0.006613 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002232s Time used: 4.00199 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.716165s Time used: 2.71136 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004760s Time used: 0.992285 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011996s Time used: 0.008466 Proving non-termination of subgraph 1 Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005403s Time used: 0.005296 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016617s Time used: 0.016309 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015316s Time used: 0.015312 LOG: SAT solveNonLinear - Elapsed time: 0.031933s Cost: 1; Total time: 0.031621 Failed at location 3: 1 <= i_5^0 Before Improving: Quasi-invariant at l3: 1 <= i_5^0 Quasi-invariant at l3: d_6^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003955s Remaining time after improvement: 0.998125 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= i_5^0 Quasi-invariant at l3: d_6^0 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= i_5^0, d_6^0 <= 0, OPEN EXITS: (condsUp: d_6^0 <= 0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= i_5^0, d_6^0 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate