NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1, ___cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}> undef9, ___cil_tmp2_6^0 -> undef10, selected_11^0 -> (0 + undef16)}> (0 + undef19), ___cil_tmp6_12^0 -> undef19}> undef24, ___cil_tmp2_6^0 -> undef25, selected_11^0 -> (0 + undef31)}> (1 + retryCount_10^0)}> 4, retryCount_10^0 -> 0, selected_11^0 -> 0}> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + retryCount_10^0), selected_11^0 -> (0 + undef31)}> Fresh variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Undef variables: undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002452 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000842s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002192s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006982s Time used: 0.006792 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001398s Time used: 4.00077 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006105s Time used: 4.00093 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006450s Time used: 1.00076 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013241s Time used: 0.008275 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.011181s Time used: 1.01112 LOG: SAT solveNonLinear - Elapsed time: 1.024422s Cost: 1; Total time: 1.01939 Termination implied by a set of invariant(s): Invariant at l4: 0 <= 1 + retryCount_10^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 + retryCount_10^0, selected_11^0 -> undef31, 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 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Quasi-ranking function: 50000 - retryCount_10^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000648s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002658s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007200s Time used: 0.007029 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002023s Time used: 4.00118 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005799s Time used: 4.00131 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005870s Time used: 1.00062 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015554s Time used: 0.010393 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000994s Time used: 1.00096 LOG: SAT solveNonLinear - Elapsed time: 1.016548s Cost: 1; Total time: 1.01135 Quasi-ranking function: 50000 - retryCount_10^0 + x_5^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000812s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003221s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007899s Time used: 0.007701 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001952s Time used: 4.00136 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005572s Time used: 4.00104 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009381s Time used: 1.00077 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016092s Time used: 0.011147 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.785606s Time used: 0.78559 LOG: SAT solveNonLinear - Elapsed time: 0.801698s Cost: 1; Total time: 0.796737 Quasi-ranking function: 50000 - retryCount_10^0 - x_5^0 New Graphs: Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000883s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003519s Trying to remove transition: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008066s Time used: 0.007868 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.971336s Time used: 0.970717 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000453s Time used: 0.996868 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997380s Time used: 0.993965 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.999695s Time used: 0.994454 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005052s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.005169s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}> Variables: retryCount_10^0, selected_11^0, x_5^0 Checking conditional non-termination of SCC {l4}... > No exit transition to close. Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002637s Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: OPEN EXITS: > Conditions are reachable! Program does NOT terminate