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