NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}> 0, arg2 -> undef11}> ~(1)) /\ (arg2 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (arg1 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19), arg2 -> undef18}> 1), par{arg1 -> (arg1 - 2), arg2 -> undef23}> (arg1 - 2), arg2 -> undef25}> undef26, arg2 -> undef27}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef27 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}> ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef6 > ~(1)) /\ (undef27 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef26 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef27 > 1) /\ (undef15 > ~(1)) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef26 > 0) /\ (undef19 > ~(1)) /\ (undef27 > 1) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 0) /\ (undef26 > 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef20 - (2 * undef21)) >= 0), par{arg1 -> (0 - undef19)}> 0}> 1), par{arg1 -> (arg1 - 2)}> (arg1 - 2)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef11, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef23, undef25, undef26, undef27, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Graph 2: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef6, rest remain the same}> undef6, rest remain the same}> Graph 2 -undef19, rest remain the same}> -undef19, rest remain the same}> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002035 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000497s Ranking function: -1 + (1 / 2)*arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001794 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000275s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000638s Trying to remove transition: -2 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002402s Time used: 0.002323 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004172s Time used: 0.003982 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007033s Time used: 0.00703 LOG: SAT solveNonLinear - Elapsed time: 0.011205s Cost: 2; Total time: 0.011012 Failed at location 4: 0 <= arg1 Failed at location 4: 0 <= arg1 Before Improving: Quasi-invariant at l4: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000916s Remaining time after improvement: 0.999585 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l4: 0 <= arg1 [ 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: -2 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -2 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 0 <= arg1 and entry -undef19, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 1 * Exit transition: -undef19, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000290s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000349s Calling Safety with literal 0 <= arg1 and entry -undef19, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 2 * Exit transition: -undef19, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000295s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000353s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 0 <= arg1 , Narrowing transition: -2 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000188s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000542s Trying to remove transition: -2 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001931s Time used: 0.001868 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001353s Time used: 4.0012 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005263s Time used: 4.00062 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005235s Time used: 1.0005 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005981s Time used: 0.003685 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007189s Time used: 0.007187 LOG: SAT solveNonLinear - Elapsed time: 0.013170s Cost: 1; Total time: 0.010872 Termination implied by a set of invariant(s): Invariant at l4: 1 + arg1 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + arg1, 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 + arg1, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000207s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000594s Trying to remove transition: -2 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002355s Time used: 0.002289 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001794s Time used: 4.00164 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005108s Time used: 4.00094 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004936s Time used: 1.00056 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005596s Time used: 0.003504 Proving non-termination of subgraph 2 Transitions: -2 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l4}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002324s Time used: 0.00221 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.002506s Time used: 0.002504 LOG: SAT solveNonLinear - Elapsed time: 0.004830s Cost: 3; Total time: 0.004714 Failed at location 4: 1 + arg1 <= 0 Failed at location 4: 1 + arg1 <= 0 Failed at location 4: 1 + arg1 <= 0 Before Improving: Quasi-invariant at l4: 1 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000969s Remaining time after improvement: 0.999411 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l4: 1 + arg1 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l4: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -2 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, Transition: Conditions: 1 + arg1 <= 0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef19, rest remain the same}> Conditions: 1 + arg1 <= 0, OPEN EXITS: -undef19, rest remain the same}> -undef19, rest remain the same}> -undef19, rest remain the same}> -undef19, rest remain the same}> -undef19, rest remain the same}> -undef19, rest remain the same}> > Conditions are reachable! Program does NOT terminate