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}> ~(1)) /\ (arg2 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}> (arg1 - 1), arg2 -> undef21}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}> undef24, arg2 -> undef25}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> (arg1 - 1)}> 0), par{arg1 -> (arg1 - 1)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef6, rest remain the same}> -undef17, rest remain the same}> undef6, rest remain the same}> -undef17, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002712 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000602s Ranking function: -1 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000250s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000748s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002313s Time used: 0.002221 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004353s Time used: 0.004149 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008706s Time used: 0.008704 LOG: SAT solveNonLinear - Elapsed time: 0.013059s Cost: 2; Total time: 0.012853 Failed at location 3: 0 <= arg1 Failed at location 3: 0 <= arg1 Before Improving: Quasi-invariant at l3: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001430s Remaining time after improvement: 0.999314 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 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: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 0 <= arg1 and entry -undef17, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 1 * Exit transition: -undef17, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000300s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000360s Calling Safety with literal 0 <= arg1 and entry -undef17, rest remain the same}> LOG: CALL check - Post:0 <= arg1 - Process 2 * Exit transition: -undef17, rest remain the same}> * Postcondition : 0 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000274s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000336s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 0 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000183s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000540s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001638s Time used: 0.001574 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000964s Time used: 4.00081 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002965s Time used: 4.00051 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004518s Time used: 1.00046 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005084s Time used: 0.002785 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004435s Time used: 0.004423 LOG: SAT solveNonLinear - Elapsed time: 0.009519s Cost: 1; Total time: 0.007208 Termination implied by a set of invariant(s): Invariant at l3: arg1 <= 1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + 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): -1 + arg1, rest remain the same}> Quasi-ranking function: 50000 + arg1 New Graphs: Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000202s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000579s Trying to remove transition: -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001710s Time used: 0.001644 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001977s Time used: 4.0018 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004874s Time used: 4.00066 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008174s Time used: 1.00065 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004981s Time used: 0.0027 Proving non-termination of subgraph 1 Transitions: -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002678s Time used: 0.002553 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.002594s Time used: 0.002592 LOG: SAT solveNonLinear - Elapsed time: 0.005273s Cost: 4; Total time: 0.005145 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Failed at location 3: 1 + arg1 <= 0 Before Improving: Quasi-invariant at l3: 1 + arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000982s Remaining time after improvement: 0.999478 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + arg1 <= 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): -1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + arg1 <= 0, 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: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: undef6, rest remain the same}> Conditions: 1 + arg1 <= 0, Transition: -undef17, rest remain the same}> Conditions: 1 + arg1 <= 0, OPEN EXITS: -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> -undef17, rest remain the same}> > Conditions are reachable! Program does NOT terminate