/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: undef1}> (0 + delta_new^0), deltaext^0 -> (0 + deltaext_new^0)}> undef20}> (0 + delta_new^0), deltaext^0 -> (0 + deltaext_new^0)}> (0 + delta^0)}> (0 + delta^0)}> (~(1) + delta^0)}> (1 + delta^0)}> (0 + deltaext^0)}> (0 + deltaext^0)}> (~(1) + deltaext^0)}> (1 + deltaext^0)}> Fresh variables: undef1, undef20, Undef variables: undef1, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef20, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (0 + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef1, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef20, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef1, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef20, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (~(1) + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef1, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef20, delta^0 -> (0 + (0 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef1, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef20, delta^0 -> (0 + (~(1) + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef1, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> undef20, delta^0 -> (0 + (1 + delta^0)), deltaext^0 -> (0 + (1 + deltaext^0))}> Fresh variables: undef1, undef20, Undef variables: undef1, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1, rest remain the same}> undef20, rest remain the same}> undef1, rest remain the same}> undef20, rest remain the same}> undef1, delta^0 -> -1 + delta^0, rest remain the same}> undef20, delta^0 -> -1 + delta^0, rest remain the same}> undef1, delta^0 -> 1 + delta^0, rest remain the same}> undef20, delta^0 -> 1 + delta^0, rest remain the same}> undef1, rest remain the same}> undef20, rest remain the same}> undef1, rest remain the same}> undef20, rest remain the same}> undef1, delta^0 -> -1 + delta^0, rest remain the same}> undef20, delta^0 -> -1 + delta^0, rest remain the same}> undef1, delta^0 -> 1 + delta^0, rest remain the same}> undef20, delta^0 -> 1 + delta^0, rest remain the same}> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef20, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef20, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef1, delta^0 -> -1 + delta^0, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef20, delta^0 -> -1 + delta^0, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef1, delta^0 -> 1 + delta^0, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef20, delta^0 -> 1 + delta^0, deltaext^0 -> -1 + deltaext^0, rest remain the same}> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef20, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef20, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef1, delta^0 -> -1 + delta^0, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef20, delta^0 -> -1 + delta^0, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef1, delta^0 -> 1 + delta^0, deltaext^0 -> 1 + deltaext^0, rest remain the same}> undef20, delta^0 -> 1 + delta^0, deltaext^0 -> 1 + deltaext^0, rest remain the same}> Variables: __disjvr_0^0, delta^0, deltaext^0, wnt^0, wntext^0, __disjvr_1^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.333464 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033881s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 2.009833s [22147 : 22148] [22147 : 22149] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.105193s Time used: 4.10005 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.019701s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.019886s Cannot prove unreachability [22147 : 22261] [22147 : 22262] Successful child: 22261 Program does NOT terminate