/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, lt_32^0 -> undef17, lt_34^0 -> undef18, x_19^0 -> (0 + undef33), y_20^0 -> (0 + w_17^0)}> undef120, y_20^0 -> (0 + undef120)}> undef216, y_20^0 -> (0 + undef216)}> (~(1) + k_243^0)}> undef324, ___patmp2^0 -> undef325, k_243^0 -> (0 + undef325), len_263^0 -> (0 + undef324), lt_24^0 -> undef334, lt_25^0 -> undef335, x_13^0 -> (0 + undef354)}> (0 + undef389), ___cil_tmp5_10^0 -> undef389, k_139^0 -> undef393, k_187^0 -> undef394, k_208^0 -> (0 + undef394), len_99^0 -> undef399, lt_34^0 -> undef405, lt_35^0 -> undef406, lt_36^0 -> undef407, lt_37^0 -> undef408, lt_38^0 -> undef409, tmp_9^0 -> undef411, x_13^0 -> (0 + a_11^0), x_22^0 -> undef415, x_8^0 -> undef416, y_23^0 -> 0}> undef502, ___patmp2^0 -> undef503, k_243^0 -> (0 + undef503), len_263^0 -> (0 + undef502), lt_26^0 -> undef514, lt_27^0 -> undef515, x_13^0 -> (0 + undef532)}> undef620, y_20^0 -> (0 + undef620)}> Fresh variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Undef variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef33)}> (0 + undef33)}> (0 + undef325), len_263^0 -> (0 + undef324), x_13^0 -> (0 + undef354)}> (0 + undef325), len_263^0 -> (0 + undef324), x_13^0 -> (0 + undef354)}> Fresh variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Undef variables: undef1, undef17, undef18, undef33, undef120, undef216, undef324, undef325, undef334, undef335, undef354, undef355, undef389, undef393, undef394, undef399, undef405, undef406, undef407, undef408, undef409, undef411, undef415, undef416, undef420, undef421, undef422, undef423, undef424, undef425, undef426, undef427, undef428, undef429, undef430, undef431, undef432, undef433, undef434, undef435, undef502, undef503, undef514, undef515, undef532, undef533, undef620, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> Variables: k_243^0, len_263^0, x_13^0, y_12^0 Graph 2: Transitions: Variables: w_17^0, x_19^0 Precedence: Graph 0 Graph 1 Graph 2 undef33, rest remain the same}> undef33, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.01008 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002706s Ranking function: -1 + k_243^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003701 > No variable changes in termination graph. Checking conditional unfeasibility... Calling Safety with literal x_19^0 <= w_17^0 and entry LOG: CALL check - Post:x_19^0 <= w_17^0 - Process 1 * Exit transition: * Postcondition : x_19^0 <= w_17^0 Postcodition moved up: x_19^0 <= w_17^0 LOG: Try proving POST LOG: CALL check - Post:x_19^0 <= w_17^0 - Process 2 * Exit transition: undef33, rest remain the same}> * Postcondition : x_19^0 <= w_17^0 Postcodition moved up: undef33 <= w_17^0 LOG: Try proving POST [2168 : 2175] [2168 : 2176] LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> undef325, len_263^0 -> undef324, x_13^0 -> undef354, rest remain the same}> END GRAPH: EXIT: undef33, rest remain the same}> POST: x_19^0 <= w_17^0 LOG: Try proving POST [2168 : 2177] [2168 : 2178] [2168 : 2179] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 2.078418s LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 It's unfeasible. Removing transition: ENTRIES: undef33, rest remain the same}> END ENTRIES: GRAPH: END GRAPH: EXIT: POST: x_19^0 <= w_17^0 LOG: Try proving POST [2168 : 2267] [2168 : 2268] [2168 : 2269] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 6.187390s [2168 : 2422] [2168 : 2427] Successful child: 2427 Program does NOT terminate