NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (0 + x_13^0)}> undef12, rt_11^0 -> (0 + st_17^0)}> undef22, nd_12^0 -> undef24, rv_18^0 -> undef27}> undef43, nd_12^0 -> undef45, rv_18^0 -> (0 + undef52)}> undef53}> undef65}> Fresh variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Undef variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef12}> undef22}> undef53, lt_15^0 -> undef43}> Fresh variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Undef variables: undef12, undef22, undef24, undef27, undef31, undef43, undef45, undef52, undef53, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef12, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00198 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002220s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004692s Time used: 0.004546 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003513s Time used: 0.003126 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008600s Time used: 0.008246 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016937s Time used: 0.016935 LOG: SAT solveNonLinear - Elapsed time: 0.025537s Cost: 1; Total time: 0.025181 Failed at location 2: 1 + y_16^0 <= lt_15^0 Before Improving: Quasi-invariant at l2: 1 + y_16^0 <= lt_15^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002922s Remaining time after improvement: 0.999085 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + y_16^0 <= lt_15^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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> New Graphs: Calling Safety with literal 1 + y_16^0 <= lt_15^0 and entry LOG: CALL check - Post:1 + y_16^0 <= lt_15^0 - Process 1 * Exit transition: * Postcondition : 1 + y_16^0 <= lt_15^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000251s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000279s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + y_16^0 <= lt_15^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef53, lt_15^0 -> undef43, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000532s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002104s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004045s Time used: 0.003891 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003569s Time used: 0.003167 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009623s Time used: 0.009244 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011312s Time used: 0.01131 LOG: SAT solveNonLinear - Elapsed time: 0.020935s Cost: 1; Total time: 0.020554 Failed at location 2: y_16^0 <= lt_15^0 Before Improving: Quasi-invariant at l2: y_16^0 <= lt_15^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002939s Remaining time after improvement: 0.999071 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: y_16^0 <= lt_15^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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, 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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef53, lt_15^0 -> undef43, rest remain the same}> New Graphs: Calling Safety with literal y_16^0 <= lt_15^0 and entry LOG: CALL check - Post:y_16^0 <= lt_15^0 - Process 2 * Exit transition: * Postcondition : y_16^0 <= lt_15^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000276s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000307s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: y_16^0 <= lt_15^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef53, lt_15^0 -> undef43, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002082s Trying to remove transition: undef53, lt_15^0 -> undef43, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004134s Time used: 0.003975 Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003583s Time used: 0.003157 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010957s Time used: 0.010638 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000883s Time used: 4.00024 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003844s Time used: 1.0002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017237s Time used: 0.006944 Proving non-termination of subgraph 1 Transitions: undef22, rest remain the same}> undef53, lt_15^0 -> undef43, rest remain the same}> Variables: lt_15^0, y_16^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000889s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021759s Time used: 0.021528 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.081972s Time used: 0.081964 LOG: SAT solveNonLinear - Elapsed time: 0.103732s Cost: 1; Total time: 0.103492 Failed at location 2: 1 + lt_15^0 <= y_16^0 Before Improving: Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016391s Remaining time after improvement: 0.998551 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002664s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + lt_15^0 <= y_16^0 Constraint over undef '1 + undef22 <= y_16^0' in transition: undef22, rest remain the same}> Constraint over undef 'undef43 <= lt_15^0' in transition: undef53, lt_15^0 -> undef43, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef53, lt_15^0 -> undef43, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + lt_15^0 <= y_16^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + lt_15^0 <= y_16^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate