NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (~(1) + j^0), temp^0 -> undef9}> (1 + i^0)}> (0 + i^0)}> 2}> Fresh variables: undef9, Undef variables: undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + 2)}> (~(1) + j^0)}> (1 + i^0)}> (1 + i^0), j^0 -> (0 + (1 + i^0))}> Fresh variables: undef9, Undef variables: undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}> Variables: j^0, i^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 2, rest remain the same}> Graph 2 1 + i^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006296 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000658s Ranking function: 9 - i^0 New Graphs: Transitions: -1 + j^0, rest remain the same}> Variables: j^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000282s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000588s Trying to remove transition: -1 + j^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001907s Time used: 0.001824 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004674s Time used: 0.004534 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000966s Time used: 4.00068 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003041s Time used: 1.0003 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007778s Time used: 0.005025 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008632s Time used: 0.00863 LOG: SAT solveNonLinear - Elapsed time: 0.016410s Cost: 1; Total time: 0.013655 Termination implied by a set of invariant(s): Invariant at l3: 1 <= i^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + j^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, j^0 -> 1 + i^0, 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 + j^0, rest remain the same}> Quasi-ranking function: 50000 + j^0 New Graphs: Transitions: -1 + j^0, rest remain the same}> Variables: j^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000239s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000759s Trying to remove transition: -1 + j^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.001849s Time used: 0.001781 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001643s Time used: 4.00149 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005828s Time used: 4.00077 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005501s Time used: 1.00031 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005156s Time used: 4.00179 Termination failed. Trying to show unreachability... Proving unreachability of entry: 2, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: 2, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005389s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005444s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: -1 + j^0, rest remain the same}> 1 + i^0, j^0 -> 1 + i^0, rest remain the same}> Variables: j^0, i^0 Checking conditional non-termination of SCC {l3}... > No exit transition to close. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: 2, rest remain the same}> Conditions: OPEN EXITS: 2, rest remain the same}> > Conditions are reachable! Program does NOT terminate