NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0}> 0}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0)}> 1}> undef230}> 10}> undef300}> 1}> undef462}> 1}> undef538}> undef658}> undef769}> undef870}> (1 + listen_index^0)}> undef1185}> undef1272}> 0}> 1}> (0 + addrs^0)}> 1}> undef1556}> undef1630, MaxBackends^0 -> undef1631, added^0 -> 0, addrs^0 -> undef1636, listen_index^0 -> 0, one^0 -> 1, ret^0 -> undef1644}> Fresh variables: undef230, undef300, undef462, undef538, undef658, undef769, undef870, undef1185, undef1272, undef1556, undef1630, undef1631, undef1636, undef1644, Undef variables: undef230, undef300, undef462, undef538, undef658, undef769, undef870, undef1185, undef1272, undef1556, undef1630, undef1631, undef1636, undef1644, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + listen_index^0)}> (1 + listen_index^0)}> undef870, tmp___35^0 -> undef769}> (1 + addr^0), fd^0 -> undef870}> (1 + addr^0), fd^0 -> undef870}> Fresh variables: undef230, undef300, undef462, undef538, undef658, undef769, undef870, undef1185, undef1272, undef1556, undef1630, undef1631, undef1636, undef1644, Undef variables: undef230, undef300, undef462, undef538, undef658, undef769, undef870, undef1185, undef1272, undef1556, undef1630, undef1631, undef1636, undef1644, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, added^0, addr_ai_family^0, fd^0, tmp___35^0, MaxListen^0, listen_index^0 Graph 2: Transitions: Variables: Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Graph 3 Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 3 ) ( 8 , 2 ) ( 10 , 1 ) ( 17 , 1 ) ( 24 , 1 ) ( 27 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.264916 Checking conditional termination of SCC {l10, l17, l24, l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010439s Ranking function: -17 + 17*MAXADDR^0 - 17*addr^0 New Graphs: Transitions: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17, l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009615s Ranking function: MaxListen^0 - listen_index^0 New Graphs: Transitions: undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041737s Ranking function: -17 + MAXADDR^0 + 16*MaxListen^0 - addr^0 - 16*listen_index^0 New Graphs: Transitions: undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007006s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.089940s Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.245264s Time used: 0.239449 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.379704s Time used: 0.371316 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.217430s Time used: 0.215739 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.442716s Time used: 0.434351 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040055s Time used: 0.03804 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064347s Time used: 0.05814 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031640s Time used: 0.030206 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070324s Time used: 0.064141 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040171s Time used: 0.03882 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078612s Time used: 0.072429 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040509s Time used: 0.039206 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049457s Time used: 0.043358 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077896s Time used: 0.076643 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.087461s Time used: 0.085857 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.091008s Time used: 0.089342 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079378s Time used: 0.077628 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080674s Time used: 0.078988 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.104283s Time used: 0.102421 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074077s Time used: 0.072335 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080595s Time used: 0.078797 Trying to remove transition: undef870, tmp___35^0 -> undef769, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.081694s Time used: 0.079963 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.178481s Time used: 1.17674 LOG: SAT solveNonLinear - Elapsed time: 1.178481s Cost: 0; Total time: 1.17674 Termination implied by a set of invariant(s): Invariant at l17: 1 + addr^0 <= MAXADDR^0 Invariant at l24: 1 + addr^0 <= MAXADDR^0 Invariant at l27: 1 + addr^0 <= MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef870, tmp___35^0 -> undef769, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, fd^0 -> undef870, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, fd^0 -> undef870, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> Ranking function: MAXADDR^0 - addr^0 New Graphs: INVARIANTS: 17: 1 + addr^0 <= MAXADDR^0 , 24: 1 + addr^0 <= MAXADDR^0 , 27: 1 + addr^0 <= MAXADDR^0 , Quasi-INVARIANTS to narrow Graph: 17: 24: 27: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003786 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * 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.001631s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001691s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 3 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001617s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001674s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 4 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001584s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001643s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 5 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001592s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001651s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 6 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001618s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001675s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 7 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001613s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001671s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 8 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001678s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001742s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 9 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001586s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001643s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 10 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001634s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001690s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 11 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001627s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001683s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 12 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001594s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001651s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 13 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001583s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001639s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef870, tmp___35^0 -> undef769, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef870, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef870, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef870, tmp___35^0 -> undef769, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> 1 + addr^0, fd^0 -> undef870, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.882816s Time used: 0.881837 Improving Solution with cost 62 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001740s Time used: 1.00173 LOG: SAT solveNonLinear - Elapsed time: 1.884555s Cost: 62; Total time: 1.88356 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Failed at location 10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Before Improving: Quasi-invariant at l10: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Quasi-invariant at l17: MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Quasi-invariant at l24: 1 <= 0 Quasi-invariant at l27: MaxListen^0 <= listen_index^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015902s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008191s Remaining time after improvement: 0.983134 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l10: MAXADDR^0 + MaxListen^0 <= 1 + addr^0 + listen_index^0 Quasi-invariant at l17: 2 + MAXADDR^0 + MaxListen^0 <= addr^0 + listen_index^0 Quasi-invariant at l24: 1 <= 0 Quasi-invariant at l27: MaxListen^0 <= listen_index^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:MAXADDR^0 + MaxListen^0 <= 1 + addr^0 + listen_index^0 - Process 14 * Exit transition: * Postcondition : MAXADDR^0 + MaxListen^0 <= 1 + addr^0 + listen_index^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002758s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.002838s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000244s Time used: 4.00011 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012499s Time used: 1.00006 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 7.160383s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: Variables: Checking conditional non-termination of SCC {l8}... > No exit transition to close. Calling reachability with... Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: OPEN EXITS: (condsUp: 2 <= undef462, addr_ai_family^0 = 3) (condsUp: undef462 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef462, addr_ai_family^0 = 3) (condsUp: undef462 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef462, addr_ai_family^0 = 3) (condsUp: undef462 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef462, addr_ai_family^0 = 3) (condsUp: undef462 <= 0, addr_ai_family^0 = 3) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate