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.002257 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000836s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001382s 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.004148s Time used: 0.004027 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006032s Time used: 0.005724 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016130s Time used: 0.016123 LOG: SAT solveNonLinear - Elapsed time: 0.022162s Cost: 1; Total time: 0.021847 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.002438s Remaining time after improvement: 0.998492 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.000358s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000430s 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.000781s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001412s 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.003635s Time used: 0.003514 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006478s Time used: 0.0062 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001827s Time used: 4.00135 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004452s Time used: 1.00047 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010262s Time used: 0.006815 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012688s Time used: 0.012683 LOG: SAT solveNonLinear - Elapsed time: 0.022950s Cost: 1; Total time: 0.019498 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.000526s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001943s 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.006423s Time used: 0.006275 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002818s Time used: 4.00194 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005988s Time used: 4.00099 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027587s Time used: 1.00092 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011570s Time used: 0.008425 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011922s Time used: 0.011917 LOG: SAT solveNonLinear - Elapsed time: 0.023492s Cost: 1; Total time: 0.020342 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.000621s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002490s 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.007932s Time used: 0.007778 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002847s Time used: 4.00237 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007511s Time used: 4.00111 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.027939s Time used: 1.00092 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012512s Time used: 0.009338 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010689s Time used: 0.010684 LOG: SAT solveNonLinear - Elapsed time: 0.023201s Cost: 1; Total time: 0.020022 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.000751s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002902s 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.006812s Time used: 0.006648 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002823s Time used: 4.00215 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.682919s Time used: 2.67736 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004344s Time used: 0.991604 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012183s Time used: 0.008576 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.005458s Time used: 0.00535 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016784s Time used: 0.016474 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015496s Time used: 0.01549 LOG: SAT solveNonLinear - Elapsed time: 0.032280s Cost: 1; Total time: 0.031964 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.004073s Remaining time after improvement: 0.998071 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