/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}> undef67, a1818^0 -> (0 + undef67), i^0 -> undef98, i___01717^0 -> (0 + Irql^0), k3^0 -> (~(1) + k3^0), keR^0 -> 0}> undef388}> undef570}> undef797, __rho_7_^0 -> undef813, k2^0 -> (~(1) + k2^0)}> undef866, i___01313^0 -> (0 + Irql^0), k3^0 -> (0 + undef866), keR^0 -> 0}> 0}> (0 + CromData^0)}> undef1239}> undef1418, k4^0 -> (0 + undef1418), keA^0 -> 0}> undef1544}> undef1595, k1^0 -> (~(1) + k1^0)}> undef1668, i___099^0 -> (0 + Irql^0), k2^0 -> (0 + undef1668), keA^0 -> 0, keR^0 -> 0}> undef1793, k1^0 -> (0 + undef1793), keA^0 -> 0, ntStatus^0 -> (0 + undef1837), ret_IoSetDeviceInterfaceState44^0 -> undef1837}> 1}> 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 + undef2511), ret_t1394Diag_PnpStopDevice33^0 -> undef2511}> (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 + undef2573), ret_t1394_SubmitIrpSynch3636^0 -> undef2573}> (0 + ResourceIrp^0)}> 1, b2929^0 -> 0, pIrb^0 -> (0 + undef2691), ret_ExAllocatePool3030^0 -> undef2691}> (0 + undef2997), a2525^0 -> 1, b2626^0 -> 0, pIrb^0 -> undef2993, ret_IoAllocateIrp2727^0 -> undef2997}> undef3011, i___04040^0 -> (0 + Irql^0), k5^0 -> (0 + undef3011), keA^0 -> 0, keR^0 -> 0}> undef3070, i___02424^0 -> (0 + Irql^0), k4^0 -> (~(1) + k4^0), keR^0 -> 0}> undef3137, __rho_666_^0 -> undef3142, ioA^0 -> undef3170, ioR^0 -> undef3171, keA^0 -> (0 + undef3178), keR^0 -> undef3178, phi_io_compl^0 -> 0, phi_nSUC_ret^0 -> 0}> Fresh variables: undef62, undef67, undef98, undef124, undef125, undef388, undef570, undef797, undef813, undef858, undef866, undef920, undef1043, undef1239, undef1418, undef1471, undef1544, undef1595, undef1668, undef1716, undef1717, undef1793, undef1837, undef1840, undef2390, undef2511, undef2573, undef2691, undef2993, undef2997, undef3001, undef3011, undef3063, undef3064, undef3070, undef3126, undef3137, undef3142, undef3170, undef3171, undef3178, Undef variables: undef62, undef67, undef98, undef124, undef125, undef388, undef570, undef797, undef813, undef858, undef866, undef920, undef1043, undef1239, undef1418, undef1471, undef1544, undef1595, undef1668, undef1716, undef1717, undef1793, undef1837, undef1840, undef2390, undef2511, undef2573, undef2691, undef2993, undef2997, undef3001, undef3011, undef3063, undef3064, undef3070, undef3126, undef3137, undef3142, undef3170, undef3171, undef3178, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef3011)}> (~(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 + undef866)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (~(1) + k1^0)}> (0 + undef1668)}> (~(1) + k5^0)}> Fresh variables: undef62, undef67, undef98, undef124, undef125, undef388, undef570, undef797, undef813, undef858, undef866, undef920, undef1043, undef1239, undef1418, undef1471, undef1544, undef1595, undef1668, undef1716, undef1717, undef1793, undef1837, undef1840, undef2390, undef2511, undef2573, undef2691, undef2993, undef2997, undef3001, undef3011, undef3063, undef3064, undef3070, undef3126, undef3137, undef3142, undef3170, undef3171, undef3178, Undef variables: undef62, undef67, undef98, undef124, undef125, undef388, undef570, undef797, undef813, undef858, undef866, undef920, undef1043, undef1239, undef1418, undef1471, undef1544, undef1595, undef1668, undef1716, undef1717, undef1793, undef1837, undef1840, undef2390, undef2511, undef2573, undef2691, undef2993, undef2997, undef3001, undef3011, undef3063, undef3064, undef3070, undef3126, undef3137, undef3142, undef3170, undef3171, undef3178, 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 undef1668, rest remain the same}> Graph 3 undef866, rest remain the same}> Graph 4 Graph 5 undef3011, 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.008933 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004526s Ranking function: -1 + k1^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.035438 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014557s Ranking function: -1 + k2^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.001776 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002140s Ranking function: -1 + k3^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.002239 > 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: undef866, 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: undef1668, rest remain the same}> * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST [47442 : 47555] [47442 : 47556] 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: undef1668, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47442 : 47564] [47442 : 47565] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.158795s 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: undef1668, 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: undef866, rest remain the same}> POST: 1 <= 0 LOG: Try proving POST [47442 : 47952] [47442 : 47953] [47442 : 47954] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.322155s LOG: NarrowEntry size 1 Narrowing transition: -1 + k3^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef866, rest remain the same}> END ENTRIES: GRAPH: -1 + k3^0, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST [47442 : 48974] [47442 : 48975] [47442 : 48977] LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 15.068951s Cannot prove unreachability [47442 : 52481] [47442 : 52482] Successful child: 52481 Program does NOT terminate