0.00/0.15 NO 0.00/0.15 0.00/0.15 Solver Timeout: 4 0.00/0.15 Global Timeout: 300 0.00/0.15 No parsing errors! 0.00/0.15 Init Location: 0 0.00/0.15 Transitions: 0.00/0.15 0.00/0.15 0.00/0.15 0, unset^0 -> 0}> 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 (0 + DName^0), num^0 -> (1 + num^0)}> 0.00/0.15 0}> 0.00/0.15 (1 + i^0)}> 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 (0 + DName^0), a88^0 -> (0 + Pdoi^0), pc^0 -> 0, ret_IoCreateDevice1010^0 -> undef271, status^0 -> (0 + undef271), tmp99^0 -> undef276}> 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 (0 + undef365), a11^0 -> (0 + lptNamei^0), b22^0 -> (0 + PdoType^0), c33^0 -> (0 + dcIdi^0), d44^0 -> (0 + num^0), ret_PPMakeDeviceName66^0 -> undef365, tmp55^0 -> undef368}> 0.00/0.15 0.00/0.15 0, unset^0 -> undef416}> 0.00/0.15 0.00/0.15 0.00/0.15 Fresh variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Undef variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Abstraction variables: 0.00/0.15 0.00/0.15 Exit nodes: 0.00/0.15 0.00/0.15 Accepting locations: 0.00/0.15 0.00/0.15 Asserts: 0.00/0.15 0.00/0.15 Preprocessed LLVMGraph 0.00/0.15 Init Location: 0 0.00/0.15 Transitions: 0.00/0.15 0.00/0.15 0.00/0.15 (1 + i^0)}> 0.00/0.15 0, num^0 -> 0}> 0.00/0.15 0, num^0 -> 0}> 0.00/0.15 0, num^0 -> 0}> 0.00/0.15 0}> 0.00/0.15 0}> 0.00/0.15 0.00/0.15 Fresh variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Undef variables: 0.00/0.15 undef47, undef271, undef276, undef278, undef365, undef368, undef416, undef417, undef418, 0.00/0.15 0.00/0.15 Abstraction variables: 0.00/0.15 0.00/0.15 Exit nodes: 0.00/0.15 0.00/0.15 Accepting locations: 0.00/0.15 0.00/0.15 Asserts: 0.00/0.15 0.00/0.15 ************************************************************* 0.00/0.15 ******************************************************************************************* 0.00/0.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.15 ******************************************************************************************* 0.00/0.15 0.00/0.15 Init Location: 0 0.00/0.15 Graph 0: 0.00/0.15 Transitions: 0.00/0.15 Variables: 0.00/0.15 0.00/0.15 Graph 1: 0.00/0.15 Transitions: 0.00/0.15 1 + i^0, rest remain the same}> 0.00/0.15 Variables: 0.00/0.15 Pdolen^0, i^0 0.00/0.15 0.00/0.15 Graph 2: 0.00/0.15 Transitions: 0.00/0.15 0.00/0.15 Variables: 0.00/0.15 0.00/0.15 Precedence: 0.00/0.15 Graph 0 0.00/0.15 0.00/0.15 Graph 1 0.00/0.15 0.00/0.15 0.00/0.15 Graph 2 0.00/0.15 0, num^0 -> 0, rest remain the same}> 0.00/0.15 0, num^0 -> 0, rest remain the same}> 0.00/0.15 0, num^0 -> 0, rest remain the same}> 0.00/0.15 0, rest remain the same}> 0.00/0.15 0, rest remain the same}> 0.00/0.15 0.00/0.15 Map Locations to Subgraph: 0.00/0.15 ( 0 , 0 ) 0.00/0.15 ( 4 , 2 ) 0.00/0.15 ( 9 , 1 ) 0.00/0.15 0.00/0.15 ******************************************************************************************* 0.00/0.15 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.15 ******************************************************************************************* 0.00/0.15 0.00/0.15 Proving termination of subgraph 0 0.00/0.15 Proving termination of subgraph 1 0.00/0.15 Checking unfeasibility... 0.00/0.15 Time used: 0.002232 0.00/0.15 0.00/0.15 Checking conditional termination of SCC {l9}... 0.00/0.15 0.00/0.15 LOG: CALL solveLinear 0.00/0.15 0.00/0.15 LOG: RETURN solveLinear - Elapsed time: 0.001192s 0.00/0.15 Ranking function: -1 + Pdolen^0 - i^0 0.00/0.15 New Graphs: 0.00/0.15 Proving termination of subgraph 2 0.00/0.15 Checking unfeasibility... 0.00/0.15 Time used: 0.002009 0.00/0.15 0.00/0.15 > No variable changes in termination graph. 0.00/0.15 Checking conditional unfeasibility... 0.00/0.15 Termination failed. Trying to show unreachability... 0.00/0.15 Proving unreachability of entry: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 0.00/0.15 LOG: CALL check - Post:1 <= 0 - Process 1 0.00/0.15 * Exit transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 * Postcondition : 1 <= 0 0.00/0.15 Postcodition moved up: 1 <= 0 0.00/0.15 0.00/0.15 LOG: Try proving POST 0.00/0.15 Postcondition: 1 <= 0 0.00/0.15 0.00/0.15 LOG: CALL check - Post:1 <= 0 - Process 2 0.00/0.15 * Exit transition: 0.00/0.15 * Postcondition : 1 <= 0 0.00/0.15 0.00/0.15 LOG: CALL solveLinear 0.00/0.15 0.00/0.15 LOG: RETURN solveLinear - Elapsed time: 0.000891s 0.00/0.15 > Postcondition is not implied! 0.00/0.15 0.00/0.15 LOG: RETURN check - Elapsed time: 0.001047s 0.00/0.15 0.00/0.15 LOG: NarrowEntry size 1 0.00/0.15 It's unfeasible. Removing transition: 0.00/0.15 1 + i^0, rest remain the same}> 0.00/0.15 ENTRIES: 0.00/0.15 0.00/0.15 END ENTRIES: 0.00/0.15 GRAPH: 0.00/0.15 END GRAPH: 0.00/0.15 EXIT: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 POST: 1 <= 0 0.00/0.15 0.00/0.15 0.00/0.15 LOG: Try proving POST 0.00/0.15 Solving with 1 template(s). 0.00/0.15 0.00/0.15 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.15 0.00/0.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002851s 0.00/0.15 Time used: 0.002745 0.00/0.15 Solving with 2 template(s). 0.00/0.15 0.00/0.15 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.15 0.00/0.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004950s 0.00/0.15 Time used: 0.004769 0.00/0.15 Solving with 3 template(s). 0.00/0.15 0.00/0.15 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.15 0.00/0.15 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007757s 0.00/0.15 Time used: 0.007532 0.00/0.15 0.00/0.15 LOG: Postcondition is not implied - no solution 0.00/0.15 > Postcondition is not implied! 0.00/0.15 0.00/0.15 LOG: RETURN check - Elapsed time: 0.023495s 0.00/0.15 Cannot prove unreachability 0.00/0.15 0.00/0.15 Proving non-termination of subgraph 2 0.00/0.15 Transitions: 0.00/0.15 0.00/0.15 Variables: 0.00/0.15 0.00/0.15 Checking conditional non-termination of SCC {l4}... 0.00/0.15 > No exit transition to close. 0.00/0.15 Calling reachability with... 0.00/0.15 Transition: 0.00/0.15 Conditions: 0.00/0.15 Transition: 0.00/0.15 Conditions: 0.00/0.15 Transition: 0.00/0.15 Conditions: 0.00/0.15 Transition: 0.00/0.15 Conditions: 0.00/0.15 Transition: 0.00/0.15 Conditions: 0.00/0.15 OPEN EXITS: 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 --- Reachability graph --- 0.00/0.15 > Graph without transitions. 0.00/0.15 0.00/0.15 Calling reachability with... 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, num^0 -> 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 Transition: 0, rest remain the same}> 0.00/0.15 Conditions: 0.00/0.15 OPEN EXITS: 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2) 0.00/0.15 0, rest remain the same}> (condsUp: 1 <= undef365, undef365 = undef368, undef47 = 1) 0.00/0.15 0, rest remain the same}> (condsUp: undef47 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2) 0.00/0.15 0, rest remain the same}> (condsUp: 1 <= undef365, undef365 = undef368, undef47 = 1) 0.00/0.15 0, rest remain the same}> (condsUp: undef47 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2) 0.00/0.15 0, rest remain the same}> (condsUp: 1 <= undef365, undef365 = undef368, undef47 = 1) 0.00/0.15 0, rest remain the same}> (condsUp: undef47 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2) 0.00/0.15 0, rest remain the same}> (condsUp: 1 <= undef365, undef365 = undef368, undef47 = 1) 0.00/0.15 0, rest remain the same}> (condsUp: undef47 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1) 0.00/0.15 0, num^0 -> 0, rest remain the same}> (condsUp: undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2) 0.00/0.15 0, rest remain the same}> (condsUp: 1 <= undef365, undef365 = undef368, undef47 = 1) 0.00/0.15 0, rest remain the same}> (condsUp: undef47 = 1) 0.00/0.15 0.00/0.15 --- Reachability graph --- 0.00/0.15 > Graph without transitions. 0.00/0.15 0.00/0.15 Calling reachability with... 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef365, undef365 = undef368, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: Pdolen^0 <= i^0, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef365, undef365 = undef368, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: Pdolen^0 <= i^0, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef365, undef365 = undef368, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: Pdolen^0 <= i^0, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef365, undef365 = undef368, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: Pdolen^0 <= i^0, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef271 <= 0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, 3 <= undef271, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, undef365 <= 0, undef271 = undef276, undef365 = undef368, undef47 = 1, undef278 = 1, undef271 = 2, 0.00/0.15 Transition: 0.00/0.15 Conditions: 1 + i^0 <= Pdolen^0, 1 <= undef365, undef365 = undef368, undef47 = 1, 0.00/0.15 Transition: 0.00/0.15 Conditions: Pdolen^0 <= i^0, undef47 = 1, 0.00/0.15 OPEN EXITS: 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 0.00/0.15 > Conditions are reachable! 0.00/0.15 0.00/0.15 Program does NOT terminate 0.00/0.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.15 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.15 EOF