/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef3}> (1 + undef7)}> (~(1) + undef12)}> Fresh variables: undef3, undef7, undef12, Undef variables: undef3, undef7, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + undef7)}> (~(1) + undef12)}> Fresh variables: undef3, undef7, undef12, Undef variables: undef3, undef7, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + undef7, rest remain the same}> -1 + undef12, rest remain the same}> Variables: x_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002192 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000831s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002408s [48453 : 48454] [48453 : 48455] Successful child: 48454 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + undef7, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef12, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + undef7, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef12, rest remain the same}> New Graphs: [48453 : 48459] [48453 : 48460] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: x_5^0 <= 0 , 0 <= x_5^0 , Narrowing transition: 1 + undef7, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + undef12, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 1 + undef7, rest remain the same}> -1 + undef12, rest remain the same}> Variables: x_5^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000848s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002488s [48453 : 48461] [48453 : 48462] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008591s Time used: 0.008268 [48453 : 48474] [48453 : 48478] Successful child: 48478 Program does NOT terminate