NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg1 > 0) /\ (undef2 > 1), par{arg1 -> (arg2 - 1), arg2 -> undef2, arg3 -> arg2}> 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> undef16, arg2 -> undef17, arg3 -> undef18}> Fresh variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef16 > 0) /\ (undef2 > 1)> 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Graph 2 undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> undef10, arg2 -> undef11, arg3 -> 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.003817 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003370s Trying to remove transition: -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010350s Time used: 0.010121 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010527s Time used: 0.010081 LOG: SAT solveNonLinear - Elapsed time: 0.010527s Cost: 0; Total time: 0.010081 Termination implied by a set of invariant(s): Invariant at l2: 1 + arg1 <= arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> undef5, arg3 -> 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 Strengthening transition (result): -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> Ranking function: -arg1 + 2*arg3 New Graphs: INVARIANTS: 2: 1 + arg1 <= arg3 , Quasi-INVARIANTS to narrow Graph: 2: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002597 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000838s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002158s Trying to remove transition: undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005639s Time used: 0.005501 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011598s Time used: 0.011202 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001436s Time used: 4.00042 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003760s Time used: 1.00018 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015642s Time used: 0.007862 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000854s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000989s LOG: NarrowEntry size 1 Narrowing transition: -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> END GRAPH: EXIT: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014703s Time used: 0.01451 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028217s Time used: 0.028208 LOG: SAT solveNonLinear - Elapsed time: 0.042919s Cost: 51; Total time: 0.042718 Failed at location 2: arg3 <= 0 Before Improving: Quasi-invariant at l2: arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002044s Remaining time after improvement: 0.998812 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l2: arg3 <= 0 LOG: NEXT CALL check - disable LOG: CALL check - Post:arg3 <= 0 - Process 3 * Exit transition: * Postcondition : arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001034s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001179s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118767s Time used: 0.118531 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000448s Time used: 1.00033 LOG: SAT solveNonLinear - Elapsed time: 1.119215s Cost: 51; Total time: 1.11886 Failed at location 2: arg1 + arg3 <= 0 Before Improving: Quasi-invariant at l2: arg3 <= 1 + arg1 Quasi-invariant at l2: arg1 + arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005900s Remaining time after improvement: 0.997968 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l2: arg3 <= 1 + arg1 Quasi-invariant at l2: arg1 + arg3 <= 0 LOG: NEXT CALL check - disable LOG: CALL check - Post:arg1 + arg3 <= 0 - Process 4 * Exit transition: * Postcondition : arg1 + arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001196s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001351s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000253s Time used: 1.00002 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 2.185232s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016749s Time used: 0.016643 LOG: SAT solveNonLinear - Elapsed time: 0.016749s Cost: 0; Total time: 0.016643 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003534s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg1 Constraint over undef '1 <= undef13' in transition: undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> Conditions: 1 <= arg1, Transition: undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> Conditions: 1 <= arg1, Transition: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> Conditions: 1 <= arg1, Transition: undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> Conditions: 1 <= arg1, OPEN EXITS: undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> (condsUp: 1 <= undef7, 1 <= undef7) undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> (condsUp: 3 <= undef10, 1 <= undef10) undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> (condsUp: 1 <= undef7, 1 <= undef7) undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> (condsUp: 3 <= undef10, 1 <= undef10) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg2, arg3 <= 0, 1 <= undef7, 1 <= undef7, Transition: Conditions: undef10 <= 1 + arg2, arg3 <= 0, 2 <= arg2, 3 <= undef10, 1 <= undef10, Transition: Conditions: 1 <= arg2, arg3 <= 0, 1 <= undef7, 1 <= undef7, Transition: Conditions: undef10 <= 1 + arg2, arg3 <= 0, 2 <= arg2, 3 <= undef10, 1 <= undef10, OPEN EXITS: > Conditions are reachable! Program does NOT terminate