NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 0) /\ (arg1 > ~(1)) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> 1) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 0) /\ (arg1 > 0) /\ (undef11 > 0), par{arg1 -> undef11, arg2 -> undef12}> 2) /\ (undef14 > 0), par{arg1 -> undef14, arg2 -> undef15}> ~(1)) /\ (undef17 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef17, arg2 -> 1}> 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> undef21, arg2 -> undef22}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef3 > ~(1)) /\ (undef5 <= undef3) /\ (undef7 > 0) /\ (undef3 > ~(1)) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> ~(1)) /\ (undef17 > ~(1)) /\ (undef21 > 0), par{arg1 -> undef17, arg2 -> 1}> 1) /\ (undef8 > ~(1)), par{arg1 -> undef8, arg2 -> undef9}> 0) /\ (arg1 > 0) /\ (undef11 > 0), par{arg1 -> undef11, arg2 -> undef12}> 2) /\ (undef14 > 0), par{arg1 -> undef14, arg2 -> undef15}> 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef21, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: undef8, arg2 -> undef9, rest remain the same}> undef11, arg2 -> undef12, rest remain the same}> undef14, arg2 -> undef15, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef17, arg2 -> 1, rest remain the same}> Graph 2 undef5, arg2 -> undef6, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 2 ) ( 5 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001843 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000567s Ranking function: -1 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.005098 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001183s Ranking function: -8 + 4*arg1 New Graphs: Transitions: undef11, arg2 -> undef12, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000364s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001300s Trying to remove transition: undef11, arg2 -> undef12, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002868s Time used: 0.002756 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006304s Time used: 0.006067 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012358s Time used: 0.012356 LOG: SAT solveNonLinear - Elapsed time: 0.018662s Cost: 1; Total time: 0.018423 Failed at location 4: arg1 <= 0 Before Improving: Quasi-invariant at l4: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002084s Remaining time after improvement: 0.999137 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l4: arg1 <= 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: undef8, arg2 -> undef9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef11, arg2 -> undef12, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef14, arg2 -> undef15, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef11, arg2 -> undef12, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry undef5, arg2 -> undef6, rest remain the same}> LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: undef5, arg2 -> undef6, rest remain the same}> * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000296s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000344s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: arg1 <= 0 , Narrowing transition: undef8, arg2 -> undef9, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef11, arg2 -> undef12, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef14, arg2 -> undef15, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef8, arg2 -> undef9, rest remain the same}> undef11, arg2 -> undef12, rest remain the same}> undef14, arg2 -> undef15, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000970s Ranking function: -8 + 4*arg1 New Graphs: Transitions: undef11, arg2 -> undef12, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000332s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001185s Trying to remove transition: undef11, arg2 -> undef12, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002594s Time used: 0.002514 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005612s Time used: 0.005412 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000687s Time used: 4.0003 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005476s Time used: 1.00031 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009641s Time used: 0.004939 Proving non-termination of subgraph 2 Transitions: undef8, arg2 -> undef9, rest remain the same}> undef11, arg2 -> undef12, rest remain the same}> undef14, arg2 -> undef15, rest remain the same}> Variables: arg1, arg2 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001002s Checking conditional non-termination of SCC {l4}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000508s Time used: 5.00042 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.243358s Time used: 0.234613 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000557s Time used: 1.00055 LOG: SAT solveNonLinear - Elapsed time: 1.243916s Cost: 2; Total time: 1.23517 Failed at location 4: arg1 <= 1 Failed at location 4: 1 <= arg1 Before Improving: Quasi-invariant at l4: arg1 <= 1 Quasi-invariant at l4: 1 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008164s Remaining time after improvement: 0.997606 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005429s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l4: arg1 <= 1 Quasi-invariant at l4: 1 <= arg1 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 It's unfeasible. Removing transition: undef8, arg2 -> undef9, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef11, arg2 -> undef12, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef14, arg2 -> undef15, rest remain the same}> Calling reachability with... Transition: Conditions: arg1 <= 1, 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef5, arg2 -> undef6, rest remain the same}> Conditions: arg1 = 1, OPEN EXITS: undef5, arg2 -> undef6, rest remain the same}> > Conditions are reachable! Program does NOT terminate