NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1)}> ~(1)) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 - 1), arg3 -> arg2}> undef7, arg2 -> undef8, arg3 -> undef9}> Fresh variables: undef1, undef4, undef7, undef8, undef9, Undef variables: undef1, undef4, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef7 > 0) /\ (undef4 > 0)> 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1)}> Fresh variables: undef1, undef4, undef7, undef8, undef9, Undef variables: undef1, undef4, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1, arg2 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002299 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000660s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002081s Trying to remove transition: undef1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004213s Time used: 0.004022 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001520s Time used: 4.00129 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005117s Time used: 4.00057 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003637s Time used: 1.00025 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006425s Time used: 0.004645 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.075794s Time used: 1.07578 LOG: SAT solveNonLinear - Elapsed time: 1.082219s Cost: 1; Total time: 1.08043 Quasi-ranking function: 50000 + arg2 New Graphs: Transitions: undef1, arg2 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000380s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001362s Trying to remove transition: undef1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004095s Time used: 0.003997 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001760s Time used: 4.00147 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004306s Time used: 4.00063 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003982s Time used: 1.00047 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006476s Time used: 0.004619 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000541s Time used: 1.00053 LOG: SAT solveNonLinear - Elapsed time: 1.007017s Cost: 1; Total time: 1.00515 Quasi-ranking function: 50000 + 50000*arg1 + arg2 New Graphs: Transitions: undef1, arg2 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000423s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002094s Trying to remove transition: undef1, arg2 -> -1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004100s Time used: 0.003991 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002410s Time used: 4.00208 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004411s Time used: 4.00073 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003598s Time used: 1.00049 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004246s Time used: 4.00216 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.005426s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005484s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: undef1, arg2 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000551s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006962s Time used: 0.006897 LOG: SAT solveNonLinear - Elapsed time: 0.006962s Cost: 0; Total time: 0.006897 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002289s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef1, arg2 -> -1 + arg2, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: > Conditions are reachable! Program does NOT terminate