NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> ((~(1) * arg1) + 1), arg2 -> undef4}> 0) /\ (arg1 < 5), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef6}> 4) /\ (2 > (~(1) * arg1)), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> ((~(1) * arg1) + 1)}> 0) /\ (arg1 < 5), par{arg1 -> ((~(1) * arg1) + 1)}> 4) /\ (2 > (~(1) * arg1)), par{arg1 -> ((~(1) * arg1) - 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 - arg1, rest remain the same}> 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004194 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001020s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022962s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008854s Time used: 0.008664 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008044s Time used: 0.007605 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007559s Time used: 0.007099 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015123s Time used: 0.014675 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049845s Time used: 0.048866 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.265416s Time used: 0.265414 LOG: SAT solveNonLinear - Elapsed time: 0.315262s Cost: 1; Total time: 0.31428 Failed at location 2: arg1 <= 0 Before Improving: Quasi-invariant at l2: arg1 <= 0 Quasi-invariant at l2: 0 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021647s Remaining time after improvement: 0.997696 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 0 Quasi-invariant at l2: 0 <= arg1 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 - arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000697s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000788s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 0 , 0 <= arg1 , Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 - arg1, rest remain the same}> 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000979s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023101s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008037s Time used: 0.007849 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008127s Time used: 0.007629 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007682s Time used: 0.007172 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015416s Time used: 0.014914 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041743s Time used: 0.040726 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.154864s Time used: 0.154853 LOG: SAT solveNonLinear - Elapsed time: 0.196607s Cost: 1; Total time: 0.195579 Failed at location 2: arg1 <= 1 Before Improving: Quasi-invariant at l2: 0 <= arg1 Quasi-invariant at l2: arg1 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022117s Remaining time after improvement: 0.997303 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= arg1 Quasi-invariant at l2: arg1 <= 1 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 - arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 - arg1, rest remain the same}> New Graphs: Transitions: 1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000621s Ranking function: -1 + arg1 New Graphs: Calling Safety with literal arg1 <= 1 and entry LOG: CALL check - Post:arg1 <= 1 - Process 2 * Exit transition: * Postcondition : arg1 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000573s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000670s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= arg1 , arg1 <= 1 , Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 - arg1, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 - arg1, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 - arg1, rest remain the same}> 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001055s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016046s Trying to remove transition: -1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008301s Time used: 0.008115 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008635s Time used: 0.00811 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007332s Time used: 0.00682 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016400s Time used: 0.015866 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.105394s Time used: 0.104251 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.207690s Time used: 0.207692 LOG: SAT solveNonLinear - Elapsed time: 0.313084s Cost: 1; Total time: 0.311943 Failed at location 2: arg1 <= 2 Before Improving: Quasi-invariant at l2: arg1 <= 2 Quasi-invariant at l2: 0 <= 1 + arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.023603s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002307s Remaining time after improvement: 0.994223 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: arg1 <= 3 Quasi-invariant at l2: 0 <= 2 + arg1 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -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 Strengthening transition (result): 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 - arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 - arg1, rest remain the same}> New Graphs: Transitions: 1 - arg1, rest remain the same}> 1 - arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000870s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007923s Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015225s Time used: 0.015054 Trying to remove transition: 1 - arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009096s Time used: 0.008659 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047253s Time used: 0.047003 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.417344s Time used: 0.416672 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003687s Time used: 1.00059 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031826s Time used: 0.025842 Proving non-termination of subgraph 1 Transitions: 1 - arg1, rest remain the same}> 1 - arg1, rest remain the same}> -1 - arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005669s Time used: 0.005567 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000961s Time used: 5.00089 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.009780s Time used: 5.00108 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 0 <= arg1, 2 <= arg1, Transition: Conditions: 1 + arg1 <= 0, arg1 <= 1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 2 <= arg1, Transition: Conditions: 1 + arg1 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate