/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef1, a_128^0 -> undef3, a_243^0 -> ((~(1) + _^0) + undef3), c_15^0 -> (0 + undef37), elem_16^0 -> (0 + undef18), len_246^0 -> 1, lt_19^0 -> undef14, lt_20^0 -> undef15, lt_21^0 -> undef16, prev_17^0 -> 0, x_13^0 -> undef18, y_14^0 -> (0 + undef28)}> undef51, i_8^0 -> (1 + i_8^0), len_48^0 -> (1 + len_48^0)}> undef101, i_8^0 -> (1 + undef121), len_48^0 -> (0 + undef121), length_7^0 -> undef106, x_13^0 -> (0 + x_23^0)}> (0 + len_246^0), lt_19^0 -> undef136, lt_20^0 -> undef137, x_13^0 -> (0 + y_14^0)}> (0 + undef175), lt_18^0 -> undef162, lt_19^0 -> undef163, lt_20^0 -> undef164, prev_17^0 -> (0 + elem_16^0)}> undef178}> (~(1) + a_243^0), c_15^0 -> (0 + undef228), elem_16^0 -> (0 + x_13^0), len_246^0 -> (1 + k_296^0), lt_21^0 -> undef218, prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> Fresh variables: undef1, undef3, undef14, undef15, undef16, undef18, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef51, undef101, undef106, undef120, undef121, undef122, undef136, undef137, undef148, undef149, undef162, undef163, undef164, undef175, undef176, undef177, undef178, undef218, undef228, Undef variables: undef1, undef3, undef14, undef15, undef16, undef18, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef51, undef101, undef106, undef120, undef121, undef122, undef136, undef137, undef148, undef149, undef162, undef163, undef164, undef175, undef176, undef177, undef178, undef218, undef228, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((~(1) + _^0) + undef3), c_15^0 -> (0 + undef37), elem_16^0 -> (0 + undef18), len_246^0 -> 1, prev_17^0 -> 0, y_14^0 -> (0 + undef28)}> undef51, i_8^0 -> (1 + i_8^0), len_48^0 -> (1 + len_48^0)}> (~(1) + a_243^0), c_15^0 -> (0 + undef228), elem_16^0 -> (0 + (0 + y_14^0)), len_246^0 -> (1 + (0 + len_246^0)), prev_17^0 -> 0, y_14^0 -> (0 + c_15^0)}> (0 + undef175), prev_17^0 -> (0 + elem_16^0)}> Fresh variables: undef1, undef3, undef14, undef15, undef16, undef18, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef51, undef101, undef106, undef120, undef121, undef122, undef136, undef137, undef148, undef149, undef162, undef163, undef164, undef175, undef176, undef177, undef178, undef218, undef228, Undef variables: undef1, undef3, undef14, undef15, undef16, undef18, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef51, undef101, undef106, undef120, undef121, undef122, undef136, undef137, undef148, undef149, undef162, undef163, undef164, undef175, undef176, undef177, undef178, undef218, undef228, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef51, i_8^0 -> 1 + i_8^0, len_48^0 -> 1 + len_48^0, rest remain the same}> Variables: head_9^0, i_8^0, len_48^0, length_7^0 Graph 2: Transitions: -1 + a_243^0, c_15^0 -> undef228, elem_16^0 -> y_14^0, len_246^0 -> 1 + len_246^0, prev_17^0 -> 0, y_14^0 -> c_15^0, rest remain the same}> Variables: a_243^0, c_15^0, elem_16^0, len_246^0, prev_17^0, y_14^0, y_309^0 Graph 3: Transitions: Variables: Graph 4: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 -1 + _^0 + undef3, c_15^0 -> undef37, elem_16^0 -> undef18, len_246^0 -> 1, prev_17^0 -> 0, y_14^0 -> undef28, rest remain the same}> Graph 3 undef175, prev_17^0 -> elem_16^0, rest remain the same}> Graph 4 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ( 6 , 3 ) ( 7 , 4 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003438 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001010s Ranking function: -1 - i_8^0 + length_7^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.00553 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001855s Ranking function: a_243^0 New Graphs: Proving termination of subgraph 3 Analyzing SCC {l6}... No cycles found. Proving termination of subgraph 4 Analyzing SCC {l7}... No cycles found. Program Terminates