/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 + ret_check838^0)}> 10}> 0}> 50}> (1 + i20^0)}> 0}> (0 + ret_check1026^0)}> 10}> 0}> (0 + ret_check824^0)}> 10}> 0}> 200}> (1 + i6^0)}> 0}> (0 + ret_check1012^0)}> 10}> 0}> (1 + i62^0)}> 0}> (0 + ret_check1068^0)}> 10}> 0}> (0 + ret_check810^0)}> (0 + ret_check866^0)}> 10}> 0}> 200}> (1 + i48^0)}> 0}> (0 + ret_check1054^0)}> 10}> 0}> (0 + ret_check852^0)}> 10}> 0}> 20}> 10}> 0}> (1 + i34^0)}> 0}> (0 + ret_check1040^0)}> 10}> 0}> 100}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0, tmp___08^0 -> (0 + 10)}> 0, n19^0 -> 200, tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10), tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0), tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10), tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0), tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> (0 + 0)}> 0, n19^0 -> 200}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, n47^0 -> 20}> 50, tmp___036^0 -> (0 + 10)}> 50, tmp___036^0 -> (0 + 0)}> 50, n47^0 -> 20}> 50, n47^0 -> 20}> (1 + i20^0)}> 0, n19^0 -> 200}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 10)}> 200, n33^0 -> 50, tmp___036^0 -> (0 + 0)}> 200, n33^0 -> 50, n47^0 -> 20}> 200, n33^0 -> 50, n47^0 -> 20}> (1 + i6^0)}> 20}> (1 + i34^0)}> 0, n61^0 -> 200}> 200}> 200}> (1 + i48^0)}> (1 + i62^0)}> 0}> 0, n61^0 -> 200}> 200}> 200}> 0, n61^0 -> 200}> 200}> 200}> 20}> 0}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + i6^0, rest remain the same}> Variables: i6^0 Graph 2: Transitions: 1 + i20^0, rest remain the same}> Variables: i20^0, n19^0 Graph 3: Transitions: Variables: Graph 4: Transitions: 1 + i34^0, rest remain the same}> Variables: i34^0, n33^0 Graph 5: Transitions: Variables: Graph 6: Transitions: 1 + i48^0, rest remain the same}> Variables: i48^0, n47^0 Graph 7: Transitions: 1 + i62^0, rest remain the same}> Variables: i62^0, n61^0 Graph 8: Transitions: Variables: Precedence: Graph 0 Graph 1 0, tmp___08^0 -> 10, rest remain the same}> Graph 2 0, n19^0 -> 200, tmp___08^0 -> 0, rest remain the same}> 0, n19^0 -> 200, rest remain the same}> 0, n19^0 -> 200, rest remain the same}> Graph 3 200, n33^0 -> 50, tmp___036^0 -> 10, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 10, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 10, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 10, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, rest remain the same}> 50, tmp___036^0 -> 10, rest remain the same}> 50, tmp___036^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 10, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 10, rest remain the same}> 200, n33^0 -> 50, tmp___036^0 -> 0, rest remain the same}> Graph 4 0, rest remain the same}> 0, rest remain the same}> Graph 5 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, n47^0 -> 20, tmp___08^0 -> 0, rest remain the same}> 200, n33^0 -> 50, n47^0 -> 20, rest remain the same}> 200, n33^0 -> 50, n47^0 -> 20, rest remain the same}> 50, n47^0 -> 20, rest remain the same}> 200, n33^0 -> 50, n47^0 -> 20, rest remain the same}> 200, n33^0 -> 50, n47^0 -> 20, rest remain the same}> 20, rest remain the same}> 20, rest remain the same}> Graph 6 0, rest remain the same}> Graph 7 0, n61^0 -> 200, rest remain the same}> 0, n61^0 -> 200, rest remain the same}> 0, n61^0 -> 200, rest remain the same}> Graph 8 200, rest remain the same}> 200, rest remain the same}> 200, rest remain the same}> 200, rest remain the same}> 200, rest remain the same}> 200, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 13 , 2 ) ( 18 , 1 ) ( 25 , 4 ) ( 27 , 6 ) ( 34 , 8 ) ( 35 , 7 ) ( 57 , 5 ) ( 61 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001502 Checking conditional termination of SCC {l18}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002314s Ranking function: 99 - i6^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.002231 Checking conditional termination of SCC {l13}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002444s Ranking function: -1 - i20^0 + n19^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l61}... No cycles found. Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.002167 Checking conditional termination of SCC {l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002563s Ranking function: -1 - i34^0 + n33^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l57}... No cycles found. Proving termination of subgraph 6 Checking unfeasibility... Time used: 0.001771 Checking conditional termination of SCC {l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002461s Ranking function: -1 - i48^0 + n47^0 New Graphs: Proving termination of subgraph 7 Checking unfeasibility... Time used: 0.002242 Checking conditional termination of SCC {l35}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002600s Ranking function: -1 - i62^0 + n61^0 New Graphs: Proving termination of subgraph 8 Analyzing SCC {l34}... No cycles found. Program Terminates