YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (arg1 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> ~(1)) /\ (arg2 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> (arg1 - 1), arg2 -> (arg1 - 1)}> undef19, arg2 -> undef20}> Fresh variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Undef variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> (arg1 - 1), arg2 -> (arg1 - 1)}> Fresh variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, Undef variables: undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 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 + arg1, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 1, arg2 -> 0, rest remain the same}> 0, arg2 -> 1, rest remain the same}> 1, arg2 -> 0, rest remain the same}> 0, arg2 -> 1, 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.003095 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001322s Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004991s Time used: 0.00486 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000710s Time used: 4.00033 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055912s Time used: 0.043603 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000392s Time used: 1.00036 LOG: SAT solveNonLinear - Elapsed time: 1.056304s Cost: 2; Total time: 1.04397 Failed at location 3: 1 + arg2 <= arg1 Failed at location 3: 1 + arg2 <= arg1 Before Improving: Quasi-invariant at l3: 1 + arg2 <= arg1 Quasi-invariant at l3: 1 <= arg1 + arg2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007624s Remaining time after improvement: 0.997198 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + arg2 <= arg1 Quasi-invariant at l3: 1 <= arg1 + arg2 [ 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, arg2 -> -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 It's unfeasible. Removing transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal 1 + arg2 <= arg1 and entry 0, arg2 -> 1, rest remain the same}> LOG: CALL check - Post:1 + arg2 <= arg1 - Process 1 * Exit transition: 0, arg2 -> 1, rest remain the same}> * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000765s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000895s Calling Safety with literal 1 + arg2 <= arg1 and entry 0, arg2 -> 1, rest remain the same}> LOG: CALL check - Post:1 + arg2 <= arg1 - Process 2 * Exit transition: 0, arg2 -> 1, rest remain the same}> * Postcondition : 1 + arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000615s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000734s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + arg2 <= arg1 , 1 <= arg1 + arg2 , Narrowing transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000423s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001354s Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004640s Time used: 0.004508 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006515s Time used: 0.006294 LOG: SAT solveNonLinear - Elapsed time: 0.006515s Cost: 0; Total time: 0.006294 Termination implied by a set of invariant(s): Invariant at l3: 1 + arg1 <= arg2 [ 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, arg2 -> -1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> New Graphs: INVARIANTS: 3: 1 + arg1 <= arg2 , Quasi-INVARIANTS to narrow Graph: 3: Program Terminates