NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> ~(1)) /\ (arg2 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef5, arg2 -> undef6}> 0), par{arg2 -> 0}> 1}> 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16)> 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25)> 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 0) /\ (undef33 < arg2) /\ (arg1 >= undef34)> 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 0) /\ (undef42 < arg2) /\ (arg1 >= undef43)> 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> ~(1)) /\ (arg2 > 1) /\ (undef51 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}> undef54, arg2 -> undef55}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> 0}> ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef1, arg2 -> 1}> ~(1)) /\ (undef55 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef5, arg2 -> 1}> ~(1)) /\ (undef55 > 1) /\ (undef51 > ~(1)) /\ (undef54 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}> 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> undef53, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: undef17, arg2 -> 0, rest remain the same}> undef44, arg2 -> 1, rest remain the same}> undef26, arg2 -> 1, rest remain the same}> undef35, arg2 -> 1, rest remain the same}> undef26, arg2 -> 1, rest remain the same}> undef35, arg2 -> 1, rest remain the same}> undef17, arg2 -> 0, rest remain the same}> undef44, arg2 -> 1, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 -1 + undef51, arg2 -> undef49, rest remain the same}> Graph 2 undef1, arg2 -> 0, rest remain the same}> undef1, arg2 -> 1, rest remain the same}> undef5, arg2 -> 1, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 2 ) ( 5 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002148 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000652s Ranking function: -1 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.02972 Some transition disabled by a set of invariant(s): Invariant at l3: arg2 <= 1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef44, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef17, arg2 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef26, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef35, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef26, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef35, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef17, arg2 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef44, arg2 -> 1, rest remain the same}> Checking unfeasibility... Time used: 0.005434 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002256s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009541s Trying to remove transition: undef44, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009265s Time used: 0.008637 Trying to remove transition: undef35, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009345s Time used: 0.008687 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020449s Time used: 0.01951 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046429s Time used: 0.046421 LOG: SAT solveNonLinear - Elapsed time: 0.066878s Cost: 2; Total time: 0.065931 Failed at location 3: arg2 <= 0 Failed at location 3: arg2 <= 0 Before Improving: Quasi-invariant at l3: arg2 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008973s Remaining time after improvement: 0.994974 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg2 <= 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: undef35, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef44, arg2 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef44, arg2 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef35, arg2 -> 1, rest remain the same}> New Graphs: Calling Safety with literal arg2 <= 0 and entry undef1, arg2 -> 1, rest remain the same}> LOG: CALL check - Post:arg2 <= 0 - Process 1 * Exit transition: undef1, arg2 -> 1, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000905s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001028s Calling Safety with literal arg2 <= 0 and entry undef5, arg2 -> 1, rest remain the same}> LOG: CALL check - Post:arg2 <= 0 - Process 2 * Exit transition: undef5, arg2 -> 1, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000873s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg2 <= 0 , Narrowing transition: undef35, arg2 -> 1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef44, arg2 -> 1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef35, arg2 -> 1, rest remain the same}> undef44, arg2 -> 1, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002060s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009742s Trying to remove transition: undef44, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009441s Time used: 0.008752 Trying to remove transition: undef35, arg2 -> 1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009443s Time used: 0.008739 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004354s Time used: 4.0031 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010300s Time used: 4.00112 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008270s Time used: 1.00078 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025151s Time used: 0.016238 Proving non-termination of subgraph 2 Transitions: undef35, arg2 -> 1, rest remain the same}> undef44, arg2 -> 1, rest remain the same}> Variables: arg1, arg2 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002056s Checking conditional non-termination of SCC {l3}... > No assignment for some undef value. > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 1 <= arg2, Transition: Conditions: 1 <= arg2, Transition: Conditions: 1 <= arg2, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef1, arg2 -> 0, rest remain the same}> Conditions: 1 <= arg2, Transition: undef1, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, Transition: undef5, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, Transition: undef1, arg2 -> 0, rest remain the same}> Conditions: 1 <= arg2, Transition: undef1, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, Transition: undef5, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, Transition: undef1, arg2 -> 0, rest remain the same}> Conditions: 1 <= arg2, Transition: undef1, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, Transition: undef5, arg2 -> 1, rest remain the same}> Conditions: 1 <= arg2, OPEN EXITS: undef1, arg2 -> 1, rest remain the same}> undef5, arg2 -> 1, rest remain the same}> undef1, arg2 -> 1, rest remain the same}> undef5, arg2 -> 1, rest remain the same}> undef1, arg2 -> 1, rest remain the same}> undef5, arg2 -> 1, rest remain the same}> > Conditions are reachable! Program does NOT terminate