/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 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.556931 Checking conditional termination of SCC {l10, l17, l24, l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021598s 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.021187s 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.090294s 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.015301s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.195732s [63289 : 63792] [63289 : 63793] Successful child: 63792 [ 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 + MaxListen^0 - addr^0 - listen_index^0 New Graphs: INVARIANTS: 17: 1 + addr^0 + listen_index^0 <= MAXADDR^0 + MaxListen^0 , 24: 1 + addr^0 + listen_index^0 <= MAXADDR^0 + MaxListen^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.002297 > 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 [63289 : 64847] [63289 : 64848] [63289 : 64849] [63289 : 64850] [63289 : 64852] [63289 : 64853] [63289 : 64855] [63289 : 64857] [63289 : 64861] [63289 : 64863] [63289 : 64864] [63289 : 64865] 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 [63289 : 64943] [63289 : 64944] [63289 : 64946] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.455613s Cannot prove unreachability [63289 : 1089] [63289 : 1094] Successful child: 1089 Program does NOT terminate