/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: (0 + Irql^0), keR^0 -> 0}> undef68, a1818^0 -> (0 + undef68), i^0 -> undef100, i___01717^0 -> (0 + Irql^0), k3^0 -> (~(1) + k3^0), keR^0 -> 0}> undef394}> undef579}> undef810, __rho_7_^0 -> undef826, k2^0 -> (~(1) + k2^0)}> undef880, i___01313^0 -> (0 + Irql^0), k3^0 -> (0 + undef880), keR^0 -> 0}> 0}> (0 + CromData^0)}> undef1259}> undef1441, k4^0 -> (0 + undef1441), keA^0 -> 0}> undef1569}> undef1621, k1^0 -> (~(1) + k1^0)}> undef1695, i___099^0 -> (0 + Irql^0), k2^0 -> (0 + undef1695), keA^0 -> 0, keR^0 -> 0}> undef1822, k1^0 -> (0 + undef1822), keA^0 -> 0, ntStatus^0 -> (0 + undef1867), ret_IoSetDeviceInterfaceState44^0 -> undef1867}> 0}> 2, a4444^0 -> 1, k5^0 -> (~(1) + k5^0), phi_io_compl^0 -> 1}> (0 + Irql^0), keR^0 -> 0}> 1, b22^0 -> (0 + Irp^0), ntStatus^0 -> (0 + undef2552), ret_t1394Diag_PnpStopDevice33^0 -> undef2552}> (0 + pIrb^0), a3434^0 -> (0 + ResourceIrp^0), a3737^0 -> (0 + pIrb^0), a3838^0 -> (0 + ResourceIrp^0), b3333^0 -> 0, b3535^0 -> (0 + pIrb^0), ntStatus^0 -> (0 + undef2615), ret_t1394_SubmitIrpSynch3636^0 -> undef2615}> (0 + ResourceIrp^0)}> 1, b2929^0 -> 0, pIrb^0 -> (0 + undef2735), ret_ExAllocatePool3030^0 -> undef2735}> (0 + undef3046), a2525^0 -> 1, b2626^0 -> 0, pIrb^0 -> undef3042, ret_IoAllocateIrp2727^0 -> undef3046}> undef3060, i___04040^0 -> (0 + Irql^0), k5^0 -> (0 + undef3060), keA^0 -> 0, keR^0 -> 0}> undef3120, i___02424^0 -> (0 + Irql^0), k4^0 -> (~(1) + k4^0), keR^0 -> 0}> undef3188, __rho_666_^0 -> undef3193, ioA^0 -> undef3222, ioR^0 -> undef3223, keA^0 -> (0 + undef3230), keR^0 -> undef3230, phi_io_compl^0 -> 0, phi_nSUC_ret^0 -> 0}> Fresh variables: undef63, undef68, undef100, undef126, undef127, undef394, undef579, undef810, undef826, undef872, undef880, undef935, undef1060, undef1259, undef1441, undef1495, undef1569, undef1621, undef1695, undef1744, undef1745, undef1822, undef1867, undef1870, undef2429, undef2552, undef2615, undef2735, undef3042, undef3046, undef3050, undef3060, undef3113, undef3114, undef3120, undef3177, undef3188, undef3193, undef3222, undef3223, undef3230, Undef variables: undef63, undef68, undef100, undef126, undef127, undef394, undef579, undef810, undef826, undef872, undef880, undef935, undef1060, undef1259, undef1441, undef1495, undef1569, undef1621, undef1695, undef1744, undef1745, undef1822, undef1867, undef1870, undef2429, undef2552, undef2615, undef2735, undef3042, undef3046, undef3050, undef3060, undef3113, undef3114, undef3120, undef3177, undef3188, undef3193, undef3222, undef3223, undef3230, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef3060)}> (~(1) + k3^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (~(1) + k2^0)}> (0 + undef880)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (0 + undef1695)}> (~(1) + k5^0)}> Fresh variables: undef63, undef68, undef100, undef126, undef127, undef394, undef579, undef810, undef826, undef872, undef880, undef935, undef1060, undef1259, undef1441, undef1495, undef1569, undef1621, undef1695, undef1744, undef1745, undef1822, undef1867, undef1870, undef2429, undef2552, undef2615, undef2735, undef3042, undef3046, undef3050, undef3060, undef3113, undef3114, undef3120, undef3177, undef3188, undef3193, undef3222, undef3223, undef3230, Undef variables: undef63, undef68, undef100, undef126, undef127, undef394, undef579, undef810, undef826, undef872, undef880, undef935, undef1060, undef1259, undef1441, undef1495, undef1569, undef1621, undef1695, undef1744, undef1745, undef1822, undef1867, undef1870, undef2429, undef2552, undef2615, undef2735, undef3042, undef3046, undef3050, undef3060, undef3113, undef3114, undef3120, undef3177, undef3188, undef3193, undef3222, undef3223, undef3230, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> Variables: k1^0 Graph 2: Transitions: -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> Variables: k2^0 Graph 3: Transitions: -1 + k3^0, rest remain the same}> Variables: k3^0 Graph 4: Transitions: Variables: Graph 5: Transitions: -1 + k5^0, rest remain the same}> Variables: k5^0 Graph 6: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef1695, rest remain the same}> Graph 3 undef880, rest remain the same}> Graph 4 Graph 5 undef3060, rest remain the same}> Graph 6 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 4 ) ( 3 , 3 ) ( 5 , 2 ) ( 11 , 1 ) ( 20 , 5 ) ( 26 , 6 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.008939 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004551s Ranking function: -1 + k1^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.035477 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014539s Ranking function: -1 + k2^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.001777 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002154s Ranking function: -1 + k3^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.002254 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: undef880, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST LOG: CALL check - Post:1 <= 0 - Process 3 * Exit transition: undef1695, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST [47444 : 47445] [47444 : 47446] LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k1^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> -1 + k1^0, rest remain the same}> END GRAPH: EXIT: undef1695, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47444 : 47447] [47444 : 47448] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.165911s LOG: NarrowEntry size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + k2^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef1695, rest remain the same}> END ENTRIES: GRAPH: -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> -1 + k2^0, rest remain the same}> END GRAPH: EXIT: undef880, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47444 : 47449] [47444 : 47450] [47444 : 47451] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.327946s LOG: NarrowEntry size 1 Narrowing transition: -1 + k3^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef880, rest remain the same}> END ENTRIES: GRAPH: -1 + k3^0, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST [47444 : 47464] [47444 : 47465] [47444 : 47466] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 15.040603s Cannot prove unreachability [47444 : 47524] [47444 : 47525] Successful child: 47524 Program does NOT terminate