/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0}> 1}> 1}> (1 + nj^0)}> (0 + tmp___2^0)}> 1}> 0}> 0}> 0}> (0 + tmp___1^0)}> 1}> 0}> 0}> (1 + ni^0)}> (0 + tmp___0^0), nj^0 -> 0}> 1}> 0}> 0}> 0}> 0}> (1 + ni^0)}> 1, bNoCapture^0 -> 1, nDim^0 -> (0 + __const_9^0), ni^0 -> 0, tmp^0 -> undef535}> Fresh variables: undef535, Undef variables: undef535, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + ni^0)}> (1 + ni^0)}> (1 + ni^0)}> (1 + ni^0)}> (1 + ni^0)}> (1 + ni^0)}> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 1), ni^0 -> (1 + ni^0), nj^0 -> 0}> (0 + 0), ni^0 -> (1 + ni^0), nj^0 -> 0}> (1 + nj^0)}> (0 + 0)}> (0 + 0)}> 0}> 0}> 0}> 0}> 0}> 0}> 0}> (0 + 0), ni^0 -> 0, nj^0 -> 0}> (0 + 0), ni^0 -> 0, nj^0 -> 0}> (0 + 1), ni^0 -> 0, nj^0 -> 0}> (0 + 0), ni^0 -> 0, nj^0 -> 0}> (0 + 0), ni^0 -> 0, nj^0 -> 0}> (0 + 1), ni^0 -> 0, nj^0 -> 0}> (0 + 0), ni^0 -> 0, nj^0 -> 0}> (1 + ni^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1)}> (0 + 0)}> (0 + 1)}> Fresh variables: undef535, Undef variables: undef535, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + ni^0, rest remain the same}> Variables: nDim^0, ni^0 Graph 2: Transitions: 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> 1 + nj^0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> Variables: bDomain^0, nDim^0, ni^0, nj^0, bNoCapture^0 Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 1, ni^0 -> 0, nj^0 -> 0, rest remain the same}> 0, ni^0 -> 0, nj^0 -> 0, rest remain the same}> Graph 3 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 1 + ni^0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 3 ) ( 7 , 2 ) ( 9 , 1 ) ( 14 , 2 ) ( 17 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001819 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001032s Ranking function: -1 + nDim^0 - ni^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.405176 Some transition disabled by a set of invariant(s): Invariant at l14: 0 <= bNoCapture^0 Invariant at l17: nj^0 <= nDim^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> 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): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> Checking unfeasibility... Time used: 0.361532 Some transition disabled by a set of invariant(s): Invariant at l7: 0 <= bDomain^0 Invariant at l14: 0 <= bDomain^0 Invariant at l17: 0 <= bDomain^0 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 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): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, nj^0 -> 1 + nj^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, rest remain the same}> Checking unfeasibility... Time used: 0.388907 Checking conditional termination of SCC {l7, l14, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028143s Ranking function: -4 + 2*nDim^0 - 2*ni^0 New Graphs: Transitions: 1 + nj^0, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 Checking conditional termination of SCC {l7, l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017639s Ranking function: -3 + 3*nDim^0 - 2*ni^0 - nj^0 New Graphs: Transitions: 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 Checking conditional termination of SCC {l7, l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013706s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.365708s [19992 : 19993] [19992 : 19994] Successful child: 19994 Ranking function: bNoCapture^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 1, rest remain the same}> 0, rest remain the same}> 1, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 Checking conditional termination of SCC {l7, l14}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011353s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.194636s [19992 : 19998] [19992 : 19999] Successful child: 19999 Ranking function: -bNoCapture^0 Ranking function and negation of Quasi-Invariant applied It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 1, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> It's unfeasible after collapsing. Removing transition: 0, nj^0 -> 1 + nj^0, rest remain the same}> New Graphs: Transitions: 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bDomain^0, bNoCapture^0, nDim^0, ni^0, nj^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017903s Ranking function: -1 + nDim^0 - nj^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l2}... No cycles found. Program Terminates